UÇAK ÇİZELGELEME PROBLEMİNİN KARINCA KOLONİLERİ OPTİMİZASYONU İLE ÇÖZÜMÜ.

Scheduling aircraft landings is a major problem in air traffic control area of congested airports. It is a special type of machine scheduling problem; processing times are sequence dependent, and there are penalties for jobs that are not completed on target time. Each plane has an allowable predetermined time window for landing. The objective is to optimally land a set of planes on one or several runways in such a way that separation criteria between all pairs of planes are satisfied. If efficient algorithms can be developed to assist the controller who is in charge of making scheduling decisions, then more effective use of fixed runway capacity will result. We tried to solve the problem using Ant System metaheuristic, which is gained more popularity in recent years. Using Ant System metaheuristic, we present a generic decision making tool that can be used both for the single runway and the multiple runway landings and takeoffs. Computational results are presented for the standard test problems obtained from literature. Results are compared with the previous works and show that Ant System solutions can be effective in practice. [ABSTRACT FROM AUTHOR]