Planning Aircraft Movements in Airports with Constraint Satisfaction

Abstract

Currently, the European air transport system is experiencing an annual growth of 7%. With an increasing number of flights, airports are reaching their capacity limits and are becoming a bottleneck in the system. Mantea is a European Commission funded project dealing with this issue. This paper focuses on planning decision support tools for airport traffic controllers.

The objective of our planning tools is to achieve a better use of the available airport infrastructure (taxiways and runways). To generate a safe plan, many rules must be taken into account that restrict the usage of airport tarmac: international regulations, airport operational procedures, aircraft performance, weather conditions and sometimes even controller “usual practices”. To generate a realistic plan, extensive monitoring of the traffic situation as well as suitable timing must be achieved. In the life cycle of a flight, 11 out of 15 possible causes of delay occur in an interval of 10-20 minutes, between aircraft start-up request and push-back. This means that precise planning before the end of this period is highly improbable. On the other hand, planning after this period implies the need for fast responses from the system.

In the Mantea project, an architecture is proposed in which a co-operative approach is taken towards planning aircraft movements at the airport. Controllers will be supported by planning tools that help assigning routes and departure times to controlled vehicles, in planning runway allocation (departure sequence) and occupancies, and in monitoring plan progress during flight phases. The planning horizon relates to medium term operations, i.e. 2-20 minutes ahead. The Mantea planning tools implement the following functions: runway departure planning, routing, and plan conformance monitoring. The tools will reduce the controller's workload, increase the level of safety for airport surface movements, and reduce the number of delays and operating costs for the airliners.

In this paper, we will focus on the constraint satisfaction programming techniques used in Mantea for (1) runway departure planning, (2) itinerary search and taxi planning functions. The airport tarmac and runway vicinity air routes have been modelled as a graph. Real time constraints have brought us to develop an algorithm linear in complexity for the itinerary search problem. Operational pressure has led us to develop fast search strategies for scheduling (i.e. use of heuristics, hill climbing…).

Citation

Hesselink*, H.H. and Paul**, S. (1998), "Planning Aircraft Movements in Airports with Constraint Satisfaction", Griffiths, J.D. (Ed.) Mathematics in Transport Planning and Control, Emerald Group Publishing Limited, Leeds, pp. 391-400. https://doi.org/10.1108/9780585474182-038