| 单线区间列车最优运行次序的量子遗传算法 |
| |
| 引用本文： | 何奉道,何冬昀.单线区间列车最优运行次序的量子遗传算法[J].铁路计算机应用,2007,16(1):8-10. |
| |
| 作者姓名： | 何奉道 何冬昀 |
| |
| 作者单位： | 西南交通大学,信息科学与技术学院,成都,610031%四川大学,工商管理学院,成都,610064 |
| |
| 摘 要： | 讨论在单线区间上以车站接续时间最好为目标的优化列车运行次序问题.首先建立该问题的数学模型,然后结合排序理论给出求解该问题的一个量子遗传算法,阐述算法的实现方法.通过对某车站实际运行图实例计算结果表明,该算法能在较短的时间内以97%以上的概率得到最优解,所得接续时间较实际运行图减少约31%.
|
| 关 键 词： | 列车运行图 单线区间 优化 量子遗传算法 |
| 文章编号： | 1005-8451（2007）01-0008-03 |
| 收稿时间： | 2007-01-15 |
| 修稿时间： | 2006-07-11 |
Quantum Genetic Algorithm for obtaining optimal schedule of trains on single track line division |
| |
| HE Feng-dao,HE Dong-yun.Quantum Genetic Algorithm for obtaining optimal schedule of trains on single track line division[J].Railway Computer Application,2007,16(1):8-10. |
| |
| Authors: | HE Feng-dao HE Dong-yun |
| |
| Institution: | 1 .School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China; 2.Business School, Sichuan University, Chengdu 610064, China |
| |
| Abstract: | 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. |
| |
| Keywords: | trains schedule single track line optimization Quantum Genetic Algorithms |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《铁路计算机应用》浏览原始摘要信息 |
| 点击此处可从《铁路计算机应用》下载免费的PDF全文 |
|
