One link-based algorithm (Frank-Wolfe) and three route-route based algorithms are compared for use in the dynamic user-optimal route choice problem. Computational experience with five test networks indicates that the route-based algorithms are in general superior to the link-based algorithm in terms of execution time but slightly inferior in terms of memory requirement.
Get full access to this article
View all access options for this article.
References
1.
LarssonT., and PatrikssonM.. Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem. Transportation Science, Vol. 26, No. 1, 1992, pp. 4–17.
2.
JayakrishnanR., TsaiW. K., PrashkerJ. N., and RajadhyakshaS.. Faster Path-Based Algorithm for Traffic Assignment. In Transportation Research Record 1443, TRB, National Research Council, Washington, D.C., 1994, pp. 75–83.
3.
ChenH. K., and HsuehC. F.. A Model and an Algorithm for the Dynamic User-Optimal Route Choice Problem. Transportation Research B, Vol. 32, No. 3, 1998, pp. 219–234.
