Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325160 
Year of Publication: 
2022
Citation: 
[Journal:] EURO Journal on Transportation and Logistics (EJTL) [ISSN:] 2192-4384 [Volume:] 11 [Issue:] 1 [Article No.:] 100084 [Year:] 2022 [Pages:] 1-17
Publisher: 
Elsevier, Amsterdam
Abstract: 
Although optimization techniques have been successfully applied for a number of airline operations, aircraft recovery remains a challenge for both practitioners and researchers due to its complexity and the usual need of a quick response in practical settings. In this paper, we consider the case of a Brazilian oil and gas company that uses a heterogeneous fleet of helicopters for passenger transportation from a few mainland aerodromes to maritime units. The major difficulties in rescheduling delayed flights are resource limitations and realistic features of the company combined with safety and management practices. The problem consists of determining joint daily flight reschedules for all aerodromes that satisfy operational constraints and recovers all pending flights, while minimizing flight transfers among aerodromes, usage of helicopters and overall flight delays. We propose a mixed integer programming (MIP) model, aiming to appropriately represent the problem, and MIP-based local search and two-phase heuristics to cope with larger realistic problem instances. Computational results obtained with instances collected in the case study show the potential of these approaches to deal with this real-life aircraft recovery problem.
Subjects: 
Aircraft recovery problem
Flight rescheduling
Mixed integer programming
HeuristicsOil and gas industry
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.