Aircraft routing under different business processes

Eve Lacasse-Guay, Guy Desaulniers and Soumis, François

Journal of Air Transport Management, 2010, vol. 16, issue 5, 258-263

Abstract: Given a set of scheduled flights that must be operated by the same aircraft type, the aircraft routing problem consists of building anonymous aircraft routes that respect maintenance requirements and cover each flight exactly once. This paper looks at the nature of the problem and introduces a classification according to three business processes that are used to assign the anonymous routes to the specific aircraft tail numbers. Furthermore, we compare the aircraft routing problem variants resulting from these three processes with regard to their adaptability to different contexts, the difficulty of solving them, the cost of the computed solutions, and the robustness of these solutions.

Keywords: Aircraft routing; Maintenance requirements; Strings; One-day routes (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0969699710000189
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:jaitra:v:16:y:2010:i:5:p:258-263

DOI: 10.1016/j.jairtraman.2010.02.001

Access Statistics for this article

Journal of Air Transport Management is currently edited by Anne Graham

More articles in Journal of Air Transport Management from Elsevier
Bibliographic data for series maintained by Catherine Liu ().