Aircraft and Gate Scheduling Optimization at Airports

Authors:
H. Ding;A. Lim;B. Rodrigues;Y. Zhu
Affiliations:
-;-;-;-
Venue:
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3
Year:
2004

Citing 0
Cited 5

The over-constrained airport gate assignment problem

Computers and Operations Research
A stochastic neighborhood search approach for airport gate assignment problem

Expert Systems with Applications: An International Journal
An evolutionary algorithm for the over-constrained airport baggage sorting station assignment problem

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
A weight-based graph coloring approach to airport gate assignment problem

ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
An improved squeaky wheel optimization approach to the airport gates assignment problem

ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the over-constrained Airport Gate Assignment Problem where the number of flights exceeds the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances or connection times. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions while we devise a new neighborhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducted give good results.