Time analysis for planning a path in a time-window network

DOI10.1057/PALGRAVE.JORS.2601583MaRDI QIDQ4661089zbMATH OpenOpenAlexFDO

Authors Yen-Liang Chen, Li-Jen Hsiao, Kwei Tang

Publication date 4 April 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.2601583

zbMATH Keywords

networktime analysistime-window constraint

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Mathematical programming (90C99)

Recommendations

• Finding the first \(K\) shortest paths in a time-window network.
• Optimising waiting at nodes in time-dependent networks: cost functions and applications
• Minimum time paths in a network with mixed time constraints.
• Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Cited in

(2)

• Visiting a network of services with time constraints.
• A commuter departure-time model based on cumulative prospect theory

This page was built for publication: Time analysis for planning a path in a time-window network

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