| Article ID: | iaor20112167 |
| Volume: | 45 |
| Issue: | 1 |
| Start Page Number: | 109 |
| End Page Number: | 120 |
| Publication Date: | Feb 2011 |
| Journal: | Transportation Science |
| Authors: | Huang Huei Chuen, Chaovalitwongse Wanpracha Art, Johnson Ellis L, Liang Zhe |
| Keywords: | maintenance, repair & replacement, programming: integer, programming: assignment, vehicle routing & scheduling |
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.