Applying Lagrangian relaxation-based algorithms for airline coordinated flight scheduling problems

Authors:
Chia-Hung Chen;Shangyao Yan;Miawjane Chen
Affiliations:
Department of Logistics Management, Shu-Te University, Yen Chau 82445, Taiwan;Department of Civil Engineering, National Central University, Chung-Li 32001, Taiwan;Department of Finance, National United University, Miao-Li, 36003, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 6
Cited 0

A passenger demand model for airline flight scheduling and fleet routing

Computers and Operations Research
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network

Computers and Operations Research
Optimal flight scheduling models for cargo airlines under alliances

Journal of Scheduling
Optimal routing policy of a stochastic-flow network

Computers and Industrial Engineering
Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

Yan and Chen (2007, 2008) employed network flow techniques to construct coordinated scheduling models for passenger- and cargo-transportation, respectively. These models are formulated as mixed integer multiple commodity network flow problems with side constraints (NFPWS) that are characterized as NP-hard. Problem sizes are expected to be huge making the model more difficult to solve than traditional passenger/cargo flight scheduling problems. Therefore, a family of Lagrangian based algorithm is developed to solve the coordinated fleet routing and flight scheduling problems. Numerical tests are performed to evaluate the proposed algorithm using real operating data from two Taiwan airlines. The test results indicate that these solution algorithms are a significant improvement over those obtained with CPLEX. Moreover, the Lagrangian based algorithms are better than the mixed-stop heuristic, consequently they could be useful for allied airlines to solve coordinated fleet routing and flight scheduling problems.