KSCE Journal of Civil and Environmental Engineering Research (대한토목학회논문집)

Korean Society of Civil Engeneers (대한토목학회)
권호 표지
DOI QR코드

DOI QR Code

Development of Dynamic Passenger-Trip Assignment Model of Urban Railway Using Seoul-Incheon-Gyeonggi's Transportation Card

대중교통카드기반 수도권 도시철도 통행수요배정모형

  • Received : 2015.11.30
  • Accepted : 2015.12.17
  • Published : 2016.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

With approximately 20 million transportation card data entries of the metropolitan districts being generated per day, application of the data to management and policy interventions is becoming an issue of interest. The research herein attempts a model of the possibility of dynamic demand change predictions and its purpose is thereby to construct a Dynamic Passengers Trip Assignment Model. The model and algorithm created are targeted at city rail lines operated by seven different transport facilities with the exclusion of travel by bus, as passenger movements by this mode can be minutely disaggregated through card tagging. The model created has been constructed in continuous time as is fitting to the big data characteristic of transport card data, while passenger path choice behavior is effectively represented using a perception parameter as a function of increasing number of transfers. Running the model on 800 pairs of metropolitan city rail data has proven its capability in determining dynamic demand at any moment in time, in line with the typical advantages expected of a continuous time-based model. Comparison against data measured by the eye of existing rail operating facilities to assess changes in congestion intensity shows that the model closely approximates the values and trends of the existing data with high levels of confidence. Future research efforts should be directed toward continued examination into construction of an integrated bus-city rail system model.

수도권에는 1일 약 2000만 건의 대중교통카드 전수자료가 생성되고 있으며, 이 자료를 이용하여 시설운영 및 정책방안을 개선하고 도출하려는 시도가 다양해지고 있다. 본 연구는 교통카드에서 생성되는 동적인 수요변화의 예측 가능성을 모형화하는 시도로서 동적 통행수요배정모형을 구축하는 것이 목적이다. 버스의 경우 승객 이동상황이 카드태그(tag)를 통해 비교적 정확하게 파악되므로, 본 연구에서는 버스를 제외한 수도권 도시철도에 대해, 7개 운송기관이 운영하는 노선을 대상으로 적용되는 모형 및 알고리즘을 구축하였다. 구축된 모형은 교통카드자료의 Big Data 속성에 적합하게 연속 시간형 모형으로 구축되었으며, 승객의 경로선택행태를 효과적으로 나타내기 위하여 환승 횟수 증가에 따른 인지파라메타를 구성하였다. 수도권 도시철도 약 800만 쌍에 대하여 모델링한 결과, 연속형 시간기반 모형의 장점이 반영되어 어떤 시간 시점에서도 동적 수요를 분석할 수 있는 특성을 파악하였다. 특히 기존 철도운영기관의 목측조사자료와 비교한 혼잡도 변화를 파악할 때, 모형에서 도출된 혼잡도와 운영기관이 제시한 혼잡도 간에 유사한 추세를 보이고 있어 높은 신뢰도를 보여주고 있다. 본 연구는 철도기관에 한정한 모형으로 향후, 버스-도시철도와 통합된 모형체계 구축과 같은 연구가 필요할 것으로 파악된다.

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 for the ranking of shortest paths." European Journal of Operational Research, Vol. 69, No. 1, pp. 97-106. https://doi.org/10.1016/0377-2217(93)90095-5
  2. Carey, M. (1992) Nonconvexity of the Dynamic Traffic Assignment Problem. Transportation Research. 26B, pp. 127-133.
  3. Friesz, T. L., Bernstein, D., Smith, T. E., Tobin, R. L. and Wie, B. W. (1993). A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem. Operation. Operations Research. 41, pp. 179-191. https://doi.org/10.1287/opre.41.1.179
  4. Friesz, T. L., Luque, F. J., Tobin, R. L. and Wie, B. W. (1989). Dynamic Network Traffic Assignment Considered As A Continuous Time Optimal Control Problem. Operations Research. 37, pp. 893-901. https://doi.org/10.1287/opre.37.6.893
  5. Metchang, D. K. and Nemhausser, G. L. (1978a). A Model and An Algorithm for the Dynamic Traffic Assignment Problems. Transportation Science. 12, pp. 183-199. https://doi.org/10.1287/trsc.12.3.183
  6. Metchang, D. K. and Nemhausser, G. L. (1978b). Optimality Conditions for a dynamic Traffic assignment Model. Transportation Science. 12, pp. 200-207. https://doi.org/10.1287/trsc.12.3.200
  7. Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V. and Mishchenko, E. F. (1962). The Mathematical Theory of Optimal Processes. English translation. Interscience. ISBN 2-88124-077-1.
  8. Ran, B. and Boyce, D. E. (1996). Modeling Dynamic Transportation Networks. Springer.
  9. Spiess, H. and Florian, M. (1999). "Optimal Strategies : A New Assignment Model for Transit Networks." Transportation Research B, Vol. 3, No. 2, pp. 83-102.
  10. Wie, B. W., Friesz, T. L. and Tobin, R. L. (1990). "Dynamic user optimal traffic assignment on congested multidestination Networks." Transportation Research, 24B, pp. 443-451.
  11. Wie, B. W., Tobin, R. L., Friesz, T. L. and Bernstein, D. (1995). "A discrete time, Nested cost operator approach to the dynamic network user equilibrium problem." Transportation Science, Vol. 29, No. 1, pp. 79-92. https://doi.org/10.1287/trsc.29.1.79

Cited by

  1. Transportation Card Based Optimal M-Similar Paths Searching for Estimating Passengers' Route Choice in Seoul Metropolitan Railway Network vol.16, pp.2, 2017, https://doi.org/10.12815/kits.2017.16.2.01