• Journal of Intelligence and Information Systems
• /
• v.5 no.1
• /
• pp.81-93
• /
• 1999

열차운용이라 함은 열차의 출발과 도착 시간을 나타내는 열차번호들에 여러 객차들로 구성된 하나의 열차를 일컫는 열차 다이아(train DIAgram)들을 여러 제약조건을 고려하여 배정함으로서 열차 번호가 열차 다이아에 의해 운행될 수 있도록 열차운용 다이아를 작성하는 작업이다. 이러한 작업을 다수의 스케줄링 전문가들이 스케줄링 할 경우 많은 시간과 노력을 감수해야만 하며, 전문가의 실수로 인해 오류가 발생할 가능성이 있다. 뿐만 아니라, 복잡한 스케줄의 특성상 운용 비용이 적게 드는 스케줄 결과를 이끌어 내기가 어렵다. 본 연구에서는 열차운용 시스템을 구성하기 위해서 현재 철도청에서 사용하는 시스템을 분석하여, 열차운용 스케줄링 시스템을 모델링 하였고, 이에 모델링한 시스템을 바탕으로 CSP(Constraint Satisfaction Problems: 제약조건 만족 문제) 해결 기법을 적용하여 계산시간 및 계산 복잡성 면에서 효율적인 스케줄링을 행함과 동시에 비용 최적 함수를 적용함으로서 열차 운용 비용이 최소가 되는 열차운용 스케줄링 시스템을 구현하였다. 더불어, 시스템모델 검증과정의 하나로 과거 운용되었던 새마을호 열차시간표와 열차 데이터를 사용하여 열차 운용 및 운용 비용의 최적화를 실험하였다.

• Journal of the Korean Society for Railway
• /
• v.17 no.4
• /
• pp.313-319
• /
• 2014

Additional train scheduling is often required to increase the capacity of transporting passengers or freight. In most previous studies on scheduling additional trains, operation time of the added train is designated first; and then the train operation feasibility is examined. However, it is often difficult to apply this approach to domestic trains because the density of the railroad network in Korea is high and various types of trains are in use. Moreover, for freight trains, it is even more challenging because the delay is accumulated due to lower priority whenever a freight train and a passenger train contend for a common segment of rail. In this paper, we address the additional train scheduling problem which entails finding a feasible schedule for an additional train having a fixed departure time or departure time windows. The problem is modeled as a mixed integer programming and a column generation technique is used to solve it.

• Journal of the Korean Society for Railway
• /
• v.18 no.2
• /
• pp.149-156
• /
• 2015

It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2005.12a
• /
• pp.162-168
• /
• 2005

최근 새로운 수송망 설계를 통한 물류비 절감이 물류 관련 업체의 큰 이슈가 되고 있다. 하지만 일반적으로 행해지고 있는 수송망 설계는 대부분이 선박, 항공기, 열차 각각에 대해서만 고려되었으며 여러 가지 운송모드를 고려하는 복합운송망 설계는 극히 일부에 지나지 않았다. 이는 선박, 항공기, 열차를 모두 고려하여 수송망을 설계하기 위해서 필요한 운항 스케줄 정보가 산재되어 있어 복합운송망을 설계하기에는 많은 어려움이 따랐기 때문이다. 이러한 문제점을 해결하기 위해서는 모든 운송모드의 스케줄 데이터를 통합하여 제공할 수 있는 통합 데이터베이스 구축이 필요하다. 본 연구에서는 선박, 항공기, 열차에 대한 스케줄 정보를 제공하고 있는 정보원들을 분석하고 데이터 제공 방식을 조사하여 이를 모두 수용함으로써 데이터를 실시간으로 수집할 수 있는 에이전트 시스템의 설계를 수행하였다.

• Journal of the Korean Society for Railway
• /
• v.15 no.5
• /
• pp.524-530
• /
• 2012

Recently, open access policy to railway operation has been widely discussed. Compared to the case of Korea, European countries have dealt with this topic over a few decades. The competition on railway slots incurs an important technological problem about how to optimally allocate railway slots requested from RUs to them. In other words, the authority should be able to coordinate the timetables requested from RUs in the non-discriminatory manner. Related with the coordination, compared to the other European countries, which have done many studies and experiments especially on auction mechanisms, Korean railway has paid less attention to this topic and there have not been any related studies. Our study analyses the state-of-the-arts about the railway slot allocation especially focusing on the auction mechanisms and the associated optimization problems. And we suggest a new railway slot allocation mechanism and related optimization model reflecting the adjustment within the tolerance and the operational policies between railway undertakings.

• 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 the Korean Society for Railway
• /
• v.18 no.6
• /
• pp.619-629
• /
• 2015

The train conflict resolution problem refers to an adjustment of the train operation schedule in order to minimize the delay propagation when a train conflict is predicted or when a train conflict occurs. Previous train studies of train conflict resolutions are limited in terms of the size of the problems to be solved due to exponential increases in the variables. In this paper, we propose a train conflict resolution model using a time-space network to solve the train conflict situation in the operational phase. The proposed model adjusts the size of the problem by giving only the dwell tolerance in the time-space network only for stops at the station after a train conflict. In addition, the proposed model can solve large problems using a path flow variable. The study presents a train delay propagation analysis and experimental results of train conflict resolution assessments as well using the proposed model.

• Journal of Korean Society of Transportation
• /
• v.31 no.2
• /
• pp.80-89
• /
• 2013

The purpose of this research is to optimize the line planning of the intercity passenger railway. In this study, the line planning problem has been formulated into a mixed integer programming by minimizing both user costs (passenger's total travel time) and operator costs (operation, maintenance and vehicle costs) with multiple train types. As a solution algorithm, the branch-and-bound method is used to solve this problem. The change of travel demand, train speed and the number of schedules have been tested through sensitivity analysis. The optimal stop-schedules and frequency as well as system split with respect to each train type have been found in the case study of Kyoung-bu railway line in Korea. The model and results of this research are useful to make a decision for railway operation strategy, to analyze the efficiency of new railway systems and to evaluate the social costs of users and operators.

• Journal of the Korean Society for Railway
• /
• v.12 no.2
• /
• pp.267-275
• /
• 2009

Max-plus algebra is a nonlinear system comprised of two operations, maximization (max) and addition (Plus), which are corresponding to the addition and the multiplication in conventional algebra, respectively. This methodology is applicable to many discrete event systems containing the state transition with the maximization and addition operation. Timetable with connection is one of such systems. We present the method based on max-plus algebra, which can make up timetable considering transfer and analyse its stability and robustness. In this study, it will be shown how to make up the timetable of the urban train and analyse its stability using Max-Plus algebra.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.6
• /
• pp.1337-1345
• /
• 2009

In the railway, the delay of a train may affect the schedule of other trains. Hence, the timetable management activity involving overtaking and transferring becomes an important issue. The timetable rescheduling is the conflict resolution of the disrupted schedule and a matter of deciding the sequence of moves among trains and the place for meeting. In Korea, there are few cases where operations research models were applied to railway timetable rescheduling problem in consideration of the transfer between Korea Train eXpress (KTX) trains and conventional trains. Hence, we present a mathematical approach that can minimize the total delay of the whole trains secondly. We applied the model to the exemplary section of a double-line track, the Gyung-Boo Line, and it is confirmed that the mathematical model could effectively address the transfer service as well as the complicated railway conflicts of Gyung-Boo Line.