The mathematical approach for train conflict detection and resolution : In case autonomous decentralized traffic control for heavy traffic station

초록

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, and shuntings of many trains from different lines and shunting trains 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.

제목
The mathematical approach for train conflict detection and resolution : In case autonomous decentralized traffic control for heavy traffic station
저자
김경민; 홍순흠; 김영훈; 박범환
발행일
2008-05-19
학회명
WCRR 2008