Accommodating new flights into an existing airline flight schedule release_c7tqsvg2vvgppn357wdo7nadji

by Ozge Safak, Alper Atamturk, Selim M. Akturk

Released as a article .

(2018)

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 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.
In text/plain format

Archived Files and Locations

application/pdf  1.1 MB
file_6r6moage7jcahgimnmkktiug64
web.archive.org (webarchive)
arxiv.org (repository)
Read Archived PDF
Archived
Type  article
Stage   submitted
Date   2018-11-08
Version   v2
Language   en ?
arXiv  1806.02866v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ba93b399-ac67-4db5-b681-ac91517f1163
API URL: JSON