Highlights Propose two novel approaches to accommodate new flights into an existing flight schedule of a particular day. Present strong mixed-integer conic quadratic formulations to overcome the computational difficulties. The strengthen formulation with the McCormick inequalities enables solving instances with 300 flights optimally.
Abstract We present two novel approaches to alter a flight network for introducing new flights while maximizing airline’s profit. A key feature of the first approach is to adjust the aircraft cruise speed to compensate for the block times of the new flights, trading off flying time and fuel burn. In the second approach, we introduce aircraft swapping as an additional mechanism to provide a greater flexibility in reducing the incremental fuel cost and adjusting the capacity. The nonlinear fuel-burn function and the binary aircraft swap and assignment decisions complicate the optimization problem significantly. We propose strong mixed-integer conic quadratic formulations to overcome the computational difficulties. The reformulations enable solving instances with 300 flights from a major U.S. airline optimally within reasonable compute times.
Accommodating new flights into an existing airline flight schedule
Tramsportation Research, Part C: Emerging Technologies ; 104 ; 265-286
2019-05-09
22 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Accommodating Sub-Orbital Flights into the EASA Regulatory System
British Library Conference Proceedings | 2009
|Airline Base Schedule Optimisation by Flight Network Annealing
Springer Verlag | 2001
|Passive Smoking on Commercial Airline Flights
NTIS | 1989
|Wiley | 2009
|Dynamic Pricing in Airline Seat Management for Flights with Multiple Flight Legs
Online Contents | 1999
|