Browse > Article
http://dx.doi.org/10.12815/kits.2015.14.1.031

Analysis of Convergence Level and Exit Criteria on Traffic Assignment Algorithms  

Kim, Joo-Young (University of Seoul)
Kim, Jae-Young (KDI, PIMAC)
Park, Sang-Jun (KDI, PIMAC)
Lee, Seung-Jae (Unversity of Seoul)
Publication Information
The Journal of The Korea Institute of Intelligent Transport Systems / v.14, no.1, 2015 , pp. 31-45 More about this Journal
Abstract
Existing link-based Frank-Wolfe algorithm has been widely used, thanks to its ease of simulation and stable results; however, it comes with low convergence issue towards near the optimum value. Such issue was not considered as a major drawback in the past. However, in the present, some arguments have occurred over the method's stability, analysis time, and other limits as the size and details of the fundamental data for traffic analysis have vastly improved. Therefore, this paper compared the theoretical attributes and the pros and cons between the Frank-Wolfe algorithm and the Origin-based algorithm and Path-based algorithm newly being developed. As a result of this paper, there is possibility that a problem of stability may arise depending on the convergence and exit criteria. Thus, In practice, this effort to derive the appropriate level of convergence is required to secure and stable results.
Keywords
Convergence Level; Frank-Wolfe Algorithm; Origi~-Based Algorithm; Path-Based Algorithm; Traffic Assignment;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Beckmann, M.J., McGuire,C.B., and C.B.Winston, Studies in the Economics of Transportation. Yale University Press, Connecticut, 1956.
2 LeBlanc, L.J., Mathematical Programming Algorithms for Large Scale Network Equilibrium and Network Design Problems. PhD thesis, Northwestern Univ, Evanston, Illinois, USA. 1973
3 Fukushima, M., "On the Convergence of a Class of Outer Approximation Algorithms for Convex Programs," Journal of Computational and Applied Mathematics, vol. 10, pp.147-156, 1984.   DOI
4 Weintraub, A., and C. Ortiz. Accelerating "Convergence of the Frank-Wolfe Algorithm," Transportation Research Part B: Methodological, vol. 19, pp.113-122, 1985.   DOI
5 Lupi, M., "Convergence of the Frank-Wolfe Algorithm in Transportation Networks," Civil Engineering Systems, vol. 3, pp.7-15, 1986.   DOI
6 Hendrickson, C. T., and Janson, B. N., "Expert Systems and Pavement Management," Presented at 2nd North America Conference on Managing Pavements, Toronto, Ontario, USA. 1987.
7 Arezki., Y. and D. Van Vliet., "A Full Analytical Implementation of the PARTAN/Frank-Wolfe Algorithm for Equilibrium Assignment," Transportation Science, vol. 24, pp.58-62, 1990.   DOI
8 Dafermos, S. C., Traffic Assignment and Resource Allocation in Transportation Networks, PhD thesis, Operations Research, Johns Hopkins University, Baltimore, USA, 1968.
9 Jayakrishnan, R., Tsai, Wei T., Prashker, Joseph N., and Rajadhyaksha, Subodh. A Faster Path-Based Algorithm for Traffic Assignment. Working Paper, University of California Transportation Center, 1994
10 Bar-Gera H., Origin-based Algorithms for Transportation Network Modeling. PhD thesis, University of Illinois at Chicago, USA, 1999.
11 Robert B. Dial., "A Path-Based User-Equilibrium Traffic Assignment Algorithm That Obviates Path Storage and Enumeration," Transportation Research Part B : Methodological, vol. 40, pp.917-936. 2006.   DOI
12 Powll., W.B. and Y. Sheffi. "The Convergence of Equilibrium Algorithms with Predetermined Step," Transportation Science, vol. 16, pp.45-55, 1982.   DOI
13 Hearn, D.W., Lawphongpanich, S., and J.A. Ventura. Computation Mathematical Programming : Restricted Simplicial Decomposition : Computation and Extensions. Springer Berlin Heidelberg, USA, 1987.
14 Larsson, T., M. Patriksson, and C. Rydergren. Network Optimization : Applications of Simplicial Decomposition with Nonlinear Column Generation to Nonlinear Network Flows. Springer Berlin Heidelberg, Sweden, 1997.
15 Daneva, M., and P. O. Lindberg. "A Conjugate Direction Frank-Wolfe Method with Applications to the Traffic Assignment," Operations Research Proceedings, Springer Berlin Heidelberg, Sweden, 2002.
16 Inoue, S., and Maruyama. T., "Computational Experience on Advanced Algorithms for User Equilibrium Traffic Assignment Problem and Its Convergence Error". at 8th International Conference on Traffic and Transportation Studies, Changsha, China, 2012.
17 Larsson, T., and M. Patriksson., "Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem," Transportation Science, vol. 26, pp.4-17, 1992.   DOI
18 Bar-Gera H., and A. Luzon., "Differences among Route Flow Solutions for the User-Equilibrium Traffic Assignment Problem," Journal of Transportation Engineering, vol. 133, pp.232-239, 2007.   DOI
19 Zhang, H. M., Nie, Y., and Z. Qian, "Estimating Time-Dependent Freeway Origin-Destination Demands with Different Data Coverage: Sensitivity Analysis," Transportation Research Record: Journal of the Transportation Research Board, Vol. 2047, Transportation Research Board of the National Academies, Washington, D.C., pp.91-99, 2008.   DOI
20 Florian, M., and S. He., Changing Assignment Al gorithms : The Price of Better Convertgence(2009), from http://teachamerica.com/APP09/APP09S14Florian/player.html
21 Caliper Mapping Software, New Empirical Study of Alternative Traffic Equilibrium Algorithms(2010), from http://www.caliper.com/press/what_transcad_users_should_know_about_traffic_assignment.pdf,
22 Zhong, Z., and M. Matthew., What TransCAD Users Should Know about New Static Traffic Assignment Methods(2010), from https://www.google.co.kr/url?sa=t&rct=j&q=&esrc=s&source=web&cd=2&ved=0CCMQFjAB&url=http%3A%2F%2F.
23 Boyce, D., Ralevic-Dekic, B., and H. Bar-Gera., "Convergence of Traffic Assignments: How Much is Enough?," Journal of Transportation Engineering, vol. 130, pp.49-55, 2004.   DOI
24 Wilson, B., "Finding the Value in ESD," Property Australia, vol. 20, pp.70-71, 2006.
25 Bloy, K. The Equilibrium Assignment - What Is A "Correct" Solution?(2004), from http://inro.ca/en/pres_pap/international/ieug04/BloyMexico.pdf.