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

Huey Kuo Chen, Ginny Feng

研究成果: 雜誌貢獻期刊論文同行評審

19 引文 斯高帕斯(Scopus)

摘要

A stochastic/dynamic user-optimal route choice problem that assumes time-dependent route travel times Gumbel distributed is formulated by a variational inequality and the corresponding equilibrium conditions are introduced. Two K-shortest-path based heuristics called K-shortest-path (KSP) and restricted K-shortest-path (RKSP) are proposed and make comparisons with a link-based heuristic called stochastic dynamic method (SADA). Numerical examples show that both the KSP and RKSP are superior to the SADA in terms of total CPU time. While both the KSP and RKSP have fully taken the advantage of computational efficiency, the latter is more practical by taking into account the thresholds of an overlapping ratio and route travel time difference.

原文???core.languages.en_GB???
頁(從 - 到)13-30
頁數18
期刊European Journal of Operational Research
126
發行號1
DOIs
出版狀態已出版 - 1 10月 2000

指紋

深入研究「Heuristics for the stochastic/dynamic user-optimal route choice problem」主題。共同形成了獨特的指紋。

引用此