摘要
本文讨论以车站均衡性为约束条件，以区段内总机车运营台数最少为目标，如何确定区段列车运行图中各列车的始发位置问题．建立了列车最优初始布点的数学模型，并将该模型的求解化归为求三个子规划问题的最优解．应用网络优化方法和最优匹配方法设计了复杂度为n3的多项式算法．
篢he problem of tbe original distribution for trave1ling graph of trains, with the restriction of eveness and the target of minimum locomotives in use, is discussed in this paper. A mathematics model of this problem is given, and three sub-programs have been deduced from the main program. By network flow methQd and optimal method, a polynomial algorithm is designed with the upper bound of n3.
出处
《长沙铁道学院学报》
CSCD
1997年第4期80-87,共8页
Journal of Changsha Railway University
