k-shortest routing of trains on shunting yards

DOI10.1007/S00291-008-0140-9MaRDI QIDQ841591zbMATH OpenOpenAlexFDO

Authors Jan Riezebos, Wout van Wezel

Publication date 18 September 2009

Published in OR Spectrum (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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)

Recommendations

• The single train shortest route problem in a railyard
• Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Exact train pathing
• A Model, Algorithms and Strategy for Train Pathing

Cites work

• scientific article; zbMATH DE number 62768 (Why is no real title available?)
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• A survey of optimization models for train routing and scheduling
• An integrated dispatching model for rail yards operations.
• Arc tolerances in shortest path and network flow problems
• Finding the K Shortest Loopless Paths in a Network
• Finding the k Shortest Paths
• Iterative methods for determining the k shortest paths in a network
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• Scheduling railway traffic at a construction site
• Solving the k-best traveling salesman problem

Cited in

(4)

• Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem
• Fuzzy ant colony algorithm for solving the \(k\)-shortest paths of train operation in emergency
• Finding the \(K\) shortest paths in a schedule-based transit network
• The single train shortest route problem in a railyard

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841591)