|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2007年01 期
| 标题 |
| 单线区间列车最优运行次序的量子遗传算法(16 卷) |
| 英文标题 |
| Quantum Genetic Algorithm for obtaining optimal schedule of trains on single track line division |
| 摘要 |
| 讨论在单线区间上以车站接续时间最好为目标的优化列车运行次序问题。首先建立该问题的数学模型，然后结合排序理论给出求解该问题的一个量子遗传算法，阐述算法的实现方法。通过对某车站实际运行图实例计算结果表明，该算法能在较短的时间内以97 %以上的概率得到最优解，所得 |
| 作者 |
| 新闻作者:何奉道1，何冬昀2 |
| 关键字 |
