Finding theKth shortest path in a time-schedule network

DOI10.1002/NAV.20061zbMATH Open1090.90074OpenAlexW2082298232MaRDI QIDQ4680459FDOQ4680459

Authors: Yen-Liang Chen, Kwei Tang 

Publication date: 1 June 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20061

Recommendations

• Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
• Finding the first \(K\) shortest paths in a time-window network.
• Finding the \(K\) shortest paths in a schedule-based transit network
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• The first K minimum cost paths in a time-schedule network
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• Finding the K Shortest Loopless Paths in a Network
• Finding the \(k\) quickest simple paths in a network
• Finding the k Shortest Paths
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem

zbMATH Keywords

time-schedule network\(K\)th shortest path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Cited In (8)

• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Algorithm for solving K-shortest paths problem in complicated network
• The first \(K\) shortest unique-arc walks in a traffic-light network
• The first K minimum cost paths in a time-schedule network
• Finding the \(K\) shortest paths in a schedule-based transit network
• Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
• Finding the first \(K\) shortest paths in a time-window network.
• Finding \(K\) shortest looping paths in a traffic-light network

This page was built for publication: Finding theKth shortest path in a time-schedule network

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