An Efficient Algorithm for Scheduling Aircraft Landing Problem

An efficient heuristic algorithm with polynomial computational complexity developed for solving the aircraft static landing problem (ALP) is proposed in this paper. The optimal solution of ALP is considered for the case where a set of aircraft is available for landing. The problem is considered under specific constraints. Three test instances with 10, 20, and 30 landing airplanes were solved. For each of them, three variants were solved: 1) landing on one runway, 2) landing on two runways, and 3) landing on three runways. Optimal solutions were obtained for all test instances. A comparison of the obtained results with those of a genetic algorithm is discussed. The proposed novel algorithm is efficient and can successfully solve larger problems with a larger number of landing aircraft and more runways.