Applying lagrangian relaxation-based algorithm for the airline coordinated flight scheduling problems

Chia Hung Chen, Shangyao Yan

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)367-374
Number of pages8
JournalWorld Academy of Science, Engineering and Technology
Volume66
StatePublished - Jun 2010

Keywords

  • Coordinated flight scheduling
  • Lagrangian relaxation
  • Multiple commodity network flow problem

Fingerprint

Dive into the research topics of 'Applying lagrangian relaxation-based algorithm for the airline coordinated flight scheduling problems'. Together they form a unique fingerprint.

Cite this