An Solution Algorithm for A Multi-Class Dynamic Traffic Assignment Problem

다계층운전자를 고려한 동적통행배정모형의 해법

  • Shin, Seong-Il (Seoul Development Institute(SDI) Department of Urban Transportation Planning) ;
  • Kim, Jeong-Hyun (University of Hanyang Department of Civil & Environmental Engineering) ;
  • Baik, Nam-Cheol (Korea Institute Construction Technology(KICT) Department of Advanced Road Transportation)
  • Published : 2003.01.01

Abstract

This paper proposes a solution algorithm for solving a multi-class analytical DTA model. In the DTA model, three traveler classes are classified according to different assumptions of traveler's route choice behavior: including fixed route, Stochastic Dynamic User Optimum(SDUO), and Dynamic User Optimum(DUO). To solve this DTA model, variables of link flow and exit flow are represented solely by inflow. The resulting Linear Program(LP) subproblem in the inner iteration is solved as a typical time-dependent shortest route problem over a physical network. Accordingly, the required time-space network expansion in solving DTA models is no longer needed.

동적통행배정모형을 이용해서 교통정보를 ㅈ공하기 위해서는 다양한 여행자의 경로선택행태를 고려하는 것이 필요하다. 여행자계층은 일반적으로 3가지 형태로 분류된다: 1) 버스나 지하철과 같은 대중교통의 고정된 경로(fixed route class)를 이용하는 그룹, 2) 자신이 인지하는 경로비용을(perceived route, unguided class) 판단하여 경로를 선택하는 그룹, 3) 정확한 경로선택에 대한 정보를(guided class)기반으로 경로를 선택하는 그룹. 본 연구에서는 이 3그룹의 여행자를 포함하는 동적통행배정모형의 해법을 제안한다. 제안된 해법에서는 링크의 교통량과 유출교통류를 진입교통류 단일변수로 축소하여 시간과 공간을 확장하기 않고 실재의 네트워크에서 최단경로를 도출하는 방법을 적용한다. 따라서 시간종속적인 통행비용함수에 진입교통유율, 교통량, 유출교통유율 3가지 변수를 고려해야 하는 시공간확장방법에 비해 네트워크의 규모와 수행시간에 있어 유리하다.

Keywords

References

  1. Beckmann, M., McGuire, C. B., and Winsten, C. B.(1956), Studies in the economics of transportation, Yale University Press, New Haven, Connecticut
  2. Ben-Akiva, M., Bierlaire, M., Bottom, J., Koutsopoulos, H. N., and Mishalani. R. G.(1997), 'Development of a route guidance generation system for real-time application', Proc., The 8th International Federation of Automatic Control Symposium on Transportation Systems, IFAC, Chania, Greece
  3. Dafermos, S. C. (1972), 'The traffic assignment problem for multi-user transportation network', Transp. Sci., 6, pp. 73-87 https://doi.org/10.1287/trsc.6.1.73
  4. Danganzo. C. F., and Sheffi, Y. (1977), 'On stochastic models of traffic assignment', Transp. Sci., 11, pp.253-274 https://doi.org/10.1287/trsc.11.3.253
  5. Frank, M., and Wolfe P.(1952), 'An algorithm for quadratic programming', Naval Res. Logistics Quarterly, 3, pp.95-110
  6. Hicks, J., Boyce, D. E., and Sen, A.(1992), Static network equilibrium models and analyses for the design of dynamic route guidance systems, Final report to the Illinois Department of Transportation, Urban Transportation Center, University of Illinois, Chicago
  7. Jayakrishnan. R., Mahmassani, H. S., and Hu, T. Y.(1994), 'An evaluation tool for advanced traffic information and management systems in urban networks', Transp. Res., 2C, pp.129-147
  8. LeBlanc L. J., Morlok, E. K., and Pierskalla W. P. (1975), 'An efficient approach to solving the road network equilibrium traffic assignment problem', Transp. Res., 9, pp.309-318 https://doi.org/10.1016/0041-1647(75)90030-1
  9. Mahmassani, H. S' and Hawas, Y.(1997), 'Data requirement for development, calibration of dynamic traffic models, and algorithms for ATMS/ATIS', Presented at the $76^{th}$ Annual Meeting of the Transportation Research Board, Washington, DC.
  10. Mahmassani, H. S., Peeta. S., Hu, T.-Y., and Ziliaskopoulos, A.(1993), 'Dynamic traffic assignment with multiple user classes for realtime ATIS/ATMS applications', Large Urban Systems, Proceedings of the Advanced Traffic management Conference, Yagar, S. and Santiago. A.J.. eds., Federal Highway Administration, US Department of Transportation. Washington. DC. pp.91-114
  11. Nagurney, A.(1993). Network economics: a variational inequality approadh, Kluwer Academic Publishers. Norwell. Massachusetts
  12. Ran. B., and Boyce. D.(1996), Modeling dynamic transportation networks, Springer-Verlag. Heidelberg
  13. Sheffi. Y.(1985). Urban transportation networks, Prentice-Hall. Englewood Cliffs, New Jersey
  14. Sheffi. Y.. and Powell, W. B.(1982). 'An algorithm for the equilibrium assignment problem with random link times'. Networks. 12. pp. 191-207 https://doi.org/10.1002/net.3230120209
  15. Wardrop. J.(1952). 'Some theoretical aspects of road traffic research'. Proceedings cf the Institute if Civil Engineers. Part II. pp.325-378
  16. Vythoulkas, P. C.(1990), 'Two models for predicting dynamic stochastic equilibria in urban transportation networks'. Proceedings of the $11^{th}$ International Symposium on Transportation and Traffic Theory, Elsevier Science, Amsterdam. pp.253-272