Article ID: | iaor2009501 |
Country: | Germany |
Volume: | 13 |
Issue: | 2 |
Start Page Number: | 189 |
End Page Number: | 207 |
Publication Date: | Jun 2005 |
Journal: | Central European Journal of Operations Research |
Authors: | Clausen Jens, Larsen Jesper, Lve Michael, Srensen Kim Riis |
Keywords: | heuristics, programming: assignment |
The Dedicated Aircraft Recovery Problem (DARP) 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 dedicated 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 describes an effective method to solve DARP. A heuristic is implemented, which is able to generate feasible revised flight schedules of good quality in less than 10 seconds when applied to real flight schedules with disruptions from British Airways.