A hybrid ant algorithm for the airline crew pairing problem

BRODERICK CRAWFORD LABRIN, Carlos Castro, Eric Morifroy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

This article analyzes the performance of Ant Colony Optimization algorithms on the resolution of Crew Pairing Problem, one of the most critical processes in airline management operations. Furthermore, we explore the hybridization of Ant algorithms with Constraint Programming techniques. We show that, for the instances tested from Beasley's OR-Library, the use of this kind of hybrid algorithms obtains good results compared to the best performing metaheuristics in the literature.

Original languageEnglish
Title of host publicationMICAI 2006
Subtitle of host publicationAdvances in Artificial Intelligence - 5th Mexican International Conference on Artificial Intelligence, Proceedings
Pages381-391
Number of pages11
StatePublished - 1 Dec 2006
Event5th Mexican International Conference on Artificial Intelligence, MICAI 2006: Advances in Artificial Intelligence - Apizaco, Mexico
Duration: 13 Nov 200617 Nov 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4293 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Mexican International Conference on Artificial Intelligence, MICAI 2006: Advances in Artificial Intelligence
CountryMexico
CityApizaco
Period13/11/0617/11/06

Keywords

  • Ant colony optimization
  • Constraint programming
  • Crew pairing optimization
  • Hybrid algorithm
  • Set partitioning problem

Fingerprint Dive into the research topics of 'A hybrid ant algorithm for the airline crew pairing problem'. Together they form a unique fingerprint.

Cite this