Aktel, AbdullahÖzcan, TuncayYenisey, M. MutluSansarcı, EnginÇelikoğlu, H. B.Lav, A. H.Silgu, M. A.2023-01-042023-01-042017Aktel, 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.2352-1465https://doi.org/10.1016/j.trpro.2017.03.061https://www.sciencedirect.com/science/article/pii/S2352146517301989http://hdl.handle.net/11452/30259Bu ç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.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.eninfo:eu-repo/semantics/openAccessTransportationGate assignmentMetaheuristicsSimulated annealingTabu searchGenetic algorithmFlightAircraftOptimizationHeuristicsSimulationTerminalsModelsSolveProceedings Paper0004046333000482-s2.0-8501943913446947822TransportationTransportation science & technologyBaggage Handling; Airports; Helicopter