|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009年07 期
| 标题 |
| 基于蚁群算法的客运专线乘务交路计划编制方法研究(18 卷) |
| 英文标题 |
| Study on algorithm of crew routing scheduling for Passenger Dedicated Line based on Ant Colony Optimization |
| 摘要 |
| 乘务交路计划的编制是乘务计划编制智能化的关键。简述客运专线乘务交路计划编制问题，在将其转化为一类特殊的旅行商问题（TSP）的基础上，建立了该问题的数学模型。改进了最大最小蚂蚁系统（MMAS, max-min ant system），提出用K-MMAS算法求解该数学模型。以京津城际客运专线 |
| 作者 |
| 新闻作者:王媛媛，周成晨，倪少权 |
| 关键字 |
