A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A bi-objective aircraft maintenance routing problem based on flying hours to efficient use of available fleet
The proposed model aims to consider the flying hours as a criterion to initiate maintenance operation. Based on this condition, aircraft must be checked before flying hours threshold is met. After receiving maintenance service, the model ignores previous flying hours and the aircraft can keep on flying until the threshold value is reached again. Moreover, the model considers aircraft age and efficiency to assign them to flights.
The aircraft maintenance routing problem (AMRP), as one of the most important problems in the aviation industry, determines the optimal route for each aircraft along with meeting maintenance requirements. This paper presents a bi-objective mixed-integer programming model for AMRP in which several criteria such as aircraft efficiency and ferrying flights are considered.
As the solution approaches, epsilon-constraint method and a non-dominated sorting genetic algorithm (NSGA-II), including a new initializing algorithm, are used. To verify the efficiency of NSGA-II, 31 test problems in different scales are solved using NSGA-II and GAMS. The results show that the optimality gap in NSGA-II is less than 0.06%. Finally, the model was solved based on real data of American Eagle Airlines extracted from Kaggle datasets.
The authors confirm that it is an original paper, has not been published elsewhere and is not currently under consideration of any other journal.
A bi-objective aircraft maintenance routing problem based on flying hours to efficient use of available fleet
The proposed model aims to consider the flying hours as a criterion to initiate maintenance operation. Based on this condition, aircraft must be checked before flying hours threshold is met. After receiving maintenance service, the model ignores previous flying hours and the aircraft can keep on flying until the threshold value is reached again. Moreover, the model considers aircraft age and efficiency to assign them to flights.
The aircraft maintenance routing problem (AMRP), as one of the most important problems in the aviation industry, determines the optimal route for each aircraft along with meeting maintenance requirements. This paper presents a bi-objective mixed-integer programming model for AMRP in which several criteria such as aircraft efficiency and ferrying flights are considered.
As the solution approaches, epsilon-constraint method and a non-dominated sorting genetic algorithm (NSGA-II), including a new initializing algorithm, are used. To verify the efficiency of NSGA-II, 31 test problems in different scales are solved using NSGA-II and GAMS. The results show that the optimality gap in NSGA-II is less than 0.06%. Finally, the model was solved based on real data of American Eagle Airlines extracted from Kaggle datasets.
The authors confirm that it is an original paper, has not been published elsewhere and is not currently under consideration of any other journal.
A bi-objective aircraft maintenance routing problem based on flying hours to efficient use of available fleet
Esmaeilzadeh, Hiwa (author) / Rashidi Komijan, Alireza (author) / Kazemipoor, Hamed (author) / Fallah, Mohammad (author) / Tavakkoli-Moghaddam, Reza (author)
Journal of Facilities Management ; 22 ; 325-344
2024-03-14
20 pages
Article (Journal)
Electronic Resource
English
Integration of Fleet Assignment and Aircraft Routing
| British Library Online Contents | 2005
The mixed fleet stochastic vehicle routing problem
| Taylor & Francis Verlag | 1995
THE MIXED FLEET STOCHASTIC VEHICLE ROUTING PROBLEM
| Online Contents | 1995
FLEET MANAGEMENT & MAINTENANCE
Online Contents | 1998