New heuristics for over-constrained flight to gate assignments
- 1 July 2004
- journal article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 55 (7) , 760-768
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 resultsKeywords
This publication has 9 references indexed in Scilit:
- A network model for gate assignmentJournal of Advanced Transportation, 1998
- Network-Based Simulation of Aircraft at Gates in Airport TerminalsJournal of Transportation Engineering, 1998
- A rule-based reactive model for the simulation of aircraft on airport gatesKnowledge-Based Systems, 1998
- Tabu Search1997
- Airport gate position estimation for minimum total costs—Approximate closed form solutionTransportation Research Part B: Methodological, 1990
- A conceptual solution to the aircraft gate assignment problem using 0, 1 linear programmingComputers & Industrial Engineering, 1990
- Optimizing Gate Assignments at Airport TerminalsTransportation Science, 1985
- Aircraft Stand Assignment to Minimize WalkingJournal of Transportation Engineering, 1984
- A simulation analysis of airport terminal operationsTransportation Research, 1969