Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem

DOI10.1007/s10951-017-0535-zzbMath1406.90021OpenAlexW2736751709MaRDI QIDQ1617289

Lunce Fu, Maged M. Dessouky

Publication date: 7 November 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-017-0535-z

zbMATH Keywords

networkheuristicstrain routingstate-dependent shortest path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Exact train pathing
• Dynamic graph generation for the shortest path problem in time expanded networks
• The shortest route through a network with time-dependent internodal transit times
• Continuous-Time Dynamic Shortest Path Problems with Negative Transit Times
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• Minimum weight paths in time-dependent networks
• Continuous-Time Shortest Path Problems and Linear Programming
• Time-varying shortest path problems with constraints
• Dynamic shortest paths minimizing travel times and costs

This page was built for publication: Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem