Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/77462
Title: Stackelberg game theoretical model for optimizing aircraft maintenance routing with maintenance staffing
Authors: Eltoukhy, AEE 
Chan, FTS 
Chung, SH 
Qu, T
Keywords: Aircraft routing problem
Maintenance staffing problem
Stackelberg game
Issue Date: 2017
Publisher: Curran Associates
Source: Proceedings of International Conference on Computers and Industrial Engineering, CIE, 2017 How to cite?
Abstract: Despite the interdependence between the operational aircraft maintenance routing problem with flight delay consideration (OAMRPFD) and the maintenance staffing problem (MSP), they are solved separately. Therefore, the optimal plan of each problem will not be operated as planned. In this paper, our focus is the OAMRPFD along with the MSP, with two main objectives. Firstly, to develop an OAMRPFD model that reflects appropriately the flight delays. For this purpose, a new scenario-based stochastic programming model for OAMRPFD (SOAMRPFD) is proposed. Secondly, to handle the interdependence between SOAMRPFD and MSP, by proposing a coordinated configuration of SOAMRPFD and MSP that is formulated as a leader-follower Stackelbery game. In this game, SOAMRPFD acts as a leader and MSP acts as a follower. This game is enacted through a bi-level optimization model, which is solved by a bi-level nested ant colony optimization (ACO) algorithm. In order to demonstrate the superiority of the proposed model, a case study of major airline and maintenance companies located in the Middle East is presented.
URI: http://hdl.handle.net/10397/77462
ISBN: 9.78E+12
Appears in Collections:Conference Paper

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

Google ScholarTM

Check


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