Generation methods of neighborhood schedules for practical train crew scheduling problems using tabu search

摘要

This paper proposes generation methods of neighborhood schedules for crew scheduling problems (CSPs) in order to apply to practical problems. The proposed methods can give diversification to neighborhood schedules and generate an appropriate schedule. The results indicate that the proposed methods can drastically reduce the objective function values for the actual timetable than the conventional method.