基于路段交换的多基地动车组运用计划的编制算法

An Algorithm for Multiple-Bases Train-set Scheduling Based on Path-exchange

多个基地的动车组共同完成某一运行图规定的任务 ,是动车组运用的一种较为普遍的方式 ,开发该种运用方式的编制算法 ,是研究动车组编制算法的重要组成部分。基于路段交换的思想开发了编制算法 :首先利用已有算法构造出较好的初始解 ,然后利用路段交换不断改进解的质量。利用实际线路数据进行实验 ,证明算法有效。

It's a normal way of train-set scheduling (TSS) that train-sets in multiple bases finish one time-table. Developing an algorithm for such a situation is an important part of TSS research. This paper develops an algorithm based on path-exchange: firstly, create a good initial solution with the existing algorithm; secondly, improve the quality of the solution continuously by means of path-exchange. This algorithm is confirmed to produce practical solutions with actual rtack data.