Dynamic System-Optimal Route Choice Model

1999 ◽  
pp. 181-199
Author(s):  
Huey-Kuo Chen
Keyword(s):  
Dynamic System ◽  
Choice Model ◽  
Route Choice ◽  
Optimal Route ◽  
System Optimal

The dynamic system‐optimal route choice problem and toll policies

1999 ◽  
Vol 22 (3) ◽  
pp. 201-228 ◽  
Author(s):  
Huey‐Kuo Chen ◽  
Che‐Fu Hsueh ◽  
Chung‐Yung Wang
Keyword(s):  
Dynamic System ◽  
Route Choice ◽  
Optimal Route ◽  
Choice Problem ◽  
System Optimal

Solving an Instantaneous Dynamic User-Optimal Route Choice Model

1995 ◽  
Vol 29 (2) ◽  
pp. 128-142 ◽  
Author(s):  
David E. Boyce ◽  
Bin Ran ◽  
Larry J. Leblanc
Keyword(s):  
Choice Model ◽  
Route Choice ◽  
Optimal Route

Comparison of Disaggregate Simplicial Decomposition and Frank-Wolfe Algorithms for User-Optimal Route Choice

1998 ◽  
Vol 1617 (1) ◽  
pp. 157-162 ◽  
Author(s):  
Maya Tatineni ◽  
Henrik Edwards ◽  
David Boyce
Keyword(s):  
Optimality Conditions ◽  
Choice Model ◽  
Route Choice ◽  
Large Network ◽  
Optimal Route ◽  
Simplicial Decomposition ◽  
Chicago Area ◽  
Better Than

The disaggregate simplicial decomposition (DSD) method has been posed as a better alternative to existing algorithms for solving the deterministic user-optimal route choice model. The application of the DSD algorithm is compared and evaluated with the commonly used Frank-Wolfe (FW) algorithm on a large network in the Chicago area. The results indicate that the DSD algorithm performs much better than the FW with respect to reaching the optimality conditions specified by the model.

Sign in / Sign up

Export Citation Format

Share Document