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

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

doi:10.1016/j.trpro.2017.03.061

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 journal › Article › peer-review

42 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 language	English
Pages (from-to)	469-478
Number of pages	10
Journal	Transportation Research Procedia
Volume	22
DOIs	https://doi.org/10.1016/j.trpro.2017.03.061
Publication status	Published - 2017
Externally published	Yes

Bibliographical note

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

Keywords

Gate assignment
Metaheuristics
Simulated annealing
Tabu search

Access to Document

10.1016/j.trpro.2017.03.061

Cite this

@article{186dd8b3b6644c0285b0ba377c01b4fa,

title = "The comparison of the metaheuristic algorithms performances on airport gate assignment problem",

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.",

keywords = "Gate assignment, Metaheuristics, Simulated annealing, Tabu search",

author = "Abdullah Aktel and Betul Yagmahan and Tuncay {\"O}zcan and Yenisey, {M. Mutlu} and Engin Sansarci",

note = "Publisher Copyright: {\textcopyright} 2017 The Authors. Published by Elsevier B.V.",

year = "2017",

doi = "10.1016/j.trpro.2017.03.061",

language = "English",

volume = "22",

pages = "469--478",

journal = "Transportation Research Procedia",

issn = "2352-1457",

publisher = "Elsevier B.V.",

}

TY - JOUR

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

AU - Aktel, Abdullah

AU - Yagmahan, Betul

AU - Özcan, Tuncay

AU - Yenisey, M. Mutlu

AU - Sansarci, Engin

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

KW - Gate assignment

KW - Metaheuristics

KW - Simulated annealing

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=85019439134&partnerID=8YFLogxK

U2 - 10.1016/j.trpro.2017.03.061

DO - 10.1016/j.trpro.2017.03.061

M3 - Article

AN - SCOPUS:85019439134

SN - 2352-1457

VL - 22

SP - 469

EP - 478

JO - Transportation Research Procedia

JF - Transportation Research Procedia

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this