A Hybrid Ant-Based System for Gate Assignment Problem

Authors:
Camelia-M. Pintea;Petrica C. Pop;Camelia Chira;D. Dumitrescu
Affiliations:
Babes-Bolyai University, Kogalniceanu, Cluj-Napoca, Romania 400084;North University, V.Babes, Baia-Mare, Romania 430083;Babes-Bolyai University, Kogalniceanu, Cluj-Napoca, Romania 400084;Babes-Bolyai University, Kogalniceanu, Cluj-Napoca, Romania 400084
Venue:
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Year:
2008

Citing 3
Cited 1

The Airport Gate Assignment Problem: Mathematical Model and a Tabu Search Algorithm

HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 3 - Volume 3
The over-constrained airport gate assignment problem

Computers and Operations Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

The use of meta-heuristics for airport gate assignment

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an ant system coupled with a local search applied to an over-constrained airport gate assignment problem (AGAP). In the airport gate assignment problem we are interested in selecting and allocating aircrafts to the gates such that the total passenger connection time is minimized. Our algorithm uses pheromone trail information to perform modifications on AGAPsolutions, unlike traditional ant systems that use pheromone trail information to construct complete solutions. The algorithm is analyzed and compared with tabu search heuristic and Ant Colony System metaheuristic.