Show simple item record

AuthorAl-Thani, Nayla Ahmad
AuthorBen Ahmed, Mohamed
AuthorHaouari, Mohamed
Available date2021-04-15T14:11:21Z
Publication Date2016
Publication NameTransportation Research Part C: Emerging Technologies
ResourceScopus
URIhttp://dx.doi.org/10.1016/j.trc.2016.09.004
URIhttp://hdl.handle.net/10576/18268
AbstractThis paper investigates the Operational Aircraft Maintenance Routing Problem (OAMRP). Given a set of flights for a specific homogeneous fleet type, this short-term planning problem requires building feasible aircraft routes that cover each flight exactly once and that satisfy maintenance requirements. Basically, these requirements enforce an aircraft to undergo a planned maintenance at a specified station before accumulating a maximum number of flying hours. This stage is significant to airline companies as it directly impacts the fleet availability, safety, and profitability. The contribution of this paper is twofold. First, we elucidate the complexity status of the OAMRP and we propose an exact mixed-integer programming model that includes a polynomial number of variables and constraints. Furthermore, we propose a graph reduction procedure and valid inequalities that aim at improving the model solvability. Second, we propose a very large-scale neighborhood search algorithm along with a procedure for computing tight lower bounds. We present the results of extensive computational experiments that were carried out on real-world flight networks and attest to the efficacy of the proposed exact and heuristic approaches. In particular, we provide evidence that the exact model delivers optimal solutions for instances with up to 354 flights and 8 aircraft, and that the heuristic approach consistently delivers high-quality solutions while requiring short CPU times.
SponsorThis research was made possible by NPRP Grant No. NPRP 06-818-5-094 from the Qatar National Research Fund (a member of The Qatar Foundation). The statements made herein are solely the responsibility of the authors.
Languageen
PublisherElsevier Ltd
SubjectAircraft routing problem
Compact formulations
OR in airlines
Very large-scale neighborhood search
TitleA model and optimization-based heuristic for the operational aircraft maintenance routing problem
TypeArticle
Pagination29-44
Volume Number72
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record