DOI QR코드

DOI QR Code

An Efficient Model and Algorithm to Allocate Rail Track Capacity Considering Line Plans

노선 계획을 고려한 철도 선로 용량 배분 최적화 모형 및 해법

  • Park, Bum Hwan (Department of Railroad Management and Logistics, Korea National University of Transportation) ;
  • Chung, Kwang Woo (Department of Railroad Operation System Engineering, Korea National University of Transportation)
  • Received : 2014.09.25
  • Accepted : 2014.12.12
  • Published : 2014.12.31

Abstract

Recently, there is has been significant interest in the allocation systems of rail track capacities with considerations of the multiple train operating companies. The system indicates both a well-defined procedure and an algorithmic method to allocate the rail track capacities. Among them, this study considers the algorithmic method to derive the optimal timetable for the trains, which the companies propose together with their arrival and departure times at each station. However, most studies have focused on the adjustment of the departure and arrival times without conflicts, which could result in incompatible allocations with the line plan, which would result in an insufficient number of trains on each line to satisfy the demands. Our study presents a new optimization model and algorithm for the allocation problem in order to reflect the predetermined line plan. Furthermore, we provide the experimental results that were applied to the Korean high-speed railway network including the Suseo lines.

최근 복수의 철도 운송 사업자를 고려한 효율적인 선로 용량 할당 체계에 대한 관심이 증대하고 있다. 선로 용량 배분 체계란 제한된 선로 용량을 복수의 철도 운송 사업자들에게 그들이 원하는 열차를 배분하는 일련의 절차 및 방법론을 말하는데, 본 논문은 철도 운송 사업자가 제안한 열차들의 출발시간, 정차 시간 등을 조정하여 시설 관리자가 추구하는 목적에 가장 부합하는 조정된 스케줄을 생성해내는 최적화 모형 및 해법을 다룬다. 이 모형과 관련한 기존 연구들은, 열차간의 경합 조건만을 제약식으로 설정하여, 특정 노선에 투입되는 열차들이 경합 조건 때문에 기존에 계획된 노선별 열차 운행 횟수를 보장할 수 없는 한계를 갖고 있다. 본 연구에서는 노선별 열차 운행 횟수를 고려함과 동시에 열차간 경합 조건을 반영한 새로운 최적화 모형 및 이에 대한 해법을 제시한다. 이 해법을 이용하여, 수서발 고속열차와 기존 고속열차 운행 전 구간에 대한 최적의 선로 용량 할당 계획을 제시한다.

Keywords

References

  1. B.H. Park (2013) Some Considerations for Efficient Railway Track Capacity Allocation under the Competitive Environment, Journal of Korean Industrial Economics and Business 5(3), pp.1-13.
  2. DB (2013) Network Statement 2013, DB Netz AG
  3. P.J. Brewer, C.R. Plott (1996) A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroads tracks, International Journal of Industrial Organization, 14(6), pp. 857-886. https://doi.org/10.1016/0167-7187(96)01014-4
  4. J.E. Nilsson (1999) Allocation of track capacity : Experimental evidence on the use of priority auctioning in the railway industry, International Journal of Industrial Organization, 17(8), pp. 1139-1162. https://doi.org/10.1016/S0167-7187(99)00016-8
  5. R. Borndorfer, M. Grotschel, S. Lukac, K. Mitusch, T. Schlechte, S. Schultz, A. Tanner (2005) An Auctioning Approach to Railway Slot Allocation, ZIB-Report 05-45.
  6. S.G. Klabes (2010) Algorithmic Railway Capacity Allocation in a Competitive European Railway Market, Ph.D Thesis, RWTH Aachen.
  7. U. Brannlund, P.O. Lindberg, A. Nou, J.E. Nilsson (1998) Railway Timetabling Using Lagrangian Relaxation, Transportation Science, 32(4) , pp. 358-369. https://doi.org/10.1287/trsc.32.4.358
  8. V. Cacchiani, A. Caprara, P. Toth (2010) Scheduling Extra Freight Trains on Railway Networks, Transportation Research Part B, 44, pp.215-231. https://doi.org/10.1016/j.trb.2009.07.007
  9. A. Caprara, M. Fischetti, P. Toth (2001) Modeling and Solving the Train Timetabling Problem, Operations Research, 50(5), pp. 851-861.
  10. V. Cacchiani, A. Caprara, P. Toth (2008) A Column Generation Approach to Train Timetabling on a Corridor, 4OR, 6, pp. 125-142. https://doi.org/10.1007/s10288-007-0037-5
  11. R. Borndorfer, T. Schlechte (2007) Models for Railway Track Allocation, Proceeding of 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2007), pp. 62-78.
  12. B.H. Park, S.H. Hong, C.S. Kim (2012) An Optimization Model for Railway Slot Allocation Reflecting the Operational Policies, Journal of the Korean Society for Railway, 15(5), pp. 524-530. https://doi.org/10.7782/JKSR.2012.15.5.524
  13. B.H. Park, S.H. Hong (2013) A column-generation based approach to developing an optimized railway timetable using time-space network, Proceeding of the Korean Society for railway conference, pp.160-167.
  14. C. Chun, S. Chung and B. Namkung (2012) Development of Optimal Train Operation System in Bottle-neck Section According to the Opening of High Speed Railway in Seoul Metropolitan Area, Journal of the Korean Society for Railway, 15(6), pp.631-637. https://doi.org/10.7782/JKSR.2012.15.6.631
  15. T. Schlechte (2012) Railway Track Allocation: Models and Algorithms, Ph.D Thesis, Technischen Universitat Berlin.
  16. B.H. Park, Y.I. Seo, S.P. Hong, H.L. Rho (2013) Column Generation Approach to Line Planning with Various Halting Patterns - Application to the Korean High-speed Railway, Asia-Pacific Journal of Operational Research, 30(4), pp.1-19.
  17. Korail (2012) A Study on the mid-term and long-term Forecast of KTX , KORAIL Research Institute.