A MIP-based local search method for the railway rescheduling problem

Networks

Volumn 57, Issue 1, 2011, Pages 69-86

  Acuna Agost, Rodrigo ^a   Michelon, Philippe ^a   Feillet, Dominique ^b   Gueye, Serigne ^c  

^a UNIVERSITY OF AVIGNON   (France)

^b ECOLE DES MINES DE SAINT ETIENNE   (France)

^c UNIVERSITÉ DU HAVRE   (France)

Author keywords

disruption management; local branching; rescheduling; train timetabling

Indexed keywords

DENSE NETWORK; DISRUPTION MANAGEMENT; INTEGER VARIABLES; LOCAL BRANCHING; LOCAL IMPACTS; LOCAL SEARCH METHOD; MIXED-INTEGER PROGRAMMING; RAIL TRANSPORTATION; RESCHEDULING; RESCHEDULING PROBLEM; SCHEDULE OF TRAIN; SEARCH SPACES; TIMETABLING; TRAIN SCHEDULE;

LOCOMOTIVES; RAILROAD CARS; RAILROAD TRANSPORTATION; RAILROADS; RAILS; SCHEDULING;

INTEGER PROGRAMMING;

EID: 78650130562     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20384     Document Type: Conference Paper

References (21)

1. B. Adenso-Diaz, M. Oliva-Gonzalez, and, P. Gonzalez-Torre, On-line timetable re-scheduling in regional train services, Transport Res B Methodol 33 (1999), 387-398.
2. A. Assad, Models for rail transportation, Transport Res-A 14(A) (1980), 205-220.
3. M. Bussieck, T. Winter, and, U. Zimmermann, Discrete optimization in public rail transport, Math Program 79 (1997), 415-444.
4. C. Chiu, C. Chou, J. Lee, H. Leung, and, Y. Leung, A constraint-based interactive train rescheduling tool, Constraints 7 (2002), 167-198.
5. J. F. Cordeau, P. Toth, and, D. Vigo, A survey of optimization models for train routing and scheduling, Transport Sci 32 (1998), 380-404.
6. EFE: Efe. Empresa de los Ferrocarriles del Estado. National railway of Chile, Chile., 2009.
7. FEPASA: Fepasa, Ferrocarril del Pacífico Sociedad Anónima, the largest freight railroad company in Chile, Chile., 2009.
8. M. Fischetti, and, A. Lodi, Local branching, Math Program 98 (2003).
9. Flickr.com: This image was originally posted to flickr by dustpuppy, December 03, 2006.
10. K. Fukumori, and Fundamental scheme for train scheduling: Application of rangeconstriction search, Technical Report A. I. Memo No. 596 (1980), Massachusetts Institute of Technology Artificial Intelligence Laboratory.
11. K. Fukumori, H. Sano, Fundamental algorithm for train scheduling based on artificial intelligence, Syst Comp Jpn 18 (1987), 5264.
12. R. Graham, E. Lawler, J. Lenstra, and, A. R. Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann Discrete Math 5 (1979), 287-326.
13. T. M. Herrmann, Stability of timetables and train routings through station regions, Ph.D. thesis, IFOR, Department of Mathematics, Swiss Federal Institute of Technology, Zurich, 2006.
14. D. K. Huisman, Operations research in passenger railway transportation, Research Paper, RSM Erasmus University ERS-2005-023-LIS Erasmus Research Institute of Management (ERIM), 2005.
15. ILOG: Ilog web page, 2009.
16. MAGES: Mages web page, http://awal.univ-lehavre.fr/∼lmah/mages/, 2006.
17. J. Pachl, Railway operation and control, VTD Rail Publishing 3604 220th Pl SW Mountlake Terrace WA Q8043, 425-771-4289, 2002.
18. J. Rodriguez, A constraint programming model for real-time train scheduling at junctions, Transport Res B Methodol 41 (2007), 231-245.
19. J. Törnquist, and Computer-based decision support for railway traffic scheduling and dispatching: A review of models and algorithms, 5th workshop on algorithmic methods and models for optimization of railways, L. G. Kroon, R. H. Möhring, (Editors), Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.
20. J. Törnquist, J. A. Persson, N-tracked railway traffic re-scheduling during disturbances, Transport Res B 41 (2007), 342-362.
21. G. E. Vieira, J. W. Herrmann, and, E. Lin, Rescheduling manufacturing systems: A framework of strategies, policies, and methods, J Scheduling 6 (2003), 39-62.