RECIFE-MILP: An Effective MILP-Based Heuristic for the Real-Time Railway Traffic Management Problem

IEEE Transactions on Intelligent Transportation Systems

Volumn 16, Issue 5, 2015, Pages 2609-2619

  Pellegrini, Paola ^a,b   Marlière, Grégory ^a,b   Pesenti, Raffaele ^c   Rodriguez, Joaquin ^a,b  

^a UNIV LILLE   (France)

^b French Institute of Science and Technology for Transport Development and Networks   (France)

^c CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

algorithm configuration; mixed integer linear programming; performance boosting; Real time railway traffic management problem

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; RAILROAD TRANSPORTATION; RAILROADS; TRANSPORTATION;

ALGORITHM CONFIGURATIONS; COMPUTATION TIME; EXPERIMENTAL ANALYSIS; MIXED INTEGER LINEAR PROGRAMMING MODEL; OPTIMAL SOLUTIONS; RAILWAY TRAFFIC MANAGEMENT; REAL-TIME APPLICATION; TRAFFIC MANAGEMENT STRATEGIES;

INTEGER PROGRAMMING;

EID: 84959479843     PISSN: 15249050     EISSN: None     Source Type: Journal    
DOI: 10.1109/TITS.2015.2414294     Document Type: Article

References (23)

1. R. Acuna-Agost, P. Michelon, D. Feillet, and S. Gueye, "A MIP-based local search method for the railway rescheduling problem," Networks, vol. 57, no. 1, pp. 69-86, Jan. 2011.
2. V. Cacchiani et al., "An overview of recovery models and algorithms for real-time railway rescheduling," Transp. Res. B, Methodol., vol. 63, pp. 15-37, May 2014.
3. G. Caimi, F. Chudak, M. Fuchsberger, M. Laumanns, and R. Zenklusen, "A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling," Transp. Sci., vol. 45, no. 2, pp. 212-227, May 2011.
4. G. Caimi, M. Fuchsberger, M. Laumanns, and M. Luthi, "A model predictive control approach for discrete-time rescheduling in complex central railway station approach," Comput. Oper. Res., vol. 39, no. 11, pp. 2578-2593, Nov. 2012.
5. F. Corman, A. D'Ariano, D. Pacciarelli, and M. Pranzo, "A tabu search algorithm for rerouting trains during rail operations," Transp. Res. B, Methodol., vol. 44, no. 1, pp. 175-192, Jan. 2010.
6. F. Corman, A. D'Ariano, D. Pacciarelli, and M. Pranzo, "Optimal inter-area coordination of train rescheduling decisions," Transp. Res. E, Logist. Transp. Rev., vol. 48, no. 1, pp. 71-88, Jan. 2012.
7. F. Corman, A. D'Ariano, D. Pacciarelli, and M. Pranzo, "Dispatching and coordination in multi-area railway traffic management," Comput. Oper. Res., vol. 44, pp. 146-160, Apr. 2014.
8. A. D'Ariano, F. Corman, D. Pacciarelli, and M. Pranzo, "Reordering and local rerouting strategies to manage train traffic in real-time," Transp. Sci., vol. 42, no. 4, pp. 405-419, Nov. 2008.
9. F. Hutter, "Automated configuration of algorithms for solving hard computational problems," Ph.D. dissertation, Dept. Comput. Sci., Univ. British Columbia, Vancouver, BC, Canada, 2009.
10. F. Hutter, L. Xu, H. H. Hoos, and K. Leyton-Brown, "Algorithm runtime prediction: Methods & evaluation," Artif. Intell., vol. 206, pp. 79-111, Jan. 2014.
11. User's Manual for CPLEX, IBM Corporation, New York, NY, USA, 2012. [Online]. Available: http://publib.boulder.ibm.com/infocenter/cosinfoc/v12r2
12. D. R. Jones, M. Schonlau, and W. J. Welch, "Efficient global optimisation of expensive black box functions," J. Global Optim., vol. 13, no. 4, pp. 455-492, Dec. 1998.
13. R. M. Lusby, J. Larsen, M. Ehrgott, and D. M. Ryan, "A set packing inspired method for real-time junction train routing," Comput. Oper. Res., vol. 40, no. 3, pp. 713-724, Mar. 2012.
14. O. Maron and A. W. Moore, "The racing algorithm: Model selection for lazy learners," Artif. Intell. Rev., vol. 11, no. 1-5, pp. 193-225, Feb. 1997.
15. P. Pellegrini, G. Marliere, and J. Rodriguez, "Boosting the performance of a MILP formulation for railway traffic management in complex junctions," in Proc. MT-ITS, Dresden, Germany, 2013, pp. 419-428.
16. P. Pellegrini, G. Marliere, and J. Rodriguez, "Optimal train routing and scheduling for managing traffic perturbations in complex junctions," Transp. Res. B, Methodol., vol. 59, pp. 58-80, Jan. 2014.
17. P. Pellegrini, G. Marliere, and J. Rodriguez, "Optimal train routing and scheduling in case of traffic perturbations: Improving solution time through parameter tuning," in Proc. TRA, 2014, pp. 1-9.
18. J. Rodriguez, "A constraint programming model for real-time train scheduling at junctions," Transp. Res. B, Methodol., vol. 41, no. 2, pp. 231-245, Feb. 2007.
19. J. Rodriguez et al., "RECIFE: Models and tools for analyzing rail capacity," (in French) Recherche Transp. Sécurité, vol. 95, pp. 19-36, 2007.
20. G. Theeg, U. Maschek, and O. Nasedkin, "Interlocking principles," in Railway Signalling & Interlocking. International Compendium, G. Theeg and S. Vlasenko, Eds. Hamburg, Germany: Eurail Press, 2009, pp. 61-112.
21. J. T. Krasemann, "Design of an effective algorithm for fast response to re-scheduling of railway traffic during disturbances," Transp. Res. C, Emerging Technol., vol. 20, no. 1, pp. 62-78, Feb. 2012.
22. M. J. C. M. Vromans, R. Dekker, and L. G. Kroon, "Reliability and heterogeneity of railway services," Eur. J. Oper. Res., vol. 172, no. 2, pp. 647-665, Jul. 2006.
23. J. Wales and M. Marinov, "Analysis of delays and delay mitigation on a metropolitan rail network using event based simulation," Simul. Model. Pract. Theory, vol. 52, pp. 52-77, Mar. 2015.