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

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

DOI QR Code

Rationality of Passengers' Route Choice Considering Smart Card Tag Constraints : Focused on Seoul Metropolitan Subway Network

교통카드 Tag 제약을 반영한 통행자 경로선택에 대한 합리성 평가 연구 : 수도권 지하철 네트워크를 중심으로

  • 이미영 (국민경제자문회의 지원단) ;
  • 남두희 (한성대학교 사회과학부) ;
  • 심대영 (카톨릭관동대학교 건축학과)
  • Received : 2020.11.17
  • Accepted : 2020.12.06
  • Published : 2020.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

This research proposes a methodology to evaluate the rationality of passengers' route choice who make trips within Seoul metropolitan subway based on smart card data. The rationality of user route choice is divided into the degree of determinacy and similarity concepts as basic principle. Determinacy is the degree to which the route selected by the passenger is identical to the system optimal path. Similarity indicates the degree to which the route is similar to the system optimal path. The K-path search method is used for path enumeration, which allows for measurement of determinacy. To assess determinacy within similarity, transfer tag data of private operators is used. Consequently, the concept of similarity applied to the model is such that the passenger's path choice is identical to the path taken using the tag reader. Results show that the determinacy of appearance of the shortest path (K=1) is 90.4%, while the similarity of appearance as K=(2-10) is 7.9%, summing to 98.3%. This indicates that trips on the metropolitan subway network are being rationally explained. 1.7% of irrational trips are attributed to the unexplainable error term that occurs due to the diversity of passengers.

본 연구는 교통카드자료 이용하여 수도권 지하철을 통행하는 승객의 경로선택의 합리성에 대한 평가를 시행하는 방법론을 제안한다. 사용자 경로선택의 합리성은 최적의 경로를 선택한다는 기본원리로서 확정성과 유사성으로 구분한다. 확정성은 승객이 선택한 경로는 시스템적 최적경로와 일치하는 정도이다. 유사성은 시스템적 최적경로와 유사하게 파악되는 정도이다. 합리성을 판단하는 기법으로 K경로탐색기법을 이용하여 경로를 열거하는 방법을 구축하였다. 유사성 내에서 확정성을 파악하기 위하여 민자운영기관의 환승단말기 Tag 정보를 활용하였다. 따라서 유사성에서 승객이 선택한 최적경로는 Tag를 경유한 경로와 동일하다는 개념을 적용하였다. 연구결과 최적경로(K=1)로 나타나는 확정성은 90.4(%), K=(2-10)으로 나타나는 유사성은 7.9(%)로서 총 98.3(%)의 수도권 지하철 통행이 합리적으로 설명된다고 평가하였다. 비합리적 통행 1.7(%)는 사용자 다양성을 고려하여 나타나는 설명되지 않는 에러항으로 평가된다고 파악하였다.

Keywords

References

  1. Azevedo J. A., Costa M. E. O. S., Madeira J. J. E. R. S. and Martins E. Q. V.(1993), "An Algorithm from the Ranking of Shortest Paths," European Journal of Operational Research, vol. 69, pp.97-106. https://doi.org/10.1016/0377-2217(93)90095-5
  2. Beckmann M. J., McGuire C. B. and Winstern C. B.(1956), Studies int the Economics of Transportation, Yale University Press, New Haven, Conn.
  3. Dafermos S.(1980), "Traffic Equilibrium and Variational Inequalities," Transportation Science, vol. 14, no. 1, pp.42-54. https://doi.org/10.1287/trsc.14.1.42
  4. Dafermos S.(1982), "Relaxation Algorithm for the General Asymmetric Traffic Equilibrium Problem," Transportation Science, vol. 16, no. 2, pp.231-240. https://doi.org/10.1287/trsc.16.2.231
  5. Dial R. B.(1971), "A Probabilistic Multipath Traffic Assignment Algorithm which Obviates Path Enumeration," Transportation Research, vol. 5, pp.83-111. https://doi.org/10.1016/0041-1647(71)90012-8
  6. Fisk C. S. and Nguyen S.(1982), "Solution Algorithm for network Equilibrium Models with Asymmetric User Costs," Transportation Science, vol. 16, no. 3, pp.361-381. https://doi.org/10.1287/trsc.16.3.361
  7. Florian M. and Spicess H.(1982), "The Convergence of Diagonalization Algorithm for Asymmetric Network Equilibrium Problems," Transportation Research Part B: Methodological, vol. 16, no. 6, pp.477-483. https://doi.org/10.1016/0191-2615(82)90007-8
  8. Kirby R. F. and Potts R. B.(1969), "The Minimum Route Problem for Networks with Turn Penalties and Prohibitions," Transportation Research, vol. 3, no. 3, pp.397-408. https://doi.org/10.1016/S0041-1647(69)80022-5
  9. LeBlanc L. J., Morlock E. K. and Pierskalla W.(1975), "An Efficient Approach to Solving the Road Network Equilibrium Traffic Assignment Problem," Transportation Research, vol. 9, no. 5, pp.309-318. https://doi.org/10.1016/0041-1647(75)90030-1
  10. Lee M.(2004), Transportation Network Models and Algorithms Considering Directional Delay and Prohibitions for Intersection Movement, Ph.D. Thesis, University of Wisconsin at Madison.
  11. Lee M.(2017), "Transportation Card Based Optimal M-Similar Paths Searching for Estimating Passengers' Route Choice in Seoul Metropolitan Railway Network," The Journal of the Korea Institute of Intelligent Transport Systems, vol. 16, no. 2, pp.1-12. https://doi.org/10.12815/kits.2017.16.2.01
  12. Lee M.(2018), "Optimal Path Finding Considering Smart Card Terminal ID Chain OD-Focused on Seoul Metropolitan Railway Network-," The Journal of the Korea Institute of Intelligent Transport Systems, vol. 17, no. 6, pp.40-53. https://doi.org/10.12815/kits.2018.17.6.40
  13. Sheffi Y. and Daganzo C. F.(1980), "Computation of Equilibrium over Transportation Networks: The Case of Disaggregate Demand Models," Transportation Science, vol. 14, no. 2, pp.155-173. https://doi.org/10.1287/trsc.14.2.155
  14. Sheffi Y. and Powell W. B.(1982), "An Algorithm for the Equilibrium Assignment Problem with Random Link Times," Networks, vol. 12, no. 2, pp.191-207. https://doi.org/10.1002/net.3230120209
  15. Sheffi Y.(1985), Urban Transportation Networks, MIT Express.
  16. Shin S.(2004), "Finding the First K Loopless Paths in A Transportation Network," Journal of Korean Society of Transportation, vol. 22, no. 6, pp.121-131.
  17. Wardrop J. G.(1952), "Some Theoretical Aspects of Road Traffic Research," Proceedings of the Institute of Civil Engineers Part II, vol. 1, pp.325-378. https://doi.org/10.1680/ipeds.1952.11259