Scheduling trains on parallel lines with crossover points

Journal of Intelligent Transportation Systems: Technology, Planning, and Operations

Volumn 13, Issue 4, 2009, Pages 171-187

  Burdett, R L ^a   Kozan, E ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Decomposition; Job shop; Metaheuristics; Train scheduling

Indexed keywords

DECOMPOSITION; JOB SHOP SCHEDULING; RAILROAD TRANSPORTATION;

JOB SHOP; META HEURISTICS; NUMERICAL INVESTIGATIONS; RAILWAY INFRASTRUCTURE; ROUTING DECISIONS; SCHEDULING PROCESS; TECHNICAL CONSTRAINTS; TRAIN SCHEDULING;

SCHEDULING;

DECISION ANALYSIS; NUMERICAL METHOD; RAILWAY TRANSPORT; ROUTING; TRANSPORTATION INFRASTRUCTURE;

EID: 71049126080     PISSN: 15472450     EISSN: 15472442     Source Type: Journal    
DOI: 10.1080/15472450903297608     Document Type: Article

References (34)

1. Adenso-Diaz, B., Gonzalez, M. O., and Gonzalez-Torre, P. (1999). On line timetable re-scheduling in train services. Transportation Research Part B, 33, 387-398.
2. Billionnet, A. (2003). Using integer programming to solve the train platforming problem. Transportation Science, 37(2), 213-222.
3. Brannlund, U., Lindberg, P.O., Nou, A., and Nillson, J.-E. (1998). Railway timetabling using lagrangian relaxation. Transportation Science, 32, 358-369.
4. Burdett, R., and Kozan, E. (July, 2008). A sequencing approach for train timetabling. OR Spectrum. Available at: http://dx.doi. org/10.1007/s00291-008- 0143-6 (accessed).
5. Burdett, R., and Kozan, E. (2009a). Development of a disjunctive graph model and constructive algorithms for train scheduling. European Journal of Operational Research, 200, 85-98.
6. Burdett, R., and Kozan, E. (2009b). Techniques for restricting multiple overtaking conflicts and performing compound moves when train scheduling. Computers and Mathematical Modelling, 50, 314-328.
7. Burdett, R., and Kozan, E. (2009c). Techniques for inserting additional trains to existing timetables. Transportation Research B., 43, 821-836.
8. Cai, X., and Goh, C. J. (1994). A fast heuristic for the train scheduling problem. Computers and Operations Research, 21(5), 499-510.
9. Cai, X., Goh, C. J., and Mees, A. I. (1998). Greedy heuristics for rapid scheduling of trains on a single track. IIE Transactions, 30, 481-493.
10. Carey, M. (1994a).Amodel and strategy for train pathingwith choice of lines, platforms, and routes. Transportation Research Part B, 28(5), 333-353.
11. Carey, M. (1994b). Extending a train pathing model from one-way to two-way track. Transportation Research Part B, 28(5), 395-400.
12. Carey, M., and Carville, S. (2003). Scheduling and platforming trains at busy complex stations. Transportation Research Part A, 37, 195-224.
13. Carey, M., and Crawford, I. (2007). Scheduling trains on a network of busy complex stations. Transportation Research Part B, 41, 159-178.
14. Carey, M., and Lockwood, D. (1992). A model, algorithms and strategy for train pathing. Journal of the Operational Research Society, 46, 988-1005.
15. Chiang, T. W., Hau, H. Y., Chiang, H. M., Ko, S. Y., and Hsieh, C. H. (1998). Knowledge based system for railway scheduling. Data and Knowledge Engineering, 27, 289-312.
16. Cordeau, J. F., Toth, P., and Vigo, D. (1998). A survey of optimisation models for train routing and scheduling. Transportation Science, 32, 380-404.
17. D'Ariano, A., Pacciarelli, D., and Pranzo, M. (2007). A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research, 183, 643-657.
18. D'Ariano, A., Pacciarelli, D., and Pranzo, M. (2008). Assessment of flexible timetables in real-time traffic management of a railway bottleneck. Transportation Research Part C, 16, 232-245.
19. Dessouky, M., Lu, Q., Zhao, J., and Leachman, R. (2006). An exact solution procedure for determining the optimal dispatching times for complex rail networks. IIE Transactions, 38(2), 141-152.
20. Dorfman,M. J., andMedanic, J. (2004). Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Research Part B, 38, 81-98.
21. Goverde, R. (2007). Railway timetable stability analysis using maxplus system theory. Transportation Research Part B, 41, 179-201.
22. Higgins, A., Kozan, E., and Ferreira, L. (1996). Optimal scheduling of trains on a single line track. Transportation Research Part B, 30(2), 147-161. (Pubitemid 27035196)
23. Higgins, A., Kozan, E., and Ferreira, L. (1997). Heuristic techniques for single line train scheduling. Journal of Heuristics, 3, 43-62.
24. Kroon, L. G., and Peeters,W. P. (2003). A variable trip time model for cyclic railway timetabling. Transportation Science, 37(2), 198-212.
25. Kroon, L. G., Romeijn, H. E., and Zwaneveld, P. J. (1997). Routing trains through railway stations: Complexity issues. European Journal of Operational Research, 98, 485-498.
26. Lindner, T. (2000). Train Schedule Optimisation in Public Rail Transport. Ph.D. thesis, Technical University Braunschweig, Braunschweig, Germany.
27. Mazzarello, M., and Ottaviani, E. (2007). A traffic management system for real-time traffic optimisation in railways. Transportation Research Part B, 41, 246-274.
28. Odijk, M. A. (1996). A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research, 30, 455-464.
29. Rodriguez, J. (2007). A constraint programming model for real time train scheduling at junctions. Transportation Research Part B, 41, 231-245.
30. Sahin, I. (1999). Railway traffic control and train scheduling based on inter-train conflict management. Transportation Research Part B, 33, 511-534.
31. Stella, F., Viganograve, V., Bogni, D., and Benzoni, M. (2006). An integrated forecasting and regularization framework for light rail transit systems. Journal of Intelligent Transportation Systems, 10(2), 59-73.
32. Tornquist, J. and Persson, J. A. (2007). N-tracked railway traffic rescheduling during disturbances. Transportation Research Part B, 41, 342-362.
33. Zwaneveld, P. J., Kroon, L. G., Romeijn, H. E., Salomon, M., Dauzere Peres, S., van Hoesel, S. P.M., andAmbergen,H.W. (1996).Routing trains through railway stations: Model formulation and algorithms. Transportation Science, 30, 181-194.
34. Zwaneveld, P. J., Kroon, L. G., Van Hoesel, S. P. M. (2001). Routing trains through a railway station based on a node packing model. European Journal of Operational Research, 128, 14-33.