The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming

Networks

Volumn 62, Issue 4, 2013, Pages 315-326

  Boccia, Maurizio ^a,c   Mannino, Carlo ^b   Vasilyev, Igor ^a  

^a MATROSOV INSTITUTE FOR SYSTEM DYNAMICS AND CONTROL THEORY   (Russian Federation)

^b SINTEF ICT   (Norway)

^c UNIVERSITY OF SANNIO   (Italy)

Author keywords

Dispatching problem; Mixed Integer Linear programming

Indexed keywords

COMPLEX OPTIMIZATION; COMPUTATIONAL RESULTS; CONGESTED NETWORKS; DECISION SYSTEMS; DISPATCHING PROBLEM; HEURISTIC APPROACH; MIXED INTEGER LINEAR PROGRAMMING; RAILWAY APPLICATIONS;

COMPLEX NETWORKS; EQUIPMENT TESTING; HEURISTIC METHODS; LINEAR PROGRAMMING; RAILROAD TRANSPORTATION; RAILROADS;

PROBLEM SOLVING;

EID: 84887082868     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21528     Document Type: Article

References (16)

1. R. Acuna-Agost, P. Michelon, D. Feillet, and, S. Gueye, A MIP-based local search method for the railway rescheduling problem, Networks 57 (2011), 69-86.
2. A. Caprara, L. Galli, and, P. Toth, Solution of the train platforming problem, Transp Sci 45 (2011), 246-257.
3. F. Corman, "Rail-time railway traffic management: Dispatching in complex, large and busy railway networks," Ph.D. Thesis, TRAIL Thesis Seriess T2010/14, the Netherlands TRAIL Research School, Netherlands, 2010.
4. F. Corman, A. D'Ariano, D. Pacciarelli, and, M. Pranzo, A tabu search algorithm for rerouting trains during rail operations, Transp Res Part B 44 (2010), 175-192.
5. A. D'Ariano, D. Pacciarelli, and, M. Pranzo, A branch and bound algorithm for scheduling trains in a railway network, Eur J Oper Res 183 (2007), 643-657.
6. F. Fischer, B. Grimm, and, T. Klug, "Movement planner algorithm design for dispatching on multi-track territories," 2012 RAS Problem Solving Competition Report. Available at: http://www.informs.org/Community/RAS/ Problem-Solving-Competition/2012-RAS-Problem-Solving-Competition, 2012.
7. S. Harrod, Modeling network transition constraints with hypergraphs, Transp Sci 45 (2011), 81-97.
8. D. Kjenstad, C. Mannino, P. Schittekat, and, M. Smedsrud, "Integrated surface and departure management at airports by optimization," IEEE Xplore Digital Library, 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), Hammamet, 2013, pp. 1-5.
9. L. Lamorgese, and, C. Mannino, The track formulation for the train dispatching problem, Elec Note Discrete Math 41 (2013), 559-566.
10. C. Mannino, and, A. Mascis, Real-time traffic control in metro stations, Oper Res 57 (2009), 1026-1039.
11. C. Meloni, D. Pacciarelli, and, M. Pranzo, A rollout metaheuristic for job shop scheduling problems, Ann Oper Res 131 (2004), 215-235.
12. M. Montigel, Semi-automatic train traffic control in the new Swiss Lötschberg base tunnel, IRSA-Apect (2006). Available at: www.systransis.ch/fileadmin/2006-Paper-MM.pdf.
13. 2012 RAS Problem Solving Competition. Available at: http://www.informs. org/Community/RAS/Problem-Solving-Competition/2012-RAS-Problem-Solving- Competition.
14. G. Sahin, R.K. Ahuja, and, C.B. Cunha, Integer programming based approaches for the train dispatching problem, Tech Rep Sabanci Univerisity, Turkey, 2010.
15. A. Uygur, Movement planner algorithm design for dispatching on multi-track territories, Presentation at the Annual INFORMS Conference, Phoenix (2012).
16. C. Yan, and, L. Yangy, "Mixed-integer programming based approaches for the movement planner problem: Model, heuristics and decomposition," 2012 RAS Problem Solving Competition Report. Available at: http://www.informs. org/Community/RAS/Problem-Solving-Competition/2012-RAS-Problem-Solving- Competition, 2012.