|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2009年07 期
| 標題 |
| 基于蟻群算法的客運專線乘務(wù)交路計劃編制方法研究(18 卷) |
| 英文標題 |
| Study on algorithm of crew routing scheduling for Passenger Dedicated Line based on Ant Colony Optimization |
| 摘要 |
| 乘務(wù)交路計劃的編制是乘務(wù)計劃編制智能化的關(guān)鍵。簡述客運專線乘務(wù)交路計劃編制問題，在將其轉(zhuǎn)化為一類特殊的旅行商問題（TSP）的基礎(chǔ)上，建立了該問題的數(shù)學(xué)模型。改進了最大最小螞蟻系統(tǒng)（MMAS, max-min ant system），提出用K-MMAS算法求解該數(shù)學(xué)模型。以京津城際客運專線 |
| 作者 |
| 新聞作者:王媛媛，周成晨，倪少權(quán) |
| 關(guān)鍵字 |
