[1]Wren A,Fores S,Kwan A S K,et al.A flexible system for scheduling drivers[J]. Journal of Scheduling, 2003, 6(5): 437-55.
[2]Hickman M, Mirchandani P. Computeraided systems in public transport[C]//Lecture Notes in Economics and Mathematical Systems . Berlin: Springer, 2008.
[3]Jütte S, Thonemann U W. Divideandprice: A decomposition algorithm for solving large railway crew scheduling problems[J]. European Journal of Operational Research, 2012, 219(2): 214-223.
[4]Shen Y,Kwan R S K.Tabu search for driver scheduling[C]. Lecture Notes in Economics and Mathematical Systems, Berlin: Springer, 2001(505): 121-135.
[5]Fores S. Column generation approaches to bus driver scheduling[D]. University of Leeds, 1996.
[6]Li J, Kwan R S K. A fuzzy genetic algorithm for driver scheduling[J]. European Journal of Operational Research, 2003, 147(2): 334-344.
[7]Shen Y. Tabu search for bus and train driver scheduling with time windows[D]. University of Leeds, 2001.
[8]Shen Y, Xia J. Integrated bus transit scheduling for the Beijing bus group based on a unified mode of operation[J]. International Transactions in Operational Research, 2009, 16(2): 227-242.
[9]沈吟东,倪郁东. 含时间窗的司售员调度问题建模及多邻域结构设计[J]. 华中科技大学学报, 2008, 36(12): 31-34. [SHEN Y D ,NI Y D. Model for crew scheduling with time windows and multineighborhood structures[J]. Journal of Huazhong University of Science and Technology (Natural Science Edition), 2008, 36(12):31-34.]
[10]Mesquita M, Paias A. Set partitioning and coveringbased approaches for the integrated vehicle and crew scheduling problem[J]. Computers & Operations Research, 2008, 35(5): 1562-1575.
[11]Shen Yindong. Two neighbourhood search approaches: 2opt heuristics and tabu search for bus and train driver scheduling [M]. Beijing: Science Press, 2003.
[12]Shen Y, Chen S, Su X. Rail crew scheduling based on a pooling mode for high speed passenger lines[C]//Proceedings of 2010 International Conference on Logistics Engineering and Intelligent Transportation Systems, 2010. |