\(k\)-shortest routing of trains on shunting yards
From MaRDI portal
Publication:841591
DOI10.1007/s00291-008-0140-9zbMath1175.90189MaRDI QIDQ841591
Publication date: 18 September 2009
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-008-0140-9
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
Related Items
Cites Work
- Unnamed Item
- Solving the \(k\)-best traveling salesman problem
- An integrated dispatching model for rail yards operations.
- Scheduling railway traffic at a construction site
- A Survey of Optimization Models for Train Routing and Scheduling
- Arc tolerances in shortest path and network flow problems
- Iterative methods for determining the k shortest paths in a network
- Finding the k Shortest Paths
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- Finding the K Shortest Loopless Paths in a Network
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem