Routing Trains Through Railway Junctions: A New Set-Packing Approach

References

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