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

Aktel A., YAĞMAHAN B., Ozcan T., Yeniseye M. M., Sansarci E.

19th European-Operational-Research-Societies Working Group on Transportation Meeting (EWGT), İstanbul, Türkiye, 5 - 07 Eylül 2016, cilt.22, ss.469-478 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 22
  • Doi Numarası: 10.1016/j.trpro.2017.03.061
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.469-478
  • İstanbul Teknik Üniversitesi Adresli: Evet

Özet

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. (C) 2017 The Authors. Published by Elsevier B.V.