An Algorithm for detection and Resolution of Train Conflicts Occurring Within Station

역내 열차 경합 검지 및 해소를 위한 수리 모형 및 해법

  • 박범환 (한국철도대학, 철도경영정보과) ;
  • 김경민 (한국철도기술연구원 철도정책물류연구본부) ;
  • 홍순흠 (한국철도기술연구원 철도정책물류연구본부) ;
  • 김영훈 (한국철도기술연구원 철도정책물류연구본부)
  • Published : 2007.04.30

Abstract

In large station with high density traffic, trains can be hardly controlled by CTC but by station dispatcher because CTC has difficulties in monitoring all states of affairs happening within each station such as departures, arrivals of many trains from different lines and shunting of trains to move between yards and platforms, etc. Therefore the station's dispatcher has to make quick decision about how to reschedule the times and routes for all the trains scheduled within a specific time window. And such decision becomes harder when an unexpected delay occurs because a delay occurring in a train propagates other trains as time goes on. Generally, it is called the conflict detection and resolution to adjust beforehand the distorted schedule due to a delay to original schedule. Our research is different from the state of the arts in that ours determines simultaneously the routes and the times of arrival and departure of trains, although others do only the arrival and departure time of the trains without considering the alternative routes and shunting of the station. This study suggests a mathematical approach for how to detect in advance and resolve efficiently the conflicts occurring within a station and it will be shown how to reduce delay using our approach by means of analysing the schedule of ChyungRyangRi station.

Keywords

References

  1. 한국철도기술연구원, (2006), '대형․고밀도 철도역 자동운행제어시스템 개발-3차년도 연차 보고서'
  2. Kitahara, F., Kera, K. and Bekki, K. (2000), 'Autonomous Decentralized Traffic Management System', Proceedings of International Workshop on Autonomous Decentralized Systems, IEEE, pp.87-91
  3. Higgins, A., Kozan, E. and Ferreira, L. (1996), 'Optimal scheduling of trains on a single line track', Transportation Research Part B : Methodological, Vol. 30, No.2, pp.147-161 https://doi.org/10.1016/0191-2615(95)00022-4
  4. 김재희, 오석문, 홍순흠, (2005), '단선구간 열차경합해소 문제를 위한 수리계획 모형의 기본설계', 한국철도학회논문집, 제8권 4호, pp.314-320
  5. Mascis, A. , Pacciarelli, D. and Pranzo, M. (2004), 'Scheduling Models for Short-term Railway Traffic Optimization', 9th International Conference on Computer-Aided Scheduling of Public Transport (CASPT)
  6. Kroon,L. G., Romeijn, H. E. and Zwaneveld, P. J. (1997), 'Routing trains through railway stations : complexity issues', European Journal of Operations Research, Vol 98, pp.485-498 https://doi.org/10.1016/S0377-2217(95)00342-8
  7. Zwaneveld, P. J., Kroon,L. G., and van Hoesel, San. P. M. (2001), 'Routing trains through a railway station based on a node packing model', European Journal of Operations Research, Vol 128, pp.14-33 https://doi.org/10.1016/S0377-2217(00)00087-4
  8. Lamma, E., Mello, P. and M. Milano, (1997), 'A distributed constraint-based scheduler, Artificial Intelligence in Engineering', Vol.11, pp.91-105 https://doi.org/10.1016/S0954-1810(96)00002-7
  9. Wolsey, L. A.(1999), Integer Programming, John Wiley and Sons, INC