摘要
乘务交路计划的编制是乘务计划编制智能化的关键。简述客运专线乘务交路计划编制问题,在将其转化为一类特殊的旅行商问题(TSP)的基础上,建立了该问题的数学模型。改进了最大最小蚂蚁系统(MMAS,max-min ant system),提出用K-MMAS算法求解该数学模型。以京津城际客运专线相关数据为背景对该算法进行仿真,验证了算法的有效性。
Crew routing plan played a key role in intelligent crew scheduling. It was made a brief overview of crew scheduling for Passenger Dedicated Line, transformed the issue into a special Travelling Salesman Problem（TSP）, then established the mathematical mode. Based on improving the Max-Min Ant System（MMAS）, it was presented a K-MMAS algorithm to solve the mathematical model, then simulate the algorithm with Beijing-Tianjin inter-city Passenger Dedicated Line data, which was verified the effectiveness of the algorithm.
出处
《铁路计算机应用》
2009年第7期11-14,共4页
Railway Computer Application
