Metaheuristics approach to the aircrew rostering problem |
| |
| Authors: | Panta Lučić Dušan Teodorović |
| |
| Affiliation: | (1) CSSI, Inc., 400 Virginia Avenue SW, Suite 710, Washington, DC 20024, USA;(2) Department of Civil and Environmental Engineering, Virginia Polytechnic Institute and State University, Blacksburg, USA;(3) Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia |
| |
| 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. |
| |
| Keywords: | Airlines Aircrew rostering Simulated annealing Tabu search Genetic algorithms |
| 本文献已被 SpringerLink 等数据库收录！ |
|
