An implicit enumeration algorithm for arrival aircraft

Brinton, Chris

doi:10.1109/dasc.1992.282145

Cited by 27 publications

(18 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assigning a runway to the landing/take-off aircraft is a decision made by controllers. The runway assignment is typically dependent on the airport configuration, the direction of arriving aircraft (arrival feeder gate), and departure route of the aircraft which is normally specified by the flight plan (Brinton 1992). While an aircraft approaches the runway, adjustments can be made to the flight plan by assigning the aircraft to an alternative runway, which is known as runway allocation, in order to balance both the landing/take-off on each runway and the controllers' workload.…”

Section: Runway Capacity and Assignmentmentioning

confidence: 99%

“…The sequencing process determines the sequence by which aircraft land or take-off from the set of feasible sequences, while the aim of scheduling is to assign a scheduled landing time (SLT)/scheduled take-off time (STT) to each aircraft in the sequence, subject to maintaining operational and safety constraints (Brinton 1992;Ernst et al 1999). When more than one runway is available for landing or take-off, each aircraft also has to be assigned to a particular runway.…”

Section: Decision Problemsmentioning

confidence: 99%

“…Results shows that the significant improvements in the average delay are achievable through decreasing the throughput so that the delay becomes relatively small. Brinton (1992) introduces one of the first branch-and-bound approaches for the ALP and the runway assignment problem. Static, dynamic, and depth limiting methods are used to reduce the number of tree branches that need to be searched.…”

Section: Dynamic Programmingmentioning

confidence: 99%

See 2 more Smart Citations

Airport runway scheduling

2011

View full text Add to dashboard Cite

Airport runway optimization is an ongoing challenge for air traffic controllers. Since demand for air-transportation is predicted to increase, there is a need to realize additional take-off and landing slots through better runway scheduling. In this paper, we review the techniques and tools of operational research and management science that are used for scheduling aircraft landings and take-offs. The main solution techniques include dynamic programming, branch and bound, heuristics and meta-heuristics.

show abstract

Section: Runway Capacity and Assignmentmentioning

confidence: 99%

Section: Decision Problemsmentioning

confidence: 99%

Section: Dynamic Programmingmentioning

confidence: 99%

See 1 more Smart Citation

Airport runway scheduling

2011

View full text Add to dashboard Cite

show abstract

“…Like Brinton's algorithm [7] , our algorithm also searches for the optimum sequence of aircraft arrivals, but in addition to this, our algorithm applies constraints on the maximum possible delays that could be taken in different sectors by different aircraft, and it also includes airline prioritization. Also, the quadratic cost used in our optimization makes it possible to allocate a heavier cost to delays taken in certain sectors.…”

Section: Introductionmentioning

confidence: 99%

“…To tackle this problem, we develop a combinatorial optimization algorithm, which will find the optimal arrival sequence and the optimal STAs for a sequence of aircraft at a certain reference point, given that the maximum number of position switches from the FCFS order is specified. Brinton [7] gives a branch and bound algorithm which searches for an optimum arrival aircraft sequence. Carr et al [8,9] address the issue of airline prioritization in scheduling aircraft sequences.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Combinatorial Optimization Algorithm for Optimal Scheduling of Aircraft Arrivals at Congested Airports

Saraf

Slater

2006 IEEE Aerospace Conference

View full text Add to dashboard Cite

Aircraft are often required to delay their landing/arrival time at an airport when they are approaching the Terminal Radar Approach Control (TRACON) area, due to airport capacity constraints. In regions like the Northeast (NE) corridor of the US the sectors are small, with shorter controllable time, and these areas involve very complex traffic flows. Hence, many sectors are needed to absorb the required delays and aircraft have to be delayed when they are far away from the airport. Over these long distances, the ability to accurately predict aircraft trajectories is not good enough to compute expected times of arrival with precision, due to uncertain winds and piloting techniques. The existent scheduling system -Traffic Management Advisor -Single Center (TMA-SC) -ignores this uncertainty and schedules the aircraft in the predicted First Come First Served (FCFS) order. This can lead to inefficient aircraft sequences and Scheduled Times of Arrival (STAs). Pilot-in-loop simulations have revealed that at such busy airports, a loosely coupled hierarchy of multiple single point dynamic schedulers, in which scheduling constraints at downstream scheduling points are passed upstream, would be beneficial, because it would eliminate exclusive reliance on distant trajectory estimates. This concept of coupling scheduling over a small region to the scheduling over a bigger outer region is at the core of the new Multi Center TMA (McTMA) system, currently in development at NASA Ames Research Center. However, in all the proposed algorithms for scheduling aircraft in McTMA no consideration has been given to optimizing the arrival aircraft sequences. 1In this paper, we work within such a hierarchial scheduling structure and develop a new efficient scheduling algorithm, which uses combinatorial optimization techniques to find the optimal arrival aircraft sequence and the optimal STAs for the aircraft at a certain reference point, given that the maximum number of position switches from the FCFS order is specified. Scheduling constraints and minimum separation requirements depending on the leading and trailing aircraft types, will be taken care of within the scheduling algorithm. The algorithm will also enable prioritization of aircraft according to airline preferences and it will distribute the allocated delays optimally among all the sectors that lie along the route of the aircraft.

show abstract