Please use this identifier to cite or link to this item:
Title: Integrated aircraft routing and crew pairing problem by benders decomposition
Authors: LIANG ZHE
Keywords: Integer, Benders Decomposition. Transportation: crews, aircraft.
Issue Date: 24-Aug-2004
Citation: LIANG ZHE (2004-08-24). Integrated aircraft routing and crew pairing problem by benders decomposition. ScholarBank@NUS Repository.
Abstract: The traditional airline planning is usually divided in several stages and solved sequentially, due to its size and complexity. The early stage results are inputs to the subsequent stage problems. Therefore, this sequential method may result in sub-optimality in planning. However, a fully integrated model is not tractable because of its enormous size. Nonetheless, benefits can be gained by partially integrating elements of the planning process. This paper uses the Benders decomposition to solve the integrated aircraft routing and crew pairing problem. Reversing the conventional approach, the crew pairing is formulated as the Benders master problem while a linear program on the selection of an aircraft maintenance routing is considered as the subproblem. We exploit the structure of the subproblem and identify two types of feasibility cuts. Test cases are generated to compare these two types of cuts. One of them is found to be stronger while the other is found to be computationally more efficient.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
LiangZ.pdf216.01 kBAdobe PDF



Page view(s)

checked on Dec 9, 2018


checked on Dec 9, 2018

Google ScholarTM


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