A large neighbourhood search approach to airline schedule disruption recovery problem

Kam K.H. Ng, K. L. Keung, C. K.M. Lee, Y. T. Chow

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

The occurrence of unplanned aircraft shortages and disruption of flight schedules during the day-to-day operations of airlines is inevitable. When equipment failure causes unsafe flight, the aircraft will be grounded or temporarily delayed when the weather shuts down the airport or the required flight crew is unavailable. Real-time decisions must be made to reduce revenue loss, passenger inconvenience and operating costs by reallocating available aircraft and cancelling or delaying flights. A large neighbourhood search algorithm is used in this research to construct a feasible and efficient solution to the airline schedule disruption recovery problem. We aim to reduce the aircraft turn-around times, including total delay time, the number of flight adjustments and the number of flights delayed for more than one hour, as an objective function. Ten real-life cases are solved, and the proposed approach yields an approximate 50% improvement in solution quality.

Original languageEnglish
Title of host publicationIEEE International Conference on Industrial Engineering and Engineering Management 2020
PublisherIEEE Computer Society
Pages600-604
Number of pages5
ISBN (Electronic)9781538672204
DOIs
Publication statusPublished - 14 Dec 2020

Publication series

NameIEEE International Conference on Industrial Engineering and Engineering Management
Volume2020-December
ISSN (Print)2157-3611
ISSN (Electronic)2157-362X

Keywords

  • Airline recovery
  • Fleet assignment
  • Large neighbourhood search
  • Passenger itineraries

ASJC Scopus subject areas

  • Business, Management and Accounting (miscellaneous)
  • Industrial and Manufacturing Engineering
  • Safety, Risk, Reliability and Quality

Cite this