Disruption Management for an Airline - Rescheduling of Aircraft

Authors:
Michael Løve;Kim Riis Sørensen;Jesper Larsen;Jens Clausen
Affiliations:
-;-;-;-
Venue:
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Year:
2002

Citing 1
Cited 2

Variable neighborhood search

Computers and Operations Research

Solving the flight perturbation problem with meta heuristics

Journal of Heuristics
Extending the RCPSP for modeling and solving disruption management problems

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Aircraft Recovery Problem (ARP) involves decisions concerning aircraft to flight assignments in situations where unforeseen events have disrupted the existing flight schedule, e.g. bad weather causing flight delays. The aircraft recovery problem aims to recover these flight schedules through a series of reassignments of aircraft to flights, delaying of flights and cancellations of flights. This article demonstrates an effective method to solve ARP. A heuristic is implemented, which is able to generate feasible revised flight schedules of a good quality in less than 10 seconds. This article is a product of the DESCARTES project, a project funded by the European Union between the Technical University of Denmark, British Airways and Carmen (see [1]).