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

被引：28

作者：

Aktel, Abdullah ^{[1
]}

Yagmahan, Betul ^{[2
]}

Ozcan, Tuncay ^{[3
]}

Yeniseye, M. Mutlu ^{[3
]}

Sansarci, Engin ^{[4
]}

机构：

[1] Turkish Inst Management Sci Kocaeli, Gebze, Turkey

[2] Uludag Univ, Sch Engn, Dept Ind Engn, Bursa, Turkey

[3] Istanbul Univ, Sch Engn, Dept Ind Engn, Istanbul, Turkey

[4] Istanbul Tech Univ, Fac Management, Dept Engn Management, Istanbul, Turkey

来源：

19TH EURO WORKING GROUP ON TRANSPORTATION MEETING (EWGT2016) | 2017年 / 22卷

关键词：

Gate assignment; Metaheuristics; Tabu search; Simulated annealing; GENETIC ALGORITHM; FLIGHT; AIRCRAFT; OPTIMIZATION; HEURISTICS; SIMULATION; TERMINALS; MODELS; SOLVE;

D O I：

10.1016/j.trpro.2017.03.061

中图分类号：

U [交通运输];

学科分类号：

08 ; 0823 ;

摘要：

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.

引用

页码：469 / 478

页数：10

共 29 条

[1]

[Anonymous], 2001, P 34 ANN HAW INT C S

[2] AIRCRAFT STAND ASSIGNMENT TO MINIMIZE WALKING [J].