Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A pragmatic algorithm for the Minimum Railway Stock Maintenance Routing Problem

최소차량운용문제에 대한 실용적 해법

  • 홍성필 (서울대학교 산업공학과) ;
  • 김경민 (한국철도기술연구원 철도정책물류연구본부) ;
  • 이경식 (한국외국어대학교 산업정보시스템공학부) ;
  • 박범환 (한국철도기술연구원 철도정책물류연구본부) ;
  • 홍순흠 (한국철도기술연구원 철도정책물류연구본부)
  • Published : 2006.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords