An Enumeration Algorithm for the Rolling Stock Requirement Plan

철도차량소요계획을 위한 열거알고리듬

  • 김성호 (인하대학교 경영대학) ;
  • 김동희 (한국철도기술연구원 운영 정보시스템연구팀) ;
  • 최태성 (인하대학교 경영대학)
  • Published : 2004.06.01


A routing is the path that an actual train set 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.