Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/104109
PIRA download icon_1.1View/Download Full Text
Title: A model with a solution algorithm for the operational aircraft maintenance routing problem
Authors: Eltoukhy, AEE 
Chan, FTS 
Chung, SH 
Niu, B
Issue Date: Jun-2018
Source: Computers and industrial engineering, June 2018, v. 120, p. 346-359
Abstract: The operational aircraft maintenance routing problem (OAMRP) determines the route for each individual aircraft while incorporating operational maintenance considerations. This problem is significant for airlines as it determines the routes to be flown in real life. Most studies incorporate particular operational maintenance requirements, like restrictions on the total number of days between two successive maintenance checks, while neglecting other considerations. Such neglected considerations include restrictions on the total cumulative flying time, restrictions on the total number of takeoffs, the workforce capacity and the working hours of the maintenance stations. This can result in the generation of routes that are not feasible for implementation in reality. In this paper, we study OAMRP, with two objectives. First, to propose a model that considers all operational maintenance requirements, and for this purpose, we formulate a mixed integer linear programming (MILP) model by modifying the connection network. The proposed model is solved using commercial software for small size problems. Second, to develop a solution algorithm that solves the model efficiently and quickly while tackling medium and large-scale problems. The performance of the proposed solution algorithm is assessed based on real data obtained from EgyptAir. The results demonstrate high quality solutions and significant savings in computational time. The experiments were extended for two reasons. First, to compare the performance of the proposed solution algorithm with existing solution methods. Second, to test the effect of incorporating the operational requirements on profit. The results show that the proposed algorithm outperforms existing methods, like compressed annealing (CA), in producing better solution quality in much shorter computational time. In addition, the results reveal that considering the maintenance workforce capacity improves the profitability of the airline. Such outcomes provide evidence that the proposed model and solution method have great potential for solving the actual OAMRP.
Keywords: Air transportation
Aircraft routing problem
Airline operations
Integer programming
Publisher: Elsevier Ltd
Journal: Computers and industrial engineering 
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2018.05.002
Rights: © 2018 Elsevier Ltd. All rights reserved.
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/
The following publication Eltoukhy, A. E. E., Chan, F. T. S., Chung, S. H., & Niu, B. (2018). A model with a solution algorithm for the operational aircraft maintenance routing problem. Computers and Industrial Engineering, 120, 346–359 is available at https://doi.org/10.1016/j.cie.2018.05.002.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Eltoukhy_Model_Solution_Solution.pdfPre-Published version1.34 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

80
Last Week
0
Last month
Citations as of Nov 9, 2025

Downloads

138
Citations as of Nov 9, 2025

SCOPUSTM   
Citations

32
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

28
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


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