Commuters' Paths with Penalties for Early or Late Arrival Time

DOI10.1287/TRSC.24.4.276MaRDI QIDQ5202523zbMATH OpenOpenAlexFDO

Authors André de Palma, Pierre Hansen, Martine Labbé

Publication date 1990

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL http://www.kellogg.northwestern.edu/research/math/papers/727.pdf

zbMATH Keywords

generalized shortest path problemNP-hardpolynomial subcasespseudo- polynomial algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Optimum departure times for commuters in congested networks
• Time-dependent shortest paths with discounted waits
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• scientific article; zbMATH DE number 1445281
• Dynamic shortest paths minimizing travel times and costs

Cited in

(4)

• A variational inequality formulation of the dynamic traffic assignment problem
• Vehicle dispatching with time-dependent travel times
• Optimum departure times for commuters in congested networks
• The commuter's paradox: why it takes longer to get home than to get to work

This page was built for publication: Commuters' Paths with Penalties for Early or Late Arrival Time

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