The comparison of the metaheuristic algorithms performances on airport gate assignment problem

Abdullah Aktel*, Betul Yagmahan, Tuncay Özcan, M. Mutlu Yenisey, Engin Sansarci

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

39 Citations (Scopus)

Abstract

The airport gate assignment problem (AGAP) is an important research area in air transportation planning and optimization. In this paper we study the airport gate assignment problem where the objectives are to minimize the number of ungated flights and the total walking distances. In order to solve the problem, we proposed a new tabu search (TS) algorithm which uses a probabilistic approach as an aspiration criterion. We compared two metaheuristics, namely, TS, and simulated annealing (SA). A greedy algorithm used as a benchmark. We compared the performances of the algorithms and analyzed at different problem sizes. Experimentations showed that the new proposed metaheuristic algorithm gave promising results.

Original languageEnglish
Pages (from-to)469-478
Number of pages10
JournalTransportation Research Procedia
Volume22
DOIs
Publication statusPublished - 2017
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2017 The Authors. Published by Elsevier B.V.

Keywords

  • Gate assignment
  • Metaheuristics
  • Simulated annealing
  • Tabu search

Fingerprint

Dive into the research topics of 'The comparison of the metaheuristic algorithms performances on airport gate assignment problem'. Together they form a unique fingerprint.

Cite this