A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway

Omega

Volumn 37, Issue 3, 2009, Pages 637-645

  Hong, Sung Pil ^a   Kim, Kyung Min ^b   Lee, Kyungsik ^c   Hwan Park, Bum ^d  

^a Seoul National University   (South Korea)

^b Korea Railroad Research Institute   (South Korea)

^c Hankuk University of Foreign Studies   (South Korea)

^d Korea National Railroad College   (South Korea)

Author keywords

Maintenance; Minimum cost flow; Rail transport; Train set routing

Indexed keywords

COSTS; MAINTENANCE; RAILROAD TRANSPORTATION; RAILROADS;

'CURRENT; COST ROUTES; HIGH-SPEED RAILWAYS; MINIMUM COST; MINIMUM COST FLOWS; RAIL TRANSPORT; ROUTINGS; TRAIN SETS; TRAIN TIMETABLES; TRAIN-SET ROUTING;

ROUTING ALGORITHMS;

EID: 50349084886     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2008.03.003     Document Type: Article

References (19)

1. Khedher N.B., Kintanar J., Queille C., and Stripling W. Schedule optimization at sncf: from conception to day of departure. Interfaces 28 (1998) 6-23
2. Anderegg L, Eidenbenz S, Gantenbein M, Stamm C, Taylor DS, Weber B, et al. Train routing algorithms: concepts, design choices, and practical considerations. In: Proceedings of the fifth workshop on algorithm engineering and experiments (ALENEX03); 2003.
3. Bunte S., and Kliewer N. An overview on vehicle scheduling models (2006), University of Paderborn, DSOR Working Papers
4. Ziarati K., Soumis F., Desrosiers J., Gelinas S., and Saintonge A. Locomotive assignment with heterogenous consist at CN North America. European Journal of Operational Research 97 (1997) 281-292
5. Forbes M.A., Holt J.N., and Watts A.M. Exact solution of locomotive scheduling problems. Journal of the Operational Research Society 42 10 (1997)
6. Lingaya N., Cordeau J.F., Desaulniers G., Desrosiers J., and Soumis F. Operational car assignment at VIA rail Canada. Transportation Research B 36 (2002) 755-778
7. Cordeau J.-F., Desaulniers G., Lingaya N., Soumis F., and Desrosiers J. Simultaneous locomotive and car assignment at VIA rail Canada. Transportation Research Part B-Methodological 35 8 (2001) 767-787
8. Clarke L., Johnson E.L., and Nemhauser G.L. The aircraft rotation problem. Annals of Operations Research 69 1 (1997) 33-46
9. J.-W. Chung, S.-M. Oh, and I.-C. Choi, A hybrid genetic algorithm for train sequencing in the korean railway, OMEGA-International Journal of Management Science, in press, doi:10.1016/j.omega.2007.12.001.
10. Gopalan R., and Talluri K.T. The aircraft maintenance routing problem. Operations Research 46 2 (1998)
11. Zhao P, Tomii N, Fukumura PN, Sakaguchi T. An algorithm for train-set scheduling based on probabilistic local search. In: Computers in Railways VIII; 2002. p. 817-26.
12. Kabbani NM, Patty BW. Aircraft routing at american airlines. In: Proceedings of the 32nd annual symposium of AGIFORS, Budapest, Hungary; 1992.
13. Schrijver A. Minimum circulation of railway stock. CWI-Quarterly 6 3 (1993) 205-217
14. Erlebach T, Gantenbein M, Hürlimann D, Neyer G, Pagourtzis A, Penna P, et al. On the complexity of train assignment problems. In: Proceedings of ISAAC01, lecture notes in computer science, vol. 2223, 2001. p. 390-402.
15. Kuo C.-C., and Nicholls G.M. A mathematical modeling approach to improve locomotive utilization at a freight railroad. OMEGA-International Journal of Management Science 35 (2007) 472-485
16. Dantzig G., and Fulkerson D. Minimizing the number of tankers to meet a fixed schedule. Naval Research Logistics Quarterly 1 (1954) 217-222
17. Brucker P., Hurink J., and Rolfes T. Routing of railway carriages. Journal of Global Optimization 27 (2003) 313-332
18. Bertossi A.A., Carraresi P., and Gallo G. On some matching problem arising in vehicle scheduling models. Networks 17 (1987) 313-332
19. Maróti G., and Kroon L. Maintenance routing for train units: the interchange model. Computers & Operations Research 34 4 (2007) 1121-1140