DOI QR코드

DOI QR Code

Estimating Internal Transfer Trips Considering Subway Express Line - Focusing on Smart Card Data Based Network -

지하철 급행노선을 고려한 내부환승 추정방안 - 스마트카드 자료기반 네트워크를 중심으로 -

  • 이미영 (국토연구원 국토환경.자원본부)
  • Received : 2019.09.05
  • Accepted : 2019.09.11
  • Published : 2019.10.01

Abstract

In general, transfer in subway stations is defined as transfer between lines and station transfer. In transfer between lines, passengers change from one subway line to another by utilizing horizontal pedestrian facilities such as transfer passages and pedestrian way. Station transfer appears in the situation that subway lines of enter and exit gate terminals differs from those of boarding and alighting trains and passenger trips utilize both vertical pedestrian facilities such as stair and escalator and horizontal facilities. The hypothesis on these two transfers presupposes that all subway lines are operated by either local train or express in subway network. This means that in a transfer case both local and express trains are operated in the same subway line, as a case of Seoul Metro Line 9, has not been studied. This research proposes a methodology of finding the same line transfer in the Seoul metropolitan subway network built based on the smart card network data by suggesting expanded network concept and a model that passengers choose a theirs minimum time routes.

지하철역사의 일반적인 환승통행은 노선간환승과 역사환승을 의미한다. 노선간환승은 다른 두 노선의 열차를 갈아타기 위하여 환승통로와 같은 수평보행시설을 통해 이동한다. 역사환승은 스마트카드 진출입 단말기노선과 승하차 열차노선이 다른 상황에서 발생하는 보행통행으로 계단, 에스컬레이터와 같은 수직보행시설을 이용하면서 환승통로를 함께 이용하는 통행이다. 이러한 환승의 가정은 지하철 네트워크를 운행하는 모든 노선은 완행 또는 급행의 단일노선에 한정되었다는 한계를 포함하고 있다. 따라서 완행과 급행이 동일노선으로 운영되는 상황에서 노선내에서 발생되는 환승에 대한 검토가 수행되지 않았다. 노선내환승은 메트로9호선과 같이 급행 및 완행 정차역이 동일노선에서 운행되는 상황에서 발생한다. 본 연구는 스마트카드 자료기반의 급행 및 완행열차가 동일노선에 존재하는 지하철네트워크를 대상으로 노선내환승을 분석하는 방법론을 구축한다. 이를 위해 급행 및 완행열차를 분리하기 위한 네트워크확장기법을 구축하고 최소시간경로를 선택하는 과정에서 동일 노선의 내부 환승이 재현되는 경로선택모형을 제안한다.

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, No. 1, pp. 97-106. https://doi.org/10.1016/0377-2217(93)90095-5
  2. 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
  3. Lee, M. Y. (2004). Transportation network models and algorithms considering directional delay and prohibitions for intersection movement. Ph.D. Thesis, University of Wisconsin at Madison, USA.
  4. Lee, M. Y. (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, KITS, Vol. 16, No. 2, pp. 1-12. https://doi.org/10.12815/kits.2017.16.2.01
  5. Lee, M. Y. (2018). "Estimating station transfer trips of seoul metropolitan urban railway stations -using transportation card data-." J. Korean Soc. Civ. Eng., KSCE, Vol. 38, No. 5, pp. 693-701. https://doi.org/10.12652/Ksce.2018.38.5.0693
  6. Lee, M. Y., Shin, S. I. and Kim, B. W. (2018). "An analysis model on passenger pedestrian flow within subway stations -using smart card data-." The Journal of the Korea Institute of Intelligent Transport Systems, KITS, Vol. 17, No. 6, pp. 14-24.
  7. Martins, E. Q. V. (1984). "An algorithm for ranking paths that may contain cycles." European Journal of Operational Research, Vol. 18, No. 1, pp. 123-130. https://doi.org/10.1016/0377-2217(84)90269-8
  8. Shin, S. I. (2004). "Finding the first K loopless paths in a transportation network." Journal of Korean Society of Transportation, KST, Vol. 22, No. 6, pp. 121-131.