Scatter search and bionomic algorithms for the aircraft landing problem

摘要

In this paper, the multiple runway case of the static aircraft landing problem is considered. Here the set of aircraft that are waiting to land is known which is in contrast with the dynamic case where decisions about each aircraft must be made as time passes, aircraft land and the new aircraft appear. Population-based heuristics mixed with problem specific knowledge techniques and the scatter search and bionomic algorithm are applied to the problem. Computational results show that feasible solutions of good quality can be produced relatively quickly. (30 refs.)