TY - JOUR
T1 - Applying lagrangian relaxation-based algorithm for the airline coordinated flight scheduling problems
AU - Chen, Chia Hung
AU - Yan, Shangyao
PY - 2010/6
Y1 - 2010/6
N2 - The solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed 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 the solution algorithm is a significant improvement over those obtained with CPLEX, consequently they could be useful for allied airlines to solve coordinated fleet routing and flight scheduling problems.
AB - The solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed 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 the solution algorithm is a significant improvement over those obtained with CPLEX, consequently they could be useful for allied airlines to solve coordinated fleet routing and flight scheduling problems.
KW - Coordinated flight scheduling
KW - Lagrangian relaxation
KW - Multiple commodity network flow problem
UR - http://www.scopus.com/inward/record.url?scp=79951487660&partnerID=8YFLogxK
M3 - 期刊論文
AN - SCOPUS:79951487660
SN - 2010-376X
VL - 66
SP - 367
EP - 374
JO - World Academy of Science, Engineering and Technology
JF - World Academy of Science, Engineering and Technology
ER -