• 한국철도학회논문집
• /
• 제15권1호
• /
• pp.88-95
• /
• 2012

현재 도시철도의 열차운행계획 수립과정은 열차 운용에 필요한 철로의 구조, 역사 내 철로 구조, 차량 정비시간 등 다양한 제약조건을 고려하여 이루어 지기 때문에, 매우 복잡한 구조를 가지게 되는 문제점이 있다. 이러한 문제점들로 인하여 다양한 열차운행 시간표(Time-Table)에 대한 비교 분석에 큰 어려움이 있다. 본 연구는 도시철도 운행계획 수립의 효율성 및 체계성을 제고하기 위하여, 철도 운행계획 수립 과정 중 수립 가능한 다양한 차량 시간표(Time-Table)의 기대효과를 열차다이아 작성 이전에 비교분석하여 가장 효과적인 차량 투입계획 및 운행일정을 선정할 수 있도록 하는 방법론을 제시하고자 한다. 본 연구에서는 열차 운행 시간표(Time-Table)을 분석하기 위하여 Line-Blocking 이론을 활용하였으며 광역철도 4호선중 사당~안산 구간을 대상으로 사례 분석하였다.

• 한국산학기술학회논문지
• /
• 제15권6호
• /
• pp.3851-3857
• /
• 2014

화물열차를 이용하는 화주의 화물열차 수요는 기간에 따라 변동성이 크나 화주의 요구에 따라 화물열차 스케줄을 조정하거나 증편하는 것은 상당한 시간이 소요된다. 그 이유는 해의 범위가 폭발적으로 증가하고 선로용량, 운영규정, 기존열차와의 경합 등을 고려해야하기 때문이다. 그러나 국내 철도 운영사에서 화물열차 증편일정 조정 업무는 지속적으로 발생하고 있으며, 담당자의 경험적인 역량으로 해결해 왔다. 본 논문에서는 증편되는 화물열차의 운행 가능성을 판단하고, 증편요청열차들이 기존 열차의 운행시간 지연을 최소로 하면서 가급적 많은 추가 스케줄을 생성할 수 있는 모형을 제시한다. 제시된 모형은 시공간 네트워크로 문제를 표현하고 다중상품 흐름문제로 모델링하여 열생성 기법으로 해를 구하였다. 제시된 모형으로 3가지 실험을 수행하였으며, 복잡한 문제의 경우에도 계산시간상 실용적임을 확인하였다.

• 산업경영시스템학회지
• /
• 제13권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.

• 한국철도학회논문집
• /
• 제10권2호
• /
• 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.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2008년도 추계학술대회 논문집
• /
• 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.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• 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.

• 대한교통학회지
• /
• 제8권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.

• 전기학회논문지
• /
• 제59권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.

• 한국철도학회논문집
• /
• 제8권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.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2008년도 추계학술대회 논문집
• /
• 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.