Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest‐path trees

DOI10.1002/NET.10056MaRDI QIDQ4797945zbMATH OpenOpenAlexFDO

Authors Robert B. Dial

Publication date 10 March 2003

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10056

zbMATH Keywords

dynamic traffic assignmentparametric analysisdynamic minimum pathshighway route guidance

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Recommendations

• An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
• The time-dependent quickest path problem: properties and bounds
• On solving quickest time problems in time-dependent, dynamic networks
• Dynamic shortest paths minimizing travel times and costs
• Efficient modeling of travel in networks with time-varying link speeds

Cited in

(2)

• Parametric shortest-path algorithms via tropical geometry
• ynamic traffic model under emergency incident and bidirectional dynamic shortest path algorithm

This page was built for publication: Toward faster algorithms for dynamic traffic assignment. I. Parametric quickest‐path trees

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