Metaheuristics approach to the aircrew rostering problem

Metaheuristics approach to the aircrew rostering problem

0.00 Avg rating0 Votes
Article ID: iaor20083265
Country: Germany
Volume: 155
Issue: 1
Start Page Number: 311
End Page Number: 338
Publication Date: Nov 2007
Journal: Annals of Operations Research
Authors: ,
Keywords: personnel & manpower planning, heuristics: tabu search, optimization: simulated annealing, heuristics: genetic algorithms
Abstract:

The solution of the aircrew-scheduling problem is represented by a set of rotations developed from a given set of flight segments. Once the set of rotations to be made by aircrew members has been determined, the air carrier must solve the aircrew rostering problem that entails the monthly assignment of aircrew members to planned rotations. This paper attempts to solve the aircrew rostering problem, thus constructing personalized monthly schedules using Simulated Annealing, Genetic Algorithms, and Tabu Search techniques. The developed models are tested on numerical examples that consist of constructing schedules for pilots. Dimensions of the considered examples are characteristic of small and medium-sized airlines.

Reviews

Required fields are marked *. Your email address will not be published.