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

Loading...
Thumbnail Image

Date

2017

Authors

Aktel, Abdullah
Özcan, Tuncay
Yenisey, M. Mutlu
Sansarcı, Engin
Çelikoğlu, H. B.
Lav, A. H.
Silgu, M. A.

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

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.

Description

Bu çalışma, 05-07 Eylül 2016 tarihleri arasında İstanbul[Türkiye]’da düzenlenen 19. European-Operational-Research-Societies Working Group on Transportation Meeting (EWGT)’da bildiri olarak sunulmuştur.

Keywords

Transportation, Gate assignment, Metaheuristics, Simulated annealing, Tabu search, Genetic algorithm, Flight, Aircraft, Optimization, Heuristics, Simulation, Terminals, Models, Solve

Citation

Aktel, A. vd. (2017). ''The comparison of the metaheuristic algorithms performances on airport gate assignment problem''. ed. H. B. Çelikoğlu vd. Transportation Research Procedia, 19th Euro Working Group on Transportation Meeting (Ewgt2016), 22, 469-478.