Please use this identifier to cite or link to this item:
Title: Aircraft parking stand allocation problem with safety consideration for independent hangar maintenance service providers
Authors: Qin, Y 
Chan, FTS 
Chung, SH 
Qu, T
Niu, B
Keywords: Aircraft hangar maintenance
Integer programming
Parking stand allocation
Safety margin
Issue Date: 2017
Publisher: Pergamon Press
Source: Computers and operations research, 2017, p. 2 How to cite?
Journal: Computers and operations research 
Abstract: An aircraft parking stand allocation problem for aircraft hangar maintenance in the context of an independent aircraft maintenance, repair and overhaul (MRO) service provider is studied. This problem arises from the increasing outsourcing maintenance requests initiated by clients that can cause congestion on certain days. Given a set of maintenance requests on a peak day that exceed the capacity of the maintenance hangar, the service provider has to select and first serve the particular subset of aircraft that maximizes their overall profits and then rearrange the remaining requests later. The objective of the proposed problem is to determine a subset of maintenance orders with maximal overall profits and a feasible parking plan on a peak day. In particular, there is to be no overlap between aircraft, and the risk of collision measured by the shortest distance between each pair of aircraft is to be minimized. To solve this problem, No-Fit Polygon (NFP) construction is adopted to prevent overlap between pairs of aircraft. A two-stage MIP approach is proposed, in which the first model is used to find the subset of maintenance orders with the maximal overall profits, while the second model maximizes the overall safety margins based on the revised NFPs. A heuristic algorithm is introduced in order to improve the efficiency of the branch-and-bound algorithm in the second stage problem. Testing instances are generated based on the real situation in an aircraft maintenance company, and the effectiveness of the proposed approaches are evaluated through computational experiments.
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2017.10.001
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jul 13, 2018


Last Week
Last month
Citations as of Jul 11, 2018

Page view(s)

Last Week
Last month
Citations as of Jul 15, 2018

Google ScholarTM



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