\(k\)-shortest routing of trains on shunting yards

DOI10.1007/s00291-008-0140-9zbMath1175.90189OpenAlexW2067295650MaRDI QIDQ841591

Wout van Wezel, Jan Riezebos

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

zbMATH Keywords

Hamiltonian path\(k\)-shortest pathrailway planningshunting scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

The single train shortest route problem in a railyard ⋮ Finding the \(K\) shortest paths in a schedule-based transit network

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

This page was built for publication: \(k\)-shortest routing of trains on shunting yards