Finding the first \(K\) shortest paths in a time-window network.

DOI10.1016/S0305-0548(02)00230-7zbMath1036.90025OpenAlexW2023766747MaRDI QIDQ1427091

Hsu-Hao Yang, Yen-Liang Chen

Publication date: 14 March 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00230-7

zbMATH Keywords

Shortest pathNetworkTime-window constraintSimple path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (5)

Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs ⋮ Shortest path problems with left-side time windows ⋮ Finding the \(K\) shortest paths in a schedule-based transit network ⋮ Finding \(K\) shortest looping paths with waiting time in a time--window network ⋮ Reliability of a stochastic intermodal logistics network under spoilage and time considerations

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The quickest path problem
• Vehicle Routing with Time Windows
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• An efficient algorithm for K shortest simple paths
• Data Structures and Computer Science Techniques in Operations Research
• Finding the k Shortest Paths
• Fibonacci heaps and their uses in improved network optimization algorithms
• Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
• Finding the K Shortest Loopless Paths in a Network
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
• Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows

This page was built for publication: Finding the first \(K\) shortest paths in a time-window network.