Journal of the Korean Society for Railway (한국철도학회논문집)

The Korean Society for Railway (한국철도학회)
권호 표지
DOI QR코드

DOI QR Code

A LOGIT based Traffic Assignment Model Considering Passenger Transfer on Railway Network

철도 네트워크에서 환승수요를 고려한 다항로짓 기반 통행배정 모형 연구

  • 박범환 (한국철도대학 철도경영정보과) ;
  • 노학래 (한국철도기술연구원 신소재틸팅열차시스템연구단) ;
  • 천승훈 (한국교통연구원 국가교통DB센터) ;
  • 이진선 (우송대학교 철도경영학과)
  • Received : 2011.02.07
  • Accepted : 2011.04.20
  • Published : 2011.06.26
Download PDF
⟨ Previous Next ⟩

Abstract

In our study, we present a new LOGIT-based traffic assignment model applicable to intercity railway network. Most traffic assignment models have been developed for public transit assignment in urban area, so that they are known to produce unrealistic results in intercity railway demand analysis. Especially, since the introduction of KTX, more passengers are using a route including KTX service and the schedule becomes more compatible with transfer. Our study presents a new LOGIT-based traffic assignment model considering passenger transfer. To do so, we suggest a new route search algorithm to find K paths with non increasing order in the utility value.

본 연구는 철도 네트워크에서의 통행배정 모형에 관한 것이다. 기존의 통행배정모형은 주로 도로 혹은 도시 대중교통 네트워크에 초점을 둔 연구로서, 최적전략 기반 통행배정 모형을 비롯한 대부분의 통행배정 모형 이 지역간 철도 네트워크에 대해서는 비현실적인 수요를 생성한다고 알려져 있다. 특히 KTX개통 이후, KTX가 포함된 환승경로를 이용하는 승객이 점차 증가하는 추세이며, 이러한 KTX가 포함된 환승 경로 및 스케줄이 지속적으로 개선되고 있다. 본 연구는 환승을 고려한 새로운 다항로짓 기반 통행배정 모형을 제시한다. 특히 본 연구에서 제시하는 모형은, 통행 시간, 경로의 최소 운행횟수, 환승 저항 등 다양한 변수가 포함된 효용함수가 주어져 있을 때, K개의 최대 효용을 갖는 경로를 탐색하는 알고리즘을 포함하고 있다.

Keywords

References

  1. A. Bouma, C. Oltrogge (1994) "Linienplanung und Simulation fur offentliche Verkehrswege in Praxis und Theorie", ETR Eisenbahntechnische Rundschau, Jg.: 43, Nr.6, Seite 369-378.
  2. H. Spiess, M. Florian (1989) "Optimal Strategies : A New Assignment Model for Transit Networks", Transportation Research Part B, 23B(2), pp. 83-102.
  3. J. De Cea, J.E. Fernandez (1989) "Transit Assignment to Minimal Routes : An Efficient New Algorithm", Traff., Eng. Control 20-10.
  4. J.Y. Yen (1971) "Finding the K shortest Loopless Paths in a Network, Management Science", 17(11).
  5. K.-T. Kim, S. Rhee, Y.-S. Kwon (2008) "A deterministic Transit Assignment Model for Intercity Rail Network, Journal of the Korean Society for Railway, 11(6), pp. 550-561.
  6. J. Lee, I. Kim (2001) "Study on Multi-modal Transit Network Assignment with Dial Algorithm", Journal of Korean Society of Transportation, 19(2), pp. 53-60.
  7. Y. Lim (2009) "A mathematical model for transit network assignment", manuscript.
  8. K.-C. Park, J.-J. Moon, S-.M-. Lee, C.-H. Park, "A Stochastic Transit Assignment Model based on Mixed Transit Modes", Journal of Korean Society of Transportation, 25(3), pp. 111-121.
  9. K.-T. Kim, J. Lee (2007) "Multinomial Logit Modeling: Focus on Regional Rail Trips", Journal of Korean Society of Transportation, 25(1), pp. 109-119.
  10. K.-T. Kim (2007) "A Transit Assignment Model for Intercity Rail Network", Ph.D Thesis, Seoul National University.
  11. B.H. Park, C.-S. Kim, H.-L. Rho (2009) "A study on the Relation between Trip assignment model and Line planning", Proc. of Korean Society for Railway Conference.
  12. S-.I. Shin (2004) "Finding the First K Shortest Loopless Paths in a Transportation Network", Journal of Korean Society of Transportation, 22(6), pp. 121-131.
  13. H.-S. Shin, H.-U. Cho, J.-M. Kim, W.-T. Lee (2009) "A study on the alternatives for realization of benefit cost analysis in railway projects - More focused on benefits for the value of travel time", Proc. of Korean Society for Railway Conference.

Cited by

  1. An Iterative Linear Approximation Algorithm for a Unified Model of Traffic Assignment and Line Planning in Railway Networks vol.17, pp.2, 2014, https://doi.org/10.7782/JKSR.2014.17.2.140