New heuristics for over-constrained flight to gate assignments

New heuristics for over-constrained flight to gate assignments

0.00 Avg rating0 Votes
Article ID: iaor20051444
Country: United Kingdom
Volume: 55
Issue: 7
Start Page Number: 760
End Page Number: 768
Publication Date: Jul 2004
Journal: Journal of the Operational Research Society
Authors: , , ,
Keywords: heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.