The first K minimum cost paths in a time-schedule network

DOI10.1057/PALGRAVE.JORS.2601028zbMATH Open1131.90354OpenAlexW2024933657MaRDI QIDQ4658384FDOQ4658384

Authors: Yen-Liang Chen, Dan B. Rinks, Kwei Tang 

Publication date: 16 March 2005

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601028

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 theKth shortest path in a time-schedule network
• Minimum time paths in a network with mixed time constraints.
• Finding the \(K\) shortest paths in a schedule-based transit network

zbMATH Keywords

shortest pathnetworks and graphsroad transport

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Cited In (8)

• 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
• Minimization of travel time and weighted number of stops in a traffic-light network
• Finding theKth shortest path 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
• 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: The first K minimum cost paths in a time-schedule network

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