Abstract
Four algorithms are compared for use in the dynamic user optimal route choice problem. Computational efficiency are obtained and analyzed by using five networks for testing. The disaggregate simplical decomposition version of Larsson and Patriksson (DSD1) and GP methods are median and fast, respectively, in terms of memory requirements. Thus, these two algorithms are good candidates for solving the dynamic user optimal route choice problem, which is usually large in network size.
| Original language | English |
|---|---|
| Pages (from-to) | 114-120 |
| Number of pages | 7 |
| Journal | Transportation Research Record |
| Issue number | 1667 |
| DOIs | |
| State | Published - 1999 |