Advanced search

A hybrid scatter search for the airline crew rostering problem

Broos Maenhout (UGent) and Mario Vanhoucke (UGent)
Author
Organization
Abstract
An airline company needs to assign a roster to all necessary crew members such that the airline is able to operate all the duties of its flight schedule. In our problem formulation, the objective is to assign a personalized roster to each regular crew member minimizing the overall operational costs while ensuring impartiality among crew members and maximizing the social quality of the schedule. To that purpose, we present a hybrid scatter search algorithm which encompasses different complementary meta-heuristic crew scheduling crossover operators and local search methods. Detailed computational experiments are presented and comparison is made with a branch-and-price procedure and a variable neighborhood search.
Keywords
Airline applications, Rostering, Metaheuristics

Citation

Please use this url to cite or link to this publication:

Chicago
Maenhout, Broos, and Mario Vanhoucke. 2007. “A Hybrid Scatter Search for the Airline Crew Rostering Problem.” In 22st European Conference on Operational Research (EURO XXII), Abstracts.
APA
Maenhout, B., & Vanhoucke, M. (2007). A hybrid scatter search for the airline crew rostering problem. 22st European conference on Operational Research (EURO XXII), Abstracts. Presented at the 22st European conference on Operational Research (EURO XXII-2007).
Vancouver
1.
Maenhout B, Vanhoucke M. A hybrid scatter search for the airline crew rostering problem. 22st European conference on Operational Research (EURO XXII), Abstracts. 2007.
MLA
Maenhout, Broos, and Mario Vanhoucke. “A Hybrid Scatter Search for the Airline Crew Rostering Problem.” 22st European Conference on Operational Research (EURO XXII), Abstracts. 2007. Print.
@inproceedings{1147877,
  abstract     = {An airline company needs to assign a roster to all necessary crew members such that the airline is able to operate all the duties of its flight schedule. In our problem formulation, the objective is to assign a personalized roster to each regular crew member minimizing the overall operational costs while ensuring impartiality among crew members and maximizing the social quality of the schedule. To that purpose, we present a hybrid scatter search algorithm which encompasses different complementary meta-heuristic crew scheduling crossover operators and local search methods. Detailed computational experiments are presented and comparison is made with a branch-and-price procedure and a variable neighborhood search.},
  author       = {Maenhout, Broos and Vanhoucke, Mario},
  booktitle    = {22st European conference on Operational Research (EURO XXII), Abstracts},
  keywords     = {Airline applications,Rostering,Metaheuristics},
  language     = {eng},
  location     = {Prague, Czech Republic},
  title        = {A hybrid scatter search for the airline crew rostering problem},
  year         = {2007},
}