D etermination of the Aircraft Landing Sequence by TwoMeta-Heuristic Algorithms

Due to an anticipated increase in air traffic during the next decade, air traffic control in busyairports is one of the main challenges confronting the controllers in the near future. Since the runwayis often a bottleneck in an airport system, there is a great interest in optimizing the use of therunway. The most important factors in aircraft landing modeling are time and cost. For this reason,Aircraft Landing Scheduling Problem (ASLP) is a typical hard multi-constraint optimizationproblem and finding its efficient solution would be very difficult. So in real applications findingthe best solution is not the most important issue and providing a feasible landing schedule in anacceptable time would be the preferred requirement. In this study a three objectives formulation ofthe problem proposed as a mathematical programming model on a runway in static mode. Problemis solved by multi-objective genetic algorithm (NSGA-II) and multi-objective Particle SwarmOptimization Algorithm (MOPSO). Considering a group of 20 aircrafts, this problem is solved andlanding sequence determined and we are shown the obtained sequence does not follow First ComeFirst Serve law for sequencing as well. Finally by comparing results, conclusion and suggestionsare proposed

D etermination of the Aircraft Landing Sequence by TwoMeta-Heuristic Algorithms Keywords:

Aircraft landing scheduling problem , Expected Landing Time (ELT) , ScheduledLanding Time (SLT) , NSGA-II Algorithm , MOPSO Algorithm