论文部分内容阅读
本文讨论以车站均衡性为约束条件，以区段内总机车运营台数最少为目标，如何确定区段列车运行图中各列车的始发位置问题．建立了列车最优初始布点的数学模型，并将该模型的求解化归为求三个子规划问题的最优解．应用网络优化方法和最优匹配方法设计了复杂度为n3的多项式算法．
This paper discusses the problem of how to determine the starting position of each train in the train operation diagram with the objective of minimizing the number of the total number of the locomotives operating in the station with the station equilibrium as the constraint condition. The mathematical model of the optimal initial location of the train is established, and the solution of the model is classified as the optimal solution to the three sub-planning problems. The polynomial algorithm with complexity n3 is designed by using network optimization method and optimal matching method.