单线区间列车最优运行次序的量子遗传算法  

Quantum Genetic Algorithm for obtaining optimal schedule of trains on single track line division

作　　者：何奉道[1] 何冬昀[2] 

机构地区：[1]西南交通大学信息科学与技术学院,成都610031 [2]四川大学工商管理学院,成都610064

出　　处：《铁路计算机应用》2007年第1期8-10,共3页Railway Computer Application

摘　　要：讨论在单线区间上以车站接续时间最好为目标的优化列车运行次序问题。首先建立该问题的数学模型,然后结合排序理论给出求解该问题的一个量子遗传算法,阐述算法的实现方法。通过对某车站实际运行图实例计算结果表明,该算法能在较短的时间内以97%以上的概率得到最优解,所得接续时间较实际运行图减少约31%。The optimal traveling order of trains on a single track line division with minimum connecting time at a station was discussed. Firstly, a mathematics model was established. Then by the theory of scheduling, a quantum genetic algorithms was put. The method was tested over the actual problem of trains schedule for one station. Experimental results showed this algorithm could get an optimal solution with more than 97 percent in shorter time, the connecting time was reduced by about 31 percents.

关 键 词：列车运行图 单线区间 优化 量子遗传算法 

分 类 号：U292[交通运输工程—交通运输规划与管理] TP39[交通运输工程—道路与铁道工程]