A novel heuristic approach for solving aircraft landing problem with single runway

Nowadays, airlines administrations are more willing to utilize optimization tools to control air traffic due to considerable increases in volume of air transports. A challenging problem in the field of air traffic is how to optimally schedule landing time of aircrafts and assign them to different runways such that early and late landing costs are minimized. This problem is called aircraft landing problem (ALP). This paper proposes a novel decomposition based heuristic by solving two sub-problems for the ALP with single runway. In the first sub-problem, the authors apply the adaptive large neighborhood search (ALNS) algorithm to find a sequence of aircrafts. The solution found in the first sub-problem will be sent to the second sub-problem, to check for the feasibility of the solution using CPLEX solver. A set of benchmark problem are taken from the operations research (OR) library for the purpose of comparison with other existing approaches. The computational results exhibit that the proposed algorithm is capable of finding the best known optimal solution for all the instances.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01538666
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Sep 10 2014 4:30PM