In this research, we develop an integrated scheduling model that combines passenger, cargo and combi flight scheduling. We employ network flow techniques to construct the model which is formulated as an integer multiple commodity network flow problem that is characterized as NP-hard. A family of heuristics, based on Lagrangian relaxation, a sub-gradient method, heuristics for the upper bound solution, and a flow decomposition algorithm, is developed to solve the model. The test results, mainly using data from a major Taiwan airline's operations, show the good performance of the model and the solution algorithms.
|Number of pages
|Transportation Research Part E: Logistics and Transportation Review
|Published - Nov 2008
- Fleet routing
- Flight scheduling
- Lagrangian relaxation
- Multiple commodity network flow problem