摘要
对单线铁路列车运行调整的优化问题，构造了一个变量数上限为（ｍ－１）ｎ的“约束可选择的”线性规划模型（ｍ为区段内车站数，ｎ为所涉及到的列车数），并说明在该模型中变量不必作整数性约束的理由。通过论证用一般线性规划的对偶算法求解本模型的可行性，使得该模型的求解问题迎刃而解。最后介绍了求解过程的几点技巧。
In this paper we study the optimization of the adjustment of train diagram on single-track rail lines. We construct a special linear programming model and call it the linearprogramming with selectable constraints. It is verified that the variables in this model arenot necessary to be constrained in the integer set.After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model,we get an effective algorithm. Finally,several techniques for algorithm are stated.
出处
《铁道学报》
EI
CSCD
北大核心
1994年第3期72-78,共7页
Journal of the China Railway Society
基金
霍英东青年教师基金
关键词
列车运行
调整
线性规划
对偶算法
adjustment of train diagram,optimization,selectable constraints,linear programming,dual algorithm
