지하철 일간승무계획문제의 정수계획해법

초록

This paper considers subway crew scheduling problem. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the subway crew scheduling problem in a reasonable time, though the optimality of the solution is not guaranteed. We develop an algorithm that solves the columm-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational result for a real instance is reported.

키워드