A large neighbourhood search heuristic for the aircraft and passenger recovery problem
- 326 Downloads
This paper introduces a large neighbourhood search heuristic for an airline recovery problem combining fleet assignment, aircraft routing and passenger assignment. Given an initial schedule, a list of disruptions, and a recovery period, the problem consists in constructing aircraft routes and passenger itineraries for the recovery period that allow the resumption of regular operations and minimize operating costs and impacts on passengers. The heuristic alternates between construction, repair and improvement phases, which iteratively destroy and repair parts of the solution. The aim of the first two phases is to produce an initial solution that satisfies a set of operational and functional constraints. The third phase then attempts to identify an improved solution by considering large schedule changes while retaining feasibility. The whole process is iterated by including some randomness in the construction phase so as to diversify the search. This work was initiated in the context of the 2009 ROADEF Challenge, a competition organized jointly by the French Operational Research and Decision Analysis Society and the Spanish firm Amadeus S.A.S., in which our team won the first prize.
KeywordsAirline recovery Fleet assignment Aircraft routing Passenger itineraries Large neighbourhood search
MSC classification (2000)90C27
Unable to display preview. Download preview PDF.
- Ball M, Barnhart C, Nemhauser GL, Odoni A (2007) Air transportation: irregular operations and control. In: Barnhart C, Laporte G (eds) Handbooks in operations research and management science, vol 14. Elsevier, Amsterdam, pp 1–61Google Scholar
- Jozefowiez N, Mancel C, Mora-Camino F (2010) A heuristic approach based on shortest path problems for integrated flight, aircraft, and passenger rescheduling under disruptions. LAAS technical report, Université de ToulouseGoogle Scholar
- Mansi R (2009) Approches hybrides pour des variantes du sac à dos et applications. Ph.D. thesis, Université de Valenciennes, FranceGoogle Scholar
- Mansi R, Wilbaut C, Hanafi S, Clautiaux F (2009) Combining oscillation heuristic and mathematical programming for disruption management in the airline industry. To appear in Proceedings of the VIII metaheuristic international conference (MIC), HamburgGoogle Scholar
- Palpant M, Boudia M, Robelin C-A, Gabteni S, Laburthe F (2009) ROADEF 2009 challenge: disruption management for commercial aviation. Working paper, Amadeus S.A.S., Operations Research Division, Sophia Antipolis, FranceGoogle Scholar
- Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems In: CP-98 (4th international conference on principles and practice of constraint programming), Lecture Notes in Computer Science, vol 1520. Springer, Berlin, pp 417–431Google Scholar