An exact decomposition approach for the real-time train dispatching problem

Operations Research

Volumn 63, Issue 1, 2015, Pages 48-64

  Lamorgese, Leonardo ^a   Mannino, Carlo ^a  

^a SINTEF ICT   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION SUPPORT SYSTEMS; OPTIMIZATION;

BENDERS' DECOMPOSITIONS; DOUBLE TRACK LINE; EXACT DECOMPOSITIONS; MATHEMATICAL OPTIMIZATIONS; MIXED INTEGER LINEAR PROGRAM; RAILWAY NETWORK; SOLUTION ALGORITHMS; TRAIN DISPATCHING;

INTEGER PROGRAMMING;

EID: 84925357763     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2014.1327     Document Type: Article

References (31)

1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows (Prentice-Hall, Upper Saddle River, New Jersey).
2. Alvras D, Padberg MW (2001) Linear Optimization and Extensions: Problems and Solutions (Springer-Verlag, Berlin, Heidelberg).
3. Balas E (1969) Machine sequencing via disjunctive graphs: An enumeration algorithm. Oper. Res. 17(6):941-957.
4. Balas E (1979) Disjunctive programming. Ann. Discrete Math. 5:3-51.
5. Bonomo F, Duran G, Marenco J (2009) Exploring the complexity boundary between coloring and list-coloring. Ann. Oper. Res. 169(1):3-16.
6. Borndörfer R, Schlechte T (2007) Models for railway track allocation. ATMOS 2007 - 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems.
7. Brännlund U, Lindberg PO, Nou A, Nilsson J-E (1998) Railway timetabling using Lagrangian relaxation. Transportation Sci. 32(4):358-369.
8. Cacchiani V, Huisman D, Kidd M, Kroon L, Toth P, Veelenturf L, Wagenaar J (2014) An overview of recovery models and algorithms for real-time railway rescheduling. Transportation Res. Part B 63:15-37.
9. Caprara A, Fischetti M, Toth P (2002) Modeling and solving the train timetabling problem. Oper. Res. 50(5):851-861.
10. Caprara A, Galli L, Toth P (2011) Solution of the train platforming problem. Transportation Sci. 45(2):246-257.
11. Carlisle MC, Lloyd EL (1995) On the k-coloring of intervals. Discrete Appl. Math. 59:225-235.
12. Codato G, Fischetti M (2006) Combinatorial Benders' cuts for mixedinteger linear programming. Oper. Res. 54(4):756-766.
13. Corman F, D'Ariano A, Pacciarelli D, Pranzo M (2010) A tabu search algorithm for rerouting trains during rail operations. Transportation Res. Part B 44:175-192.
14. Dyer M, Wolsey L (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26(2-3):255-270.
15. Gupta UI, Lee DT, Leung JYT (1982) Efficient algorithms for interval graphs and circular-arc graphs. Networks 12:459-467.
16. Harrod S (2011) Modeling network transition constraints with hypergraphs. Transportation Sci. 45(1):81-97.
17. Indian Railway (2011) Year Book 2010-11. Ministry of Railways, Government of India.
18. Kole AWJ, Lenstra JK, Papadimitriou CH, Spieksma FCR (2007) Interval scheduling: A survey. Naval Res. Logist. 54:530-543.
19. Lüthi M (2009) Improving the efficiency of heavily used railway networks through integrated real-time rescheduling. Doctoral dissertation, ETH Zurich, Zurich.
20. Macambira EM, de Souza CC (2000) The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 123(2):346-371.
21. Mannino C, Mascis A (2009) Real-time traffic control in metro stations. Oper. Res. 57(4):1026-1039.
22. Mascis A (1997) Optimization and simulation models applied to railway traffic. Doctoral dissertation, University of Rome "La Sapienza," Rome.
23. Mascis A, Pacciarelli D (2002) Job shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3):498-517.
24. Nemhauser GL, Wolsey LA (1999) Integer and Combinatorial Optimization (Wiley-Interscience, New York).
25. Pellegrini P, Marlière G, Rodriguez J (2014) Optimal train routing and scheduling for managing traffic perturbations in complex junctions. Transportation Res. Part B 59:58-80.
26. Rogstad AE (2014), Personal communication with chief dispatcher Trondheim station, Norway. Retrieved October 7.
27. Şahin G, Ahuja RK, Cunha CB (2010) Integer programming based approaches for the train dispatching problem. Technical report, Sabanci University, Istanbul.
28. Schrijver A (2003) Combinatorial Optimization (Springer, Berlin, Heidelberg).
29. Törnquist J, Persson JA (2007) N-tracked railway traffic re-scheduling during disturbances. Transportation Res. Part B 41:342-362.
30. Union Internationale des Chemins de Fer (International Union of Railways) (2011) Synopsis.
31. Zwaneveld PJ, Kroon LGS, Romeijn HE, Salomon M, Dauzere-Peres S, Van Hoesel SPM, Ambergen HW (2014) Routing trains through railway stations: Model formulation and algorithms. Transportation Sci. 30(3):181-194.