Please use this identifier to cite or link to this item:
Title: Integrated fleet assignment with cargo routing
Authors: LI DONG
Keywords: Integrated Planning; Fleet Assignment; Cargo Routing Problem; Benders Decomposition; Multicommodity Network Flow Problem; Mixed Integer Programming
Issue Date: 3-Aug-2004
Citation: LI DONG (2004-08-03). Integrated fleet assignment with cargo routing. ScholarBank@NUS Repository.
Abstract: In this thesis we incorporate the cargo routing problem into the fleet assignment in order to model the fleet assignment more accurately. An integrated model and a basic algorithm based on Benders decomposition are developed to simultaneously obtain the optimal assignment of aircraft to legs and the cargo routing over the network. To explore the possibility of accelerating convergence, two variants on Benders decomposition are implemented. The Pareto-optimal cut generation method selects strong cuts at each Benders iteration, while the e-optimal method solves the Benders relaxed master problem to a feasible integer solution rather than an integer optimum. A hybrid approach that combines the e-optimal method and the basic algorithm is proposed to enhance the e-optimal method. Results show that the basic algorithm and the hybrid approach converge very fast for all test instances and outperform the other two approaches
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
LiD.pdf506.61 kBAdobe PDF



Page view(s)

checked on Sep 30, 2018


checked on Sep 30, 2018

Google ScholarTM


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