The single train shortest route problem in a railyard

DOI10.1007/s11590-021-01761-wzbMath1477.90115OpenAlexW3171408142MaRDI QIDQ2230785

Kelly M. Sullivan, Joseph Geunes, Mina Aliakbari

Publication date: 28 September 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01761-w

zbMATH Keywords

shortest pathpolynomial-time algorithmroutingrailyard network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (1)

Multiple train repositioning operations in a railyard network

Cites Work

• A note on two problems in connexion with graphs
• \(k\)-shortest routing of trains on shunting yards
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• A Survey of Optimization Models for Train Routing and Scheduling
• New Bounds on the Complexity of the Shortest Path Problem
• Routing Trains Through Railway Stations: Model Formulation and Algorithms
• Fibonacci heaps and their uses in improved network optimization algorithms
• New approaches for solving the block‐to‐train assignment problem

This page was built for publication: The single train shortest route problem in a railyard