|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2011年02 期
| 标题 |
| 禁忌搜索算法在编组站调机运用计划中的应用(33 卷) |
| 英文标题 |
| Application of Tabu Search Algorithm on the Scheduling Problem of Shunting Locomotive |
| 摘要 |
| 在分析论述调机运用计划编制方法的基础上，提出应用禁忌搜索算法进行编组站调机运用计划的编制。分别以最小化延迟解体列车和编组列车加权数量为目标建立数学模型，以解编顺序作为优化对象，设计禁忌搜索算法对其进行求解，并以解体顺序为例，采用两两交换(2-opt)方式构建邻域 |
| 作者 |
| 新闻作者:王 烁，何世伟，黎浩东，申永生 |
| 关键字 |
