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

DOI10.1016/S0377-2217(99)00277-5zbMATH Open0970.90020OpenAlexW2038472377MaRDI QIDQ1584809FDOQ1584809

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)

Cites Work

• Finding the K Shortest Loopless Paths in a Network
• Title not available (Why is that?)
• Dynamic urban transportation network models: theory and implications for intelligent vehicle-highway systems

Cited In (3)

• Reliability evaluation for stochastic and time-dependent networks with multiple parking facilities
• An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem
• A heuristic for the doubly constrained entropy distribution/assignment problem

   Recommendations

• Solving an Instantaneous Dynamic User-Optimal Route Choice Model 👍 👎
• Ranking paths in stochastic time-dependent networks 👍 👎
• An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem 👍 👎
• A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost 👍 👎
• High-performance heuristics for optimization in stochastic traffic engineering problems 👍 👎

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

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