Journal of Korean Society of Transportation (대한교통학회지)

Korean Society of Transportation (대한교통학회)
권호 표지
DOI QR코드

DOI QR Code

A Logit Type of Public Transit Trip Assignment Model Considering Stepwise Transfer Coefficients

Stepwise 환승계수를 고려한 Logit 유형 대중교통통행배정모형

  • SHIN, Seongil (Department of Transportation System Research, The Seoul Institute) ;
  • BAIK, Namcheol (ICT Convergence & Integration Research Institute, Korea Institute of Civil Engineering and Building Technology)
  • 신성일 (서울연구원 교통시스템연구실) ;
  • 백남철 (한국건설기술연구원 ICT융합연구소)
  • Received : 2016.10.20
  • Accepted : 2016.12.14
  • Published : 2016.12.30
Download PDF
⟨ Previous Next ⟩

Abstract

This study proposes a concept of Stepwise Transfer Coefficient(STC) which implies greater transfer cost with increasing the number of transfers. Thus, the public transport information system provides the choice sets of travel routes by the consideration of not only transportation time but also the optimum number of transfers. However, path choice problems that involve STC are found to include non additive cost, which requires additional route enumeration works. Discussions on route enumeration in actual transportation networks is very complicated, thereby warranting a theoretical examination of route search considering STC. From these points of view, this study results in a probability based transit trip assignment model including STC. This research also uses incoming link based entire route deletion method. The entire route deletion method proposed herein simplifies construction of an aggregation of possible routes by theoretically supporting the process of enumeration of the different routes from origin to destination. Conclusively, the STC reflected route based logit model is proposed as a public transportation transit trip assignment model.

Stepwise 환승계수(이하 STC)는 환승회수 증가에 따라 환승비용을 실제보다 많게 인식하도록 한다. 통행시간과 최소환승회수 정보를 제공하는 것은 이러한 경향을 감안하는 취지이다. STC가 포함된 경로탐색문제는 비가산성비용을 포함하며 최적조건의 비성립으로 경로열거가 요구된다. 따라서 대중교통망에서 STC를 고려하는 경로탐색에 대한 이론적 검토를 통해서 경로탐색의 실패를 우회하는 방안이 요구된다. 본 연구는 STC가 포함되는 대중교통망에서 확률적 통행배정모형에 대하여 검토한다. 비가산성 경로문제를 완화하는 방안으로 유입링크기반 전체경로삭제기법을 활용하는 방안을 제안한다. 전체경로삭제기법은 출발지에서 도착지까지 서로 상이한 경로의 구성된 가능경로집합을 구축하기 용이하다. STC를 반영한 경로기반 Logit 모형을 대중교통통행배정기법으로 구축한다.

Keywords

References

  1. Azevedo J. A., Costa M. E. O. S., Madeira J. J. E. R. S., Martins E. Q. V. (1993), An Algorithm for the Ranking of Shortest Paths, European Journal of Operational Research, 69, 97-106. https://doi.org/10.1016/0377-2217(93)90095-5
  2. Bellman R. (1957), Dynamic Programming, Princeton University Press, Princeton, New Jersey.
  3. Cascetta E., Agostino N., Francesco R., Antonino V. (1996) A Modified Logit Route Choice Model Overcoming Path Overlapping Problems, Specification and Some Calibration Result for Interurban Networks, Transportation and Traffic Theory, Pergamon, 697-711.
  4. Chen P., Nie Y. (2013), Bicriterion Shortest Path Problem With A General Nonadditive Cost, Social and Behavioral Sciences, 80, 553-575.
  5. Dial R. B. (1971) A Probabilistic Multi-Path Traffic Assignment Algorithm Which Obviates Path Enumeration, Transportation Research, 5, 83-111. https://doi.org/10.1016/0041-1647(71)90012-8
  6. Gabriel S., Bernstein D. (1997), The Traffic Equilibrium Problem With Nonadditive Path Costs, Transportation Science, 20(5), 337-348.
  7. Jung D., Chang J. S. (2014), Evaluation of the Performance of Transit Assignment Algorithms for Urban Rail Networks, Journal of the Korean Society for Railway, 17(6), 433-442. https://doi.org/10.7782/JKSR.2014.17.6.433
  8. Lee M. (2015), Transportation Network Models and Algorithms Considering Directional Delay and Prohibitions for Intersection Movement, Ph.D. Thesis, University of Wisconsin at Madison.
  9. Lim Y. T. (2003) Solution Algorithms for Logit Stochastic User Equilibrium Assignment Model, J. Korean Soc. Transp., 21(2), Korean Society of Transportation, 95-105.
  10. Martins E. Q. V. (1984), An Algorithm for Ranking Paths that May Contain Cycles, European Journal of Operational Research, 18, 123-130. https://doi.org/10.1016/0377-2217(84)90269-8
  11. Pollack M. (1961), The Kth Best Route Through A Network, Operations Research.
  12. Sheffi Y. (1985) Urban Transportation Networks: Equilibrium Analysis With Mathematical Programming Methods, Prentice-Hall, New York.
  13. Sheffi Y., Powell W. B. (1982) An Algorithm for the Equilibrium Assignment Problem With Random Link Times, Networks, 12(2), 191-207. https://doi.org/10.1002/net.3230120209
  14. Shier R. D. (1979), On Algorithm From Finding the K Shortest Paths in A Network, Networks, 9, 195-214. https://doi.org/10.1002/net.3230090303
  15. Shin S. I., Baek N. C., Nam D. H. (2016), A Heuristic Optimal Path Search Considering Cumulative Transfer Functions, Journal of Intelligent Transportation Systems, 15(3), 60-67.
  16. Yang Y., Zhang X., Meng Q. (2004), Modeling Private Highways in Networks With Entry-Exit Based Toll Charges, Transportation Research B, 38, 191-213. https://doi.org/10.1016/S0191-2615(03)00050-X
  17. Yen J. Y. (1971), Finding the K Shortest Loopless Paths in A Network, Management Science, 17, 711-715.

Cited by

  1. 비가산성 경로비용을 반영한 링크표지기반 Node-to-Link 최적경로탐색 vol.18, pp.5, 2016, https://doi.org/10.12815/kits.2019.18.5.91