New Heuristics for Over-Constrained Flight to Gate Assignments
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 meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.
Operations and Supply Chain Management
Journal of the Operational Research Society
DING, Huping; LIM, Andrew; RODRIGUES, Brian; and ZHU, Yejun.
New Heuristics for Over-Constrained Flight to Gate Assignments. (2004). Journal of the Operational Research Society. 55, (7), 760-768. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2628