A heuristic approach based on shortest path problems for integrated flight, aircraft, and passenger rescheduling under disruptions
Authors:
- 1 March 2013
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 64 (3) , 384-395
Abstract
International audienceIn this paper, we present a heuristic method to solve an airline disruption management problem arising from the ROADEF 2009 challenge. Disruptions perturb an initial flight plan such that some passengers cannot start or conclude their planned trip. The developed algorithm considers passengers and aircraft with the same priority by reassigning passengers and by creating a limited number of flights. The aim is to minimize the cost induced for the airline by the recovery from the disruptions. The algorithm is tested on real-life-based data, as well as on large-scale instances and ranks among the best methods proposed to the challenge in terms of quality, while being efficient in terms of computation timeKeywords
This publication has 11 references indexed in Scilit:
- Disruption management in the airline industry—Concepts, models and methodsComputers & Operations Research, 2010
- Airline crew scheduling from planning to operationsEuropean Journal of Operational Research, 2007
- Flight operations recovery: New approaches considering passenger recoveryJournal of Scheduling, 2006
- Itinerary-Based Airline Fleet AssignmentTransportation Science, 2002
- How Airlines and Airports Recover from Schedule Perturbations: A SurveyAnnals of Operations Research, 2001
- Airline Crew RecoveryTransportation Science, 2000
- The Operational Airline Crew Scheduling ProblemTransportation Science, 1998
- A Grasp for Aircraft Routing in Response to Groundings and DelaysJournal of Combinatorial Optimization, 1997
- The aircraft rotation problemAnnals of Operations Research, 1997
- Optimal dispatching strategy on an airline network after a schedule perturbationEuropean Journal of Operational Research, 1984