Airport traffic management is the source of many optimization problems that have to be solved in real time. This chapter first describes three classical airport problems, namely gate assignment, runway scheduling and surface routing and planning. These problems are highly combinatorial and the use of metaheuristics to solve them is common in the literature. Many runway scheduling problems can be formulated and solved with exact methods using dynamic programming or branch and bound algorithms. For more flexibility (or more realism) in the formulation of the constraints and the objectives of the problem, or to quickly obtain various good solutions on large instances, metaheuristics are also largely applied to the runway optimization problems. Then, a global airport traffic optimization method (mixing the previous problems) is proposed and tested with fast time simulations on Roissy‐CDG and Roma‐Fiumicino airports.
Airport Traffic Management
2015-12-30
21 pages
Article/Chapter (Book)
Electronic Resource
English
Online Contents | 1997
Traffic management system for Dublin Airport
Emerald Group Publishing | 2005
Traffic Management at JFK International Airport
British Library Conference Proceedings | 1993
|