Loading...

An efficient hybrid meta-heuristic for aircraft landing problem

Salehipour, A ; Sharif University of Technology | 2013

704 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.cor.2012.06.004
  3. Publisher: 2013
  4. Abstract:
  5. 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
  6. Keywords:
  7. Aircraft scheduling ; Mixed-integer goal programming ; Simulated annealing meta-heuristic ; Computational results ; Goal programming ; Goal programming model ; Heuristic ; High quality ; Metaheuristic ; Mixed integer ; NP-hard ; Optimal solutions ; Aircraft ; Computer programming ; Heuristic algorithms ; Integer programming ; Simulated annealing ; Aircraft landing
  8. Source: Computers and Operations Research ; Volume 40, Issue 1 , January , 2013 , Pages 207-213 ; 03050548 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0305054812001335