 A novel heuristic approach for solving aircraft landing problem with single runwaySatish Vadlamani and Seyedmohsen Hosseini Journal of Air Transport Management, 2014, vol. 40, issue C, 144-148 Abstract: 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, we 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 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. Keywords: Aircraft landing; Airline industry; Adaptive large neighborhood search; Air transport (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jaitra:v:40:y:2014:i:c:p:144-148 DOI: 10.1016/j.jairtraman.2014.06.009 Access Statistics for this article Journal of Air Transport Management is currently edited by Anne Graham More articles in Journal of Air Transport Management from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.