The aircraft rotation problem

Lloyd Clarke, Ellis Johnson, George Nemhauser and Zhongxi Zhu

Annals of Operations Research, 1997, vol. 69, issue 0, 33-46

Abstract: Given a set of flights to be flown for a specific aircraft type, with specified maintenance locations, durations, and needed frequency, the aircraft rotation problem is to determine the specific route flown by each aircraft. The objective is to maximize the benefit derived from making specific connections. In this paper, we present a mathematical formulation for the aircraft rotation problem (ARP) and discuss its similarity with the asymmetric traveling salesman problem. We solve the ARP by Lagrangian relaxation and subgradient optimi-zation and present computational results on real data from a major airline. Copyright Kluwer Academic Publishers 1997

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (45)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018945415148 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:69:y:1997:i:0:p:33-46:10.1023/a:1018945415148

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018945415148

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().