The Journal of The Korea Institute of Intelligent Transport Systems (한국ITS학회 논문지)

The Korea Institute of Intelligent Transport Systems (한국ITS학회)
권호 표지
DOI QR코드

DOI QR Code

Analysis of Convergence Level and Exit Criteria on Traffic Assignment Algorithms

통행배정모형의 수렴성 판단 및 종료기준 설정

  • 김주영 (서울시립대학교 도시과학연구원 융합도시연구센터) ;
  • 김재영 (한국개발연구원 공공투자관리센터) ;
  • 박상준 (한국개발연구원 공공투자관리센터) ;
  • 이승재 (서울시립대학교 교통공학과)
  • Received : 2014.11.20
  • Accepted : 2015.02.03
  • Published : 2015.02.28
Download PDF
⟨ Previous Next ⟩

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.

기존의 링크기반의 Frank-Wolfe 통행배정 기법은 구현의 용이성과 결과의 안정성 등으로 인해 널리 사용되어 왔으나, 교통분석을 위해 사용하는 기초자료의 크기와 정밀도가 향상됨에 따라 수렴성에 대한 논란이 제기되었다. 본 연구에서는 개별링크기반의 통행배정 기법 외에 경로기반, 출발지기반 알고리즘을 이용한 분석결과의 안정성, 적용가능성에 대한 검토를 수행하였다. 분석결과 각각의 상용프로그램 및 통행배정기법별로 결과의 차이가 일부 존재하지만 수렴성이 어느 정도 확보된 이후부터는 안정된 결과를 도출하는 것으로 나타났다. 특히 대규모 교통망에서 통행배정 모형이 충분히 수렴되지 않은 상태에서는 수렴성 및 종료기준에 따라 분석결과의 안정성에 관한 문제가 제기될 가능성이 존재하였다. 따라서 실무적으로 적정한 수준의 수렴성 확보 및 안정된 결과 값을 도출하고자 하는 노력이 요구된다.

Keywords

References

  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. https://doi.org/10.1016/0377-0427(84)90051-7
  4. Weintraub, A., and C. Ortiz. Accelerating "Convergence of the Frank-Wolfe Algorithm," Transportation Research Part B: Methodological, vol. 19, pp.113-122, 1985. https://doi.org/10.1016/0191-2615(85)90018-9
  5. Lupi, M., "Convergence of the Frank-Wolfe Algorithm in Transportation Networks," Civil Engineering Systems, vol. 3, pp.7-15, 1986. https://doi.org/10.1080/02630258608970418
  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. https://doi.org/10.1287/trsc.24.1.58
  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. https://doi.org/10.1016/j.trb.2006.02.008
  12. Powll., W.B. and Y. Sheffi. "The Convergence of Equilibrium Algorithms with Predetermined Step," Transportation Science, vol. 16, pp.45-55, 1982. https://doi.org/10.1287/trsc.16.1.45
  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. Larsson, T., and M. Patriksson., "Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem," Transportation Science, vol. 26, pp.4-17, 1992. https://doi.org/10.1287/trsc.26.1.4
  17. 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. https://doi.org/10.1061/(ASCE)0733-947X(2007)133:4(232)
  18. 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. https://doi.org/10.3141/2047-11
  19. 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.
  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. https://doi.org/10.1061/(ASCE)0733-947X(2004)130:1(49)
  24. Bloy, K. The Equilibrium Assignment - What Is A "Correct" Solution?(2004), from http://inro.ca/en/pres_pap/international/ieug04/BloyMexico.pdf.
  25. Wilson, B., "Finding the Value in ESD," Property Australia, vol. 20, pp.70-71, 2006.