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.
Get full access to this article
View all access options for this article.
References
1.
WardropJ. G.Some Theoretical Aspects of Road Traffic Research. Proc., Institution of Civil Engineers, Part II, Vol. 1, 1952, pp. 325–378.
2.
PatrikssonM.The Traffic Assignment Problem: Models and Methods. VSP, Utrecht, the Netherlands, 1994.
3.
von HohenbalkenB.A Finite Algorithm to Maximize Certain Psuedoconcave Functions on Polytopes. Mathematical Programming, Vol. 9, 1975, pp. 189–206.
4.
von HohenbalkenB.Simplicial Decomposition in Nonlinear Programming Algorithms. Mathematical Programming, Vol. 13, 1977, pp. 49–68.
5.
HearnD. W., LawphongpanichS., and VenturaJ. A.. Finiteness in Restricted Simplicial Decomposition. Operations Research Letters, Vol. 4, 1985, pp. 125–130.
6.
LeventhalT., NemhauserG., and TrotterL.Jr.A Column Generation Algorithm for Optimal Traffic Assignment. Transportation Science, Vol. 7, 1973, pp. 168–176.
7.
DafermosS. C., and SparrowF. T.. The Traffic Assignment Problem for a General Network. Journal of Research of the National Bureau of Standards, Vol. 73B, 1969, pp. 91–118.
8.
LarssonT., and PatrikssonM.. Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem. Transportation Science, Vol. 26, No. 1, 1992.
9.
DambergO.Sequential and Parallel Algorithms for Bipartite and Urban Traffic Networks. Linkoping Studies in Science and Technology, Dissertation No. 430. Department of Mathematics, Linköping Institute of Technology, Linköping, Sweden, 1996.
10.
TatineniM., BoyceD. E., and MirchandaniP.. Solution Properties of Stochastic Route Choice Models. Technical Report to the National Institute of Statistical Sciences, Research Triangle Park, N.C., 1996.
11.
BerkaS., and BoyceD. E.. Generating Highway Travel Times with a Large-Scale, Asymmetric User Equilibrium Assignment Model. In Advanced Methods in Transportation Analysis (BiancoL. and TothP., eds.), Springer-Verlag, Berlin, 1996.
12.
ZhangY., HicksJ., and BoyceD. E.. Trip Data Fusion in ADVANCE. ADVANCE Working Paper, No. 43.Urban Transportation Center, University of Illinois, Chicago, 1994.
