Aircraft and Gate Scheduling Optimization at Airports
Publication Type
Conference Proceeding Article
Publication Date
2004
Abstract
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.
Discipline
Operations and Supply Chain Management | Transportation
Research Areas
Operations Management
Publication
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
ISBN
9780769520568
Identifier
10.1109/HICSS.2004.1265219
Publisher
IEEE
City or Country
Big Island, HI
Citation
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.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/2388