New Heuristic Algorithms for the Crew Scheduling Problem

@inproceedings{Cavique1999NewHA,
  title={New Heuristic Algorithms for the Crew Scheduling Problem},
  author={Lu{\'i}s Cavique and C{\'e}sar Rego and Isabel H. Themido},
  year={1999}
}
In this paper we describe the implementation of two Tabu search based algorithms for the Crew Scheduling Problem (CSP). The problem is a standard CSP, for an urban transport problem, formulated as the minimal number of duties necessary to cover a predefined timetable under contractual rules which excludes the possibility of resorting to extra-time. The initial solution is obtained with a run-cutting algorithm. Two algorithms are proposed to improve that initial solution. In the first algorithm… CONTINUE READING