Anagnostakis, Ioannis | Engineering Papers

NASA NTRS2003

Runway Operations Planning: A Two-Stage Heuristic Algorithm

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented.

Anagnostakis, Ioannis↗

NASA NTRS2003

Runway Operations Planning: A Two-Stage Solution Methodology

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. Thus, Runway Operations Planning (ROP) is a critical component of airport operations planning in general and surface operations planning in particular. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, may be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. Generating optimal runway operations plans was approached in with a 'one-stage' optimization routine that considered all the desired objectives and constraints, and the characteristics of each aircraft (weight class, destination, Air Traffic Control (ATC) constraints) at the same time. Since, however, at any given point in time, there is less uncertainty in the predicted demand for departure resources in terms of weight class than in terms of specific aircraft, the ROP problem can be parsed into two stages. In the context of the Departure Planner (OP) research project, this paper introduces Runway Operations Planning (ROP) as part of the wider Surface Operations Optimization (SOO) and describes a proposed 'two stage' heuristic algorithm for solving the Runway Operations Planning (ROP) problem. Focus is specifically given on including runway crossings in the planning process of runway operations. In the first stage, sequences of departure class slots and runwy crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program. Preliminary results from the algorithm implementation on real-world traffic data are included.

Anagnostakis, Ioannis↗

NASA NTRS2000

A Conceptual Design of a Departure Planner Decision Aid

Terminal area Air Traffic Management handles both arriving and departing traffic. To date, research work on terminal area operations has focused primarily on the arrival flow and typically departures are taken into account only in an approximate manner. However, arrivals and departures are highly coupled processes especially in the terminal airspace, with complex interactions and sharing of the same airport resources between arrivals and departures taking place in practically every important terminal area. Therefore, the addition of automation aids for departures, possibly in co-operation with existing arrival flow automation systems, could have a profound contribution in enhancing the overall efficiency of airport operations. This paper presents the conceptual system architecture for such an automation aid, the Departure Planner (DP). This architecture can be used as a core in the development of decision-aiding systems to assist air traffic controllers in improving the performance of departure operations and optimize runway time allocation among different operations at major congested airports. The design of such systems is expected to increase the overall efficiency of terminal area operations and yield benefits for all stakeholders involved in Air Traffic Management (ATM) operations, users as well as service providers.

Anagnostakis, Ioannis↗