A ripple-spreading Genetic Algorithm for the airport Gate Assignment Problem
2009 IEEE Congress on Evolutionary Computation
Since the Gate Assignment Problem (GAP) at airport terminals is a combinatorial optimization problem, permutation representations based on aircraft dwelling orders are typically used in the implementation of Genetic Algorithms (GAs), The design of such GAs is often confronted with feasibility and memory-efficiency problems. This paper proposes a hybrid GA, which transforms the original order based GAP solutions into value based ones, so that the basic a binary representation and all classic
... and all classic evolutionary operations can be applied free of the above problems. In the hybrid GA scheme, aircraft queues to gates are projected as points into a parameterized space. A deterministic model inspired by the phenomenon of natural ripple-spreading on liquid surfaces is developed which uses relative spatial parameters as input to connect all aircraft points to construct aircraft queues to gates, and then a traditional binary GA compatible to all classic evolutionary operators is used to evolve these spatial parameters in order to find an optimal or near-optimal solution. The effectiveness of the new hybrid GA based on the ripple-spreading model for the GAP problem are illustrated by experiments.