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. 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. Experiment conducted give good results.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
