Metaheuristics approach to the aircrew rostering problem

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...

Full description

Saved in:
Bibliographic Details
Published inAnnals of operations research Vol. 155; no. 1; pp. 311 - 338
Main Authors Lucic, Panta, Teodorovic, Dusan
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.11.2007
Subjects
Air transportation industry
Air travel
Aircraft
Airline scheduling
Airlines
Airports
Costs
Customer services
Design
Genetic algorithms
Heuristic
Operations research
Pilots
Schedules
Scheduling
Simulation
Workforce planning
Working hours
Online AccessGet full text
ISSN0254-5330
1572-9338
DOI10.1007/s10479-007-0216-y

Cover

More Information
Summary: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. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-007-0216-y