An efficient hybrid meta-heuristic for aircraft landing problem

Authors:
Amir Salehipour;Mohammad Modarres;Leila Moslemi Naeni
Affiliations:
Department of Industrial Engineering, Islamic Azad University, Garmsar Branch, Garmsar, Iran;School of Industrial Engineering, Sharif University of Technology, Tehran, Iran;School of Industrial Engineering, Sharif University of Technology, Tehran, Iran
Venue:
Computers and Operations Research
Year:
2013

Citing 3
Cited 0

Variable neighborhood search

Computers and Operations Research
Scheduling Aircraft Landings--The Static Case

Transportation Science
Genetic search methods in air traffic control

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Aircraft landing problem is to assign an airport's runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts. In this paper, first a mixed integer goal programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design a hybrid meta-heuristic applying simulated annealing framework. The computational results show that the proposed algorithm can obtain the optimal solution for instances up to 100 aircrafts, and also it is capable of finding very high quality and comparable solutions for the problems with up to 500 aircrafts and 5 runways in a short time.