The Over-Constrained Airport Gate Assignment Problem
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.
Airlines, Transportation, Tabu search, Simulated annealing
Mathematics | Operations and Supply Chain Management
Computers and Operations Research
DING, Huping; LIM, Andrew; RODRIGUES, Brian; and ZHU, Yejun.
The Over-Constrained Airport Gate Assignment Problem. (2005). Computers and Operations Research. 32, (7), 1867-1880. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2278