Please use this identifier to cite or link to this item:
Title: On a new rotation tour network model for aircraft maintenance routing problem
Authors: Liang, Z.
Chaovalitwongse, W.A.
Huang, H.C. 
Johnson, E.L.
Keywords: Aircraft routing problem
Integer programming
Large-scale optimization
Network optimization
Issue Date: Feb-2011
Citation: Liang, Z., Chaovalitwongse, W.A., Huang, H.C., Johnson, E.L. (2011-02). On a new rotation tour network model for aircraft maintenance routing problem. Transportation Science 45 (1) : 109-120. ScholarBank@NUS Repository.
Abstract: The airline industry currently has a $40-billion plus market and is expected to grow rapidly with the population growth and growth in the overall economy. Everyday, thousands of aircrafts undergo maintenance, repair, and overhaul. The aircraft maintenance problem is one of the important logistic problems in the airline industry. It is aimed at scheduling the aircrafts' routing so that enough maintenance opportunities are provided to every aircraft in the fleet. In this paper, we present a new compact network representation of the aircraft maintenance routing problem (AMR) and propose a new mixed-integer linear programming formulation to solve the problem. The quality of this model was assessed on four real test instances from a major U.S. carrier, and compared with the flight string model proposed in the literature. The computational results show that the proposed model is able to obtain the optimal solutions to all test instances in reasonable time. This study suggests that this model can be applied to integrated problems of the AMR and other planning problems such as the fleet assignment problem and crew pairing problem.
Source Title: Transportation Science
ISSN: 00411655
DOI: 10.1287/trsc.1100.0338
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jul 4, 2020


checked on Jun 26, 2020

Page view(s)

checked on Jun 29, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.