Finding the K shortest paths in a time-schedule network with constraints on arcs

DOI10.1016/J.COR.2013.07.005zbMATH Open1348.90156OpenAlexW2048699920MaRDI QIDQ336675FDOQ336675

Authors: Shuiping Chen, Wen Jin, Hai Jiang 

Publication date: 10 November 2016

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

Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.005

Recommendations

• The first K minimum cost paths in a time-schedule network
• Finding theKth shortest path in a time-schedule network
• Finding the first \(K\) shortest paths in a time-window network.
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Finding the \(K\) shortest paths in a schedule-based transit network

zbMATH Keywords

constrained shortest paths\(K\) shortest pathstime-constrained networktime-schedule network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• A note on two problems in connexion with graphs
• Finding the k Shortest Paths
• An algorithm for ranking paths that may contain cycles
• Finding the K Shortest Loopless Paths in a Network
• An Appraisal of Some Shortest-Path Algorithms
• An algorithm for the ranking of shortest paths
• Minimum time paths in a network with mixed time constraints.
• Finding the first \(K\) shortest paths in a time-window network.
• Finding \(K\) shortest looping paths in a traffic-light network
• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• Computational experience with an algorithm for finding the k shortest paths in a network
• The first K minimum cost paths in a time-schedule network
• Finding theKth shortest path in a time-schedule network

Cited In (11)

• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• Finding the \(k\) shortest simple paths: time and space trade-offs
• The first \(K\) shortest unique-arc walks in a traffic-light network
• The first K minimum cost paths in a time-schedule network
• Finding theKth shortest path in a time-schedule network
• Finding the \(K\) shortest paths in a schedule-based transit network
• Balanced-flow algorithm for path network planning in hierarchical spaces
• Priority-oriented route network planning for evacuation in constrained space scenarios
• Minimum time paths in a network with mixed time constraints.
• Finding the first \(K\) shortest paths in a time-window network.

This page was built for publication: Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs

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