Learn More
— In this paper we study the over-constrained Airport Gate Assignment Problem where the objectives are to minimize the number of ungated flights and the total walking distances or connection times. We approach the problem by first using a Simulated Annealing heuristic and then developing a hybrid which uses Simulated Annealing together with a Tabu Search.(More)
We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search(More)
  • 1