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
DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineeringen_US
dc.creatorEltoukhy, AEEen_US
dc.creatorChan, FTSen_US
dc.creatorChung, SHen_US
dc.creatorNiu, Ben_US
dc.date.accessioned2024-02-05T08:46:22Z-
dc.date.available2024-02-05T08:46:22Z-
dc.identifier.issn0360-8352en_US
dc.identifier.urihttp://hdl.handle.net/10397/104109-
dc.language.isoenen_US
dc.publisherElsevier Ltden_US
dc.rights© 2018 Elsevier Ltd. All rights reserved.en_US
dc.rights© 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/en_US
dc.rightsThe 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.en_US
dc.subjectAir transportationen_US
dc.subjectAircraft routing problemen_US
dc.subjectAirline operationsen_US
dc.subjectInteger programmingen_US
dc.titleA model with a solution algorithm for the operational aircraft maintenance routing problemen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage346en_US
dc.identifier.epage359en_US
dc.identifier.volume120en_US
dc.identifier.doi10.1016/j.cie.2018.05.002en_US
dcterms.abstractThe 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.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationComputers and industrial engineering, June 2018, v. 120, p. 346-359en_US
dcterms.isPartOfComputers and industrial engineeringen_US
dcterms.issued2018-06-
dc.identifier.scopus2-s2.0-85046779964-
dc.identifier.eissn1879-0550en_US
dc.description.validate202402 bcchen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberISE-0644-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThe Natural Science Foundation of China; The Research Committee of Hong Kong Polytechnic Universityen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS6839024-
dc.description.oaCategoryGreen (AAM)en_US
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 simple 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.