A heuristic for the train pathing and timetabling problem

Transportation Research Part B: Methodological

Volumn 43, Issue 8-9, 2009, Pages 837-851

  Lee, Yusin ^a   Chen, Chuen Yih ^b  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b CHANG JUNG CHRISTIAN UNIVERSITY   (Taiwan)

Author keywords

Pathing; Scheduling; Timetabling; Train

Indexed keywords

INTEGER PROGRAMMING; ITERATIVE METHODS; LINEAR PROGRAMMING; OPTIMIZATION; RAILROAD TRANSPORTATION; RAILROADS;

MATHEMATICAL PROGRAM; MODELS AND ALGORITHMS; NEIGHBORHOOD SEARCH; PATHING; THRESHOLD ACCEPTING; TIMETABLING; TIMETABLING PROBLEM; TRAIN;

SCHEDULING;

ALGORITHM; HEURISTICS; HIGH-SPEED TRAIN; NUMERICAL MODEL; OPTIMIZATION; RAILWAY TRANSPORT; SOFTWARE;

EID: 67651165054     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2009.01.009     Document Type: Article

References (21)

1. Brannlund U., Lindberg P.O., Nou A., and Nilsson J.E. Railway timetabling using Lagrangian relaxation. Transportation Science 32 4 (1998) 358-369
2. Caprara, A., Fischetti, M., Guida, P., Monaci, M., Sacco, G., Toth, P., 2001. Solution of real-world train timetabling problems. In: Proceedings of the Hawaii International Conference on System Sciences, Maui, Hawaii, USA.
3. Caprara A., Fischetti M., and Toth P. Modeling and solving the train timetabling problem. Operations Research 50 5 (2002) 851-861
4. Caprara A., Monaci M., Toth P., and Guida P.L. A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics 154 1 (2006) 738-753
5. Carey M. Extending a train pathing model from one-way to two-way track. Transportation Research Part B 28 5 (1994) 395-400
6. Carey M. A model and strategy for train pathing with choice of lines, platforms, and routes. Transportation Research Part B 28 5 (1994) 333-353
7. Carey M., and Carville S. Scheduling and platforming trains at busy complex stations. Transportation Research Part A 37 3 (2003) 195-224
8. Carey M., and Crawford I. Scheduling trains on a network of busy complex stations. Transportation Research Part B 41 2 (2007) 159-178
9. Carey M., and Lockwood D. Model, algorithms and strategy for train pathing. Journal of the Operational Research Society 46 8 (1995) 988-1005
10. Dueck G., and Scheuer T. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 90 1 (1990) 161-175
11. Frank O. Two-way traffic on a single line of railway. Operations Research 14 5 (1966) 801
12. Higgins A., Kozan E., and Ferreira L. Optimal scheduling of trains on a single line track. Transportation Research Part B 30 2 (1996) 147-161
13. Jovanovic D., and Harker P.T. Tactical scheduling of rail operations. The SCAN I system. Transportation Science 25 1 (1991) 46-64
14. Kraay D.R., and Harker P.T. Real-time scheduling of freight railroads. Transportation Research, Part B 29 B 3 (1995) 213-229
15. Kraay D.R., Harker P.T., and Chen B. Optimal pacing of trains in freight railroads: Model formulation and solution. Operations Research 39 1 (1991) 82-99
16. Kroon L.G., and Peeters L.W.P. A variable trip time model for cyclic railway timetabling. Transportation Science 37 2 (2003) 198-212
17. Kroon L.G., Romeijn H.E., and Zwaneveld P.J. Routing trains through railway stations: complexity issues. European Journal of Operational Research 98 3 (1997) 485-498
18. Rodriguez J. A constraint programming model for real-time train scheduling at junctions. Transportation Research Part B 41 2 (2007) 231-245
19. Watson R. The effect of railway privatization on train planning: a case study of the UK. Transport Reviews 21 2 (2001) 181-193
20. Zhou X., and Zhong M. Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B 41 3 (2007) 320-341
21. Zwaneveld P.J., Kroon L.G., and Van Hoesel S.P.M. Routing trains through a railway station based on a node packing model. European Journal of Operational Research 128 1 (2001) 14-33