[1] CAPRARA A, FISCHETTI M, TOTH P, et al. Algorithms for railway crew management[J]. Mathematical Programming, 2000, 79(1):125-141.
[2] FRELING R, LENTINK R M, WAGELMANS A P M. A decision support system for crew planning in passenger transportation using a flexible branch- and- price algorithm[J]. Annals of Operations Research, 2004, 127 (1-4): 203-222.
[3] 柴小树. 动车组乘务计划编制方法研究[D]. 长沙:中南 大学, 2013. [CHAI X S. Crew planning methods for motor train unit[D]. Changsha: Central South University, 2013.]
[4] 黄珊. 机车乘务员运用问题及其辅助编排系统研 究[D]. 长沙: 中南大学, 2014. [HUAN S. Locomotive crew scheduling problem and scheduling assistant system[D]. Changsha: Central South University, 2014.]
[5] 褚飞跃,田志强,倪少权. 高速铁路单循环乘务排班计 划编制模型与算法[J]. 铁道学报, 2012, 34(7):1-9. [CHU F Y, TIAN Z Q, NI S Q. Model and algorithm for formulation of the single cycle crew rostering plans of high- speed railways[J]. Journal of the China Railway Society, 2012, 34(7):1-9.]
[6] 张增勇,毛保华,杜鹏,等. 基于惩罚费用的城市轨道 交通乘务排班优化模型与算法[J]. 交通运输系统工 程与信息, 2014, 14(2):113-120. [ZHANG Z Y, MAO B H, DU P, et al. Urban rail transit crew scheduling model and algorithm based on punishment costs[J]. Journal of Transportation Systems Engineering and Information Technology, 2014, 14(2):113-120.]
[7] 丰富,陈绍宽,杜鹏. 考虑时间均衡度的城市轨道交通 乘务排班计划优化方法[J]. 交通运输系统工程与信 息, 2014, 14(6):164-170. [FENG F, CHEN S K, DU P. Time equitability- based crew scheduling optimization for urban rail transit[J]. Journal of Transportation Systems Engineering and Information Technology, 2014, 14(6):164-170.]
[8] 中华人民共和国铁道部. 铁路旅客运输管理规则[M]. 北京:中国铁道出版社, 2010. [People’s republic of China ministry of railway. Railway passenger transportation management rules[M]. Beijing: China Railway Press, 2010.]
[9] 李国勇,李维民. 人工智能及其应用[M]. 北京:电子工 业出版社,2009. [LI G Y, LI W M. Artificial intelligence and applications[M]. Beijing: Publishing House of Electronics Industry, 2009.]
[10] 张超群,郑建国,钱洁. 遗传算法编码方案比较[J]. 计 算机应用研究, 2011, 28(3):819-822. [ZHANG C Q, ZHANG J G, QIAN J. Comparison of coding schemes for genetic algorithms[J]. Application Research of Computers, 2011, 28(3): 819-822.] |