Aircraft and Gate Scheduling Optimization at Airports
Conference Proceeding Article
In this paper, we consider the over-constrained Airport Gate Assignment Problem where the number of flights exceeds the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances or connection times. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions while we devise a new neighborhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducted give good results.
Operations and Supply Chain Management | Transportation
Proceedings of the 37th Annual Hawaii International Conference on System Sciences: Abstracts and CD-ROM of full papers: 5-8 January, 2004, Big Island, Hawaii
City or Country
Big Island, HI
DING, H.; LIM, Andrew; RODRIGUES, Brian; and ZHU, Yi.
Aircraft and Gate Scheduling Optimization at Airports. (2004). Proceedings of the 37th Annual Hawaii International Conference on System Sciences: Abstracts and CD-ROM of full papers: 5-8 January, 2004, Big Island, Hawaii. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2388