A stochastic neighborhood search approach for airport gate assignment problem

  • Authors:

  • Hakkı Murat Genç;Osman Kaan Erol;İbrahim Eksin;Mehmet Fatih Berber;Binnur Onaran Güleryüz

  • Affiliations:

  • The National Research Institute of Electronics and Cryptology, Information Technologies Institute, TR-41470 Gebze, Kocaeli, Turkey and İstanbul Technical University, Faculty of Electrical and ...;İstanbul Technical University, Faculty of Electrical and Electronics Engineering, Computer Engineering Department, Maslak, TR-34469 İstanbul, Turkey;İstanbul Technical University, Faculty of Electrical and Electronics Engineering, Control Engineering Department, Maslak, TR-34469 İstanbul, Turkey;TAV Information Technologies Corporation, İstanbul Atatürk International Airport, Yeşilköy, TR-34149 İstanbul, Turkey;TAV Information Technologies Corporation, İstanbul Atatürk International Airport, Yeşilköy, TR-34149 İstanbul, Turkey

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 12.05

Visualization

Abstract

An appropriate and efficient gate assignment is of great importance in airports since it plays a major role in the revenue obtained from the airport operations. In this study, we have focused mainly on maximum gate employment, or in other words minimize the total duration of un-gated flights. Here, we propose a method that combines the benefits of heuristic approaches with some stochastic approach instead of using a purely probabilistic approach to top-down solution of the problem. The heuristic approaches are usually used in order to provide a fast solution of the problem and later stochastic searches are used in order to ameliorate the previous results of the heuristic approach whenever possible. The proposed method generates an assignment order for the whole planes that corresponds to assignment priority. The ordering process is followed by the allocation step. Since, in practice, each airport has its own physical architecture, there have been arisen many constraints mainly concerning airplane types and parking lots in this step. Sequentially handling the plane ordering and allocation phases provides us great modularity in handling the constraints. The effectiveness of the proposed methodology has been tried to be illustrated firstly on fictively generated flight schedule data and secondly on the real world data obtained from a real world application developed for Istanbul Ataturk Airport.