Routing trains through railway junctions: A new set-packing approach

Transportation Science

Volumn 45, Issue 2, 2011, Pages 228-245

  Lusby, Richard ^a   Larsen, Jesper ^a   Ryan, David ^b   Ehrgott, Matthias ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Column generation; Set packing model; Train routing

Indexed keywords

INTEGER PROGRAMMING; LINEAR PROGRAMMING; RAILROAD STATIONS; RAILROADS; TRANSPORTATION; TREES (MATHEMATICS);

BRANCH-AND-PRICE ALGORITHMS; COLUMN GENERATION; COMPUTATIONAL EXPERIMENT; INTERCONNECTED NETWORK; RAILWAY OPERATIONS; SET PACKING; TRAIN ROUTING; VARIABLE GENERATIONS;

RAILROAD TRANSPORTATION;

EID: 79957486819     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0362     Document Type: Article

References (23)

1. Berge, C. 1972. Balanced matrices. Math. Programming 2 (1) 19-31.
2. Billionnet, A. 2003. Using integer programming to solve the trainplatforming problem. Transportation Sci. 37 (2) 213-222.
3. Caimi, G., D. Burkolter, T. Herrmann. 2005. Finding delay-tolerant train routings through stations. H. Fleuren, D. Hertog, P. Kort, eds. Oper. Res. Proc. 2004: Selected Papers of the Annual Internat. Conf. German Oper. Res. Soc. (GOR) Jointly Organized with The Netherlands Soc, Springer Verlag, Berlin/Heidelberg, 136-143.
4. Caprara, A., L. Galli, P. Toth. 2007. 04. Solution of the train platforming problem. C. Liebchen, R. K. Ahuja, J. A. Mesa, eds. ATMOS 2007-7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Internationales Begegnungs-und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
5. Carey M., S. Carville. 2003. Scheduling and platforming trains at busy complex stations. Transportation Res. Part A 37 (3) 195-224. (Pubitemid 36128978)
6. Cornelsen, S., G. di Stefano. 2007. Track assignment. J. Discrete Algorithms 5 (2) 250-261. (Pubitemid 46590833)
7. De Luca Cardillo, D., N. Mione. 1998. k l-list τ colouring of graphs. Eur. J. Oper. Res. 106 (1) 160-164.
8. Delorme, X. 2003. Modélisation et résolution de problèmes liés à l'exploitation d'infrastructures ferroviaires. Ph. D. thesis, Université de Valenciennes et du Hainaut Cambrésis, Valenciennes, France.
9. Delorme, X., X. Gandibleux, J. Rodriguez. 2004. GRASP for set packing problems. Eur. J. Oper. Res. 153 (3) 564-580.
10. Delorme, X., J. Rodriguez, X. Gandibleux. 2001. Heuristics for railway infrastructure saturation. Electronic Notes Theoret. Comput. Sci. 50 (1) 39-53. (Pubitemid 40715834)
11. Gandibleux, X., X. Delorme, V. T'Kindt. 2004. An ant colony optimisation algorithm for the set packing problem. M. Dorigo, M. Birattari, C. Blum, L. Gambardella, F. Mondada, T. Stutzle, eds. Proc. ANTS 2004-Fourth Internat. Workshop Ant Colony Optimization and Swarm Intelligence, Lecture Notes in Computer Sci, Vol. 3172. Springer, Berlin/Heidelberg, 49-60. (Pubitemid 39210701)
12. Gandibleux, X., J. Jorge, S. Angibaud, X. Delorme, J. Rodriguez. 2005. An ant colony optimization inspired algorithm for the set packing problem with application to railway infrastructure. Proc. Sixth Metaheuristics Internat. Conf. (MIC2005), Vienna, 390-396.
13. Kroon, L. G., H. E. Romeijn, P. J. Zwaneveld. 1997. Routing trains through railway stations: Complexity issues. Eur. J. Oper. Res. 98 (3) 485-498. (Pubitemid 127392237)
14. Lu, Q., M. Dessouky, R. C. Leachman. 2004. Modeling train movements through complex rail networks. ACM Trans. Modeling Comput. Simulation 14 (1) 48-75.
15. Pachl, J. 2004. Systemtechnikdes Schienenverkehrs. B. G. Teubner Verlag/GWV Fachverlage GmbH, Wiesbaden, Germany.
16. Padberg, M. W. 1973. On the facial structure of set packing polyhedra. Math. Programming 5 (1) 199-215.
17. Rodriguez, J. 2007. A constraint programming model for real-time trains scheduling at junctions. Transportation Res. Part B 41 (2) 231-245. (Pubitemid 44391251)
18. Rodriguez, J., L. Kermad. 1998. Constraint programming for realtime train circulation management problems in railway nodes. Proc. 6th Internat. Conf. Computer Aided Design, Manufacture and Operation in the Railway and Other Mass Transit Systems, WIT Press, Lisbon, Portugal, 597-606.
19. Rodriguez, J., X. Delorme, X. Gandibleux. 2002. Railway infrastructure saturation using constraint programming approach. Computers in Railways VIII. WIT Press, Lemmos, Greece, 807-816.
20. Ryan, D. M., B. A. Foster. 1981. An integer programming approach to scheduling. A. Wren, ed. Computer Scheduling of Public Transport. North-Holland Publishing Company, Amsterdam, 269-280.
21. Vaidyanathan, B., R. K. Ahuja, J. B. Orlin. 2008. The locomotive routing problem. Transportation Sci. 42 (4) 492-507.
22. Zwaneveld, P. J., L. G. Kroon, S. P. M. van Hoesel. 2001. Routing trains through a railway station based on a node packing model. Eur. J. Oper. Res. 128 (1) 14-33. (Pubitemid 32022960)
23. Zwaneveld, P. J., L. G. Kroon, H. E. Romeijn, M. Salomon, S. Dauzere-Peres, S. P. M. van Hoesel, H. W. Ambergen. 1996. Routing trains through railway stations: Model formulation and algorithms. Transportation Sci. 30 (3) 181-194. (Pubitemid 126605103)