| Article ID: | iaor2006895 |
| Country: | United Kingdom |
| Volume: | 32 |
| Issue: | 7 |
| Start Page Number: | 1867 |
| End Page Number: | 1880 |
| Publication Date: | Jul 2005 |
| Journal: | Computers and Operations Research |
| Authors: | Zhu Y., Ding H., Lim A., Rodrigues B. |
| Keywords: | allocation: resources, heuristics, optimization: simulated annealing |
In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated flights and total walking distances or connection times. We first use a greedy algorithm to minimize ungated flights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used. Experimental results are good and exceed those previously obtained.