Heuristics for the stochastic/dynamic user-optimal route choice problem

DOI10.1016/S0377-2217(99)00277-5zbMath0970.90020OpenAlexW2038472377MaRDI QIDQ1584809

Huey-Kuo Chen, Ginny Feng

Publication date: 11 January 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00277-5

zbMATH Keywords

heuristicsvariational inequalityGumbel distributiongradient projection method\(K\)-shortest pathflow propagationrestricted \(K\)-shortest-pathstochastic dynamic methodstochastic/dynamic user-optimal route choice

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (2)

A heuristic for the doubly constrained entropy distribution/assignment problem ⋮ Reliability evaluation for stochastic and time-dependent networks with multiple parking facilities

Cites Work

• Unnamed Item
• Dynamic urban transportation network models: theory and implications for intelligent vehicle-highway systems
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Heuristics for the stochastic/dynamic user-optimal route choice problem