An efficient hybrid meta‐heuristic for aircraft landing problem

An efficient hybrid meta‐heuristic for aircraft landing problem

0.00 Avg rating0 Votes
Article ID: iaor20125426
Volume: 40
Issue: 1
Start Page Number: 207
End Page Number: 213
Publication Date: Jan 2013
Journal: Computers and Operations Research
Authors: , ,
Keywords: scheduling, combinatorial optimization, programming: integer, optimization: simulated annealing
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.

Reviews

Required fields are marked *. Your email address will not be published.