• Journal of the Korean Society for Railway
• /
• v.15 no.1
• /
• pp.88-95
• /
• 2012

Presently, because making process of train service plan consist of various constraint condition, for example structure of track, structure of track in station, train maintenance time and others for considering to be necessary of train management, it has been had extremely complex structure problems. For these reasons, it has big problems to compare analysis for various train service time-table. A study suggest methodology to choice service the most effective schedule and plan of train put before comparative analysis on making train diamond picture's expected effect of established possible various train time-table in making process of train service schedule for improving effectiveness and organization of train service schedule establishment. A study uses Line-Blocking theory for analyzing train service time-table and analyze example for regional train Sadang to Ansan section in 4line.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.6
• /
• pp.3851-3857
• /
• 2014

Shippers' requests of freight trains vary with time, but generating an additional schedule of freight trains is not easy due to many considerations, such as the line capacity, operation rules, and conflicts with existing trains. On the other hand, an additional freight train schedule has been continuously requested and manually processed by domestic train operation companies using empirical method, which is time consuming. This paper proposes a model to determine the additional freight train schedule that assesses the feasibility of the added freight trains, and generates as many additional schedules as possible, while minimizing the delay of the existing schedules. The problem is presented using time-space network, modeled as multi-commodity flow problem, and solved using the column generation method. Three levels of experiment were conducted to show validity of the proposed model in the computation time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.111-117
• /
• 1990

This paper treats the problem to schedule for train with low transit priority so as to maximizing the number that can be sent during given time without interfering with the fixed schedule for train with high transit priority in a track. We transform the this problem into Time-Expanded Network without traverse time through application of Ford-Fulkerson Model, develop a TENET GENerator(TENETGEN) and obtain the data of TENET using developed TENETGEN. Finally, we seek the optimal solution to these data with Dinic's Maximal-Flow Algorithm and examine the availability of our procedures in personal computer.

• Journal of the Korean Society for Railway
• /
• v.10 no.2 s.39
• /
• pp.179-185
• /
• 2007

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.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.1132-1137
• /
• 2008

Automatic Operation based on ATO (Automatic Train Operation) is necessary for driverless Light Rail Transit business. When this kind of driverless LRT operation plan is made, TPS (Train Performance Simulation) is traditionally simulated at all-out mode and coasting mode based on manual operation. Commercial schedule speed equals to all-out speed minus $9{\sim}15%$ make-up margin. Coasting mode TPS simulation is also run at commercial schedule speed to calculate run time and energy consumption. But TPS based on manual operation should make an improvement on accuracy in case of driverless LRT operation Plan. In this paper, new fast mode TPS simulation using ATO pattern is proposed and show near actual ATO result. The actual ATO pattern can be accurately simulated with the introduction of 4 parameters such as commercial braking rate, jerk, station stop profile and grade converted distance. Normal mode TPS simulation for commercial schedule speed can be designed to have fast mode trip time plus 3 seconds/km margin recommended by korean standard LRT specification.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.25-32
• /
• 2006

Given a schedule of train to be routed by a Railway Stock, Railway Stock Routing Problem determine a sequence of train while satisfying turnaround time and maintenance restrictions. The objective is to minimize the Railway Stock during a week and each day simultaneously. And we prove that Railway Stock Routing Problem with maintenance restrictions is NP-hard. In this paper, we present two stage approaches that solve the Railway Stock Routing Problem in a reasonable time. In first stage we relax maintenance restrictions and formulate as a Min-cost-flow problem. Then, in the second stage, we attempt to satisfy maintenance restrictions using ours heuristic algorithm. We show the computational result of applying to an actual train schedule data.

• Journal of Korean Society of Transportation
• /
• v.8 no.2
• /
• pp.67-75
• /
• 1990

This paper treats the problem to schedule for trains with how transit priority so as to maximizing the number that can be sent during given time periods without interfering with the fixed schedule for train with high transit priority in a track. We transform the this problem into Time Expanded Network without traverse time through application of Ford and Fulkerson Model and construct the Enumeration Algorithm for solutions using TENET Generator (TENETGEN). Finally, we compare our algorithm with Dinic's Maximal-Flow Algorithm and examine the avaliability of our procedures in personal computer.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.1
• /
• pp.76-81
• /
• 2010

This paper describes the development of integrated simulator with GUI(Graphic User Interface) for traction power supply system. This simulator consists of a lot of calculation modules such as TPS, train time schedule, line constant, and power supply system analysis. Each module has input and output structure respectively. The algorithms of all modules have confirmed the validity to comparison with field test that is performed on both high speed railway line and conventional line.

• Journal of the Korean Society for Railway
• /
• v.8 no.4
• /
• pp.314-320
• /
• 2005

This paper is designed to help train dispatcher resolve railway conflicts in rent-time. We developed a mixed integer programming model to optimize the train schedule that determines the best overtaking or crossing positions, The objective of the model is to minimize the maximum lateness of the trains and reduce the total sum of the lateness, while satisfying the field constraints associated with the difference between passenger trains and freight trains, and the limited number of sidings. We applied the model on a portion of a single line track, Joong-Ang Line to ascertain the efficiency of the model, and showed how the model can be used to resolve the railway conflicts. The results indicates that our model can provide useful results in terms of optimal schedule for the test problem. This type of modeling approach would be useful for a train dispatcher to make a real-time railway conflict resolution.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.673-678
• /
• 2008

In crushed service areas of Metro railway lines, there are problems such as the buildup discontent, the irregular operation time and rotation of rolling stocks, caused by frequently occurred train delay. Train delay is affected by operation conditions or infrastructure capacities such as train schedule, line capacity, car rotation plan, shunting movements at origin and destination, and also by transport demand characteristics. Furthermore, a delay produce another delays and spread over the following trains. So it is not easy to build up a protection and recovery plan. In this research, we conduct experimental analysis study based on the real metro data, and as a result, present the relation between the traffic demand and the dwell time. And finally, propose future research themes for improving the operation efficiency of metro railways.