Routing Trains Through Railway Stations: Model Formulation and Algorithms
From MaRDI portal
Publication:4364995
DOI10.1287/trsc.30.3.181zbMath0884.90079OpenAlexW2159363368MaRDI QIDQ4364995
Marc Salomon, H. Edwin Romeijn, Leo G. Kroon, Stan P. M. van Hoesel, Stéphane Dauzère-Pérès, Harrie W. Ambergen, Peter J. Zwaneveld
Publication date: 14 December 1997
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/14339
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (31)
\(k\)-shortest routing of trains on shunting yards ⋮ Stability evaluation of a railway timetable at station level ⋮ A disjunctive graph model and framework for constructing new train schedules ⋮ An iterative approach for reducing the impact of infrastructure maintenance on the performance of railway systems ⋮ Heuristic algorithms for visiting the customers in a rolling schedule environment ⋮ Discrete optimization in public rail transport ⋮ On the online track assignment problem ⋮ GRASP for set packing problems. ⋮ Railway track allocation: Models and methods ⋮ Optimizing the simplon railway corridor ⋮ Multi-attribute assignment of trains to departures in rolling stock management. Multi-attribute assignment of trains to departures in rolling stock management. A contribution to the EURO/ROADEF 2014 challenge ⋮ Track assignment ⋮ The single train shortest route problem in a railyard ⋮ Review of real-time vehicle schedule recovery methods in transportation services ⋮ On the mixed set covering, packing and partitioning polytope ⋮ A study on network design problems for multi-modal networks by probit-based stochastic user equilibrium ⋮ Improving the robustness in railway station areas ⋮ Algebraic Theory on Shortest Paths for All Flows ⋮ A sequencing approach for creating new train timetables ⋮ Hybridization of GRASP metaheuristic with data mining techniques ⋮ Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling ⋮ Strategic timetable scheduling for last trains in urban railway transit networks ⋮ Periodic railway timetabling with event flexibility ⋮ Sensitivity analysis of a railway station track layout with respect to a given timetable ⋮ Design of a railway scheduling model for dense services ⋮ Routing trains through railway stations: Complexity issues ⋮ Train Scheduling in a Large and Highly Utilised Railway Network ⋮ Integrated rolling stock deadhead routing and timetabling in urban rail transit lines ⋮ Multiple train repositioning operations in a railyard network ⋮ Routing trains through a railway station based on a node packing model ⋮ A hybrid evolutionary approach for set packing problem
This page was built for publication: Routing Trains Through Railway Stations: Model Formulation and Algorithms
