차량소요계획을 위한 열거알고리즘

An Enumeration Algorithm for the Rolling Stock Requirement Plan

김성호^* · 김동희^** · 최태성^***

Kim, Seongho · Kim, Dong-Hee · Choi, Tae-Sung

*   인하대학교 경영대학 조교수

**  한국철도기술연구원 선임연구원

*** 인하대학교 경영대학 교수

ABSTRACT

A routing is the path that an actual trainset follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.

계산실험결과

열차시각표 파일의 field설명 : field1 (차종), field2 (열차번호), field3 (출발역), field4 (도착역), field5 (출발시), field6 (출발분), field7 (도착시), field8 (도착분), field9 (운행거리)