Constraint-Specific Recovery Networks for Solving Airline Recovery Problems

In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework that allows the consideration of operational constraints within a Column Generation (CG) scheme. We introduce the general concept of recovery network, generated for each individual unit of the problem, and show how unitspecific constraints are modeled using resources. We fully illustrate the concept by solving the Aircraft Recovery Problem (ARP) with maintenance planning, we give some insights into applying the model to the Passenger Recovery Problem (PRP) and we present computational results on real data. keywords: Airline scheduling, Recovery algorithms, Column generation


 Record created 2009-06-15, last modified 2018-09-13

EggeSalaBier08_ARP_2 - Download fulltextPDF
EggeSalaBier08_ARP - Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
(Not yet reviewed)