The integrated aircraft routing problem with optional flights and delay considerations
Nabil Kenan,
Aida Jebali and
Ali Diabat
Transportation Research Part E: Logistics and Transportation Review, 2018, vol. 118, issue C, 355-375
Abstract:
In this paper, we integrate flight scheduling, fleet assignment, and aircraft routing decisions, which are the most prominent decisions in airline planning, while considering the stochasticity of the demand. In addition, optional flights, delays and deadhead flights are considered as they are crucial elements that significantly affect airline profits. Due to the complexity of the formulated problem, three different column generation-based algorithms are developed. The results show that our algorithms can solve the problem in a fraction of the time a commercial solver takes with an optimality gap of less than 0.1%.
Keywords: Flight scheduling; Fleet assignment; Aircraft routing; Stochastic demand; Column generation (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554518304071
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:118:y:2018:i:c:p:355-375
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
DOI: 10.1016/j.tre.2018.08.002
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().