The dynamic scheduling of aircraft in high density terminal areas

Dear, Roger G.; Sherif, Yosef S.

doi:10.1016/0026-2714(89)90171-6

Cited by 40 publications

(22 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraints (8) and (9) ensure that if aircraft is assigned to position , then the runway usage time for position is within the time window of aircraft .…”

Section: Mathematical Formulationmentioning

confidence: 99%

“…Other papers also address the aircraft landing problem as a job-shop scheduling problem [5][6][7] using a mixed integer formulation. Constraint Position Shifting (CPS) has been proposed for the dynamic scheduling of arrival aircraft along with heuristics to solve it 8 . The idea of CPS was further incorporated into a dynamic programming approach for scheduling aircraft landings 9 and was later extended to departure scheduling 10 .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Effect of Uncertainty on Deterministic Runway Scheduling

Gupta

Malik

Jung

2011

11th AIAA Aviation Technology, Integration, and Operations (ATIO) Conference

View full text Add to dashboard Cite

Active runway scheduling involves scheduling departures for takeoffs and arrivals for runway crossing subject to numerous constraints. This paper evaluates the effect of uncertainty on a deterministic runway scheduler. The evaluation is done against a firstcome-first-serve scheme. In particular, the sequence from a deterministic scheduler is frozen and the times adjusted to satisfy all separation criteria; this approach is tested against FCFS. The comparison is done for both system performance (throughput and system delay) and predictability, and varying levels of congestion are considered. The modeling of uncertainty is done in two ways: as equal uncertainty in availability at the runway as for all aircraft, and as increasing uncertainty for later aircraft. Results indicate that the deterministic approach consistently performs better than first-come-first-serve in both system performance and predictability.

show abstract

“…Constraints (8) and (9) ensure that if aircraft is assigned to position , then the runway usage time for position is within the time window of aircraft .…”

Section: Mathematical Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Effect of Uncertainty on Deterministic Runway Scheduling

Gupta

Malik

Jung

2011

11th AIAA Aviation Technology, Integration, and Operations (ATIO) Conference

View full text Add to dashboard Cite

show abstract

“…A shortcoming of this previous work is that scheduling between successive aircraft is based on a constant separation time rather than separation based on weight class. Constraint Position Shifting (CPS) has been proposed for the dynamic scheduling of arrival aircraft, along with heuristics to solve it 7 . The idea of CPS was further incorporated into a dynamic programming approach for scheduling aircraft landings 8 and was later extended to departure scheduling 9 .…”

Section: Introductionmentioning

confidence: 99%

A Mixed Integer Linear Program for Airport Departure Scheduling

Gupta

Malik

Jung

2009

9th AIAA Aviation Technology, Integration, and Operations Conference (ATIO)

View full text Add to dashboard Cite

A mixed integer linear program is presented for deterministically scheduling departure aircraft at runways. The method addresses different schemes of managing the departure queuing area by treating it as first-in-first-out queues or as a simple parking area, where any available aircraft can take-off irrespective of its relative sequence with others. The method explicitly considers separation criteria between successive departures and also incorporates an optional prioritization scheme using time windows. Multiple objectives pertaining to throughput, system delay and maximum individual delay are used. Results indicate minimizing system delay alone improves throughput over a basic first-come-first-serve rule. Modifications for computational efficiency are also presented in the form of re-formulating certain constraints and defining additional inequalities for better bounds.

show abstract

“…It should be noticed that all aircraft are required to maintain a safe separation distance, or separation standards which are a function of the landing velocities of the leading and following aircraft as well as the size of the aircraft involved at the final approach, among other factors. 6 Before the approach takes place, each aircraft must be assigned with a landing time and a runway number. The landing time corresponds to a time window, bounded by an earliest and a latest time of arrival.…”

Section: Previous Related Workmentioning

confidence: 99%

Topology design for integrating and sequencing flows in terminal maneuvering area

Chida

Zúñiga²,

Delahaye

2016

Proceedings of the Institution of Mechanical Engineers, Part G:

View full text Add to dashboard Cite

The current overloaded airspace near large airports leads the stakeholders to develop more fundamental means to improve the use of available air capacity in dense traffic areas as terminal maneuvering area. A smart planning of aircraft trajectories and an appropriate designing of route structure can be a solution. Therefore, to analyze the capability of them, this paper proposes a novel approach to deal with the merging and sequencing problem of arrival traffic in terminal maneuvering area, and examines the performance of diverse conflict resolution strategies and different terminal maneuvering area route structure. An evolutionary algorithm is employed to resolve potential conflicts, altering one or more of the following decision variables: routes, speeds, and entrance time to terminal maneuvering area (slot). Two different fitness functions were developed. One aims to minimize potential conflicts and the other one aims to minimize at the same time potential conflicts and delay induced at runway. The performance of different combinations of decision variables, or conflict resolution strategies, is evaluated through a set of arrival aircraft to Grand Canaria airport. Also, four different route structures are tested by using the same set of incoming aircraft. The results showed that the slot and speed change and mix of all change strategies can successfully resolve all conflicts in an efficient manner. The results also suggested that topologies with one main merging point are more efficient than the ones that have two merging points. Finally, a significant abatement of delay was observed when minimizing conflicts and delay while achieving conflict-free solutions.

show abstract

The dynamic scheduling of aircraft in high density terminal areas

Cited by 40 publications

References 3 publications

Effect of Uncertainty on Deterministic Runway Scheduling

Effect of Uncertainty on Deterministic Runway Scheduling

A Mixed Integer Linear Program for Airport Departure Scheduling

Topology design for integrating and sequencing flows in terminal maneuvering area

Contact Info

Product

Resources

About