• Proceedings of the KSR Conference
• /
• 2002.05a
• /
• pp.128-134
• /
• 2002

This paper is to investigate adoptability of the genetic algorithm to the railway traffic conflict resolution problem. We categorize the problem in two cases, one is the specific-boundary case and the other is not. GA is may be used in the first case, but not for second case. For a sample problem, an GA is designed, and the GA is being compared with Ho's.

• Proceedings of the KSR Conference
• /
• 2004.06a
• /
• pp.1374-1378
• /
• 2004

Railway conflict detection and resolution problem (RCDRP) involves complicated field constraints that should be considered for practical service. In this paper, we address those constraints in brief. Particularly, following situations are addressed; (1) temporal change of network topology, (2) consideration of diverse conditions of track and train, for example, single/double tracks and passenger/freight service, (3) siding capacity limitation, (4) bidirectional sides used by both inbound and outbound trains, (5) regulation for passenger transfer service, (6) consideration of siding length, (7) Restriction on stopping before the track segment with steep slope.

• Proceedings of the KSR Conference
• /
• 2007.05a
• /
• pp.1466-1474
• /
• 2007

In large station with high density traffic, trains is hardly controlled by CTC but by station dispatcher because CTC has difficulties in monitoring all states of affairs happening within the station such as departs and arrivals of many trains from different lines and shunting trains between yards and platforms, etc. Therefore station dispatcher has to make quick decision about how to schedule all trains including trains to arrive and depart before long. And such decisions become harder when an unexpected delay occurs. This study suggests a mathematical model and algorithm about 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.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2736-2739
• /
• 2002

This paper is a study on the railway traffic conflict resolution(RTCR) using genetic algorithm(GA). Using GA, many complicated problems can be expressed in the easy way, and good solutions can be found in a reasonably short time. Due to the above merits, we focus to GA first of all. We express the sample RTCR problem and algorithm of Korean railroad using GA. From the Mark Ho's[2,3] results, we introduce a chromosome scheme in addition.