An efficient hybrid meta-heuristic for aircraft landing problem
- Publication Type:
- Journal Article
- Computers and Operations Research, 2013, 40 (1), pp. 207 - 213
- Issue Date:
Files in This Item:
|An efficient hybrid meta-heuristic for aircraft landing problem.pdf||Published Version||356.04 kB|
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
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. © 2012 Elsevier Ltd. All rights reserved.
Please use this identifier to cite or link to this item: