AIAA Guidance, Navigation, and Control Conference 2011
DOI: 10.2514/6.2011-6380
|View full text |Cite
|
Sign up to set email alerts
|

Runway Scheduling Using Generalized Dynamic Programming

Abstract: A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway flight sequences that are optimal for both runway throughput and delay. Realistic timebased operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
8
1
1

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 15 publications
0
8
1
1
Order By: Relevance
“…The core computational engine behind SARDA, called the SARDA scheduler, is based on the Spot Release Planner (SRP) [W. Malik et al, 2012], a method to provide metering advisories. SRP is a twostage algorithm: The first stage is a runway scheduler [G. Gupta et al, 2010;J. Montoya et al, 2011], which gives the best sequence and times for runway usage by a set of departure aircraft ready for take-off and arrival aircraft waiting to cross the same departure runway.…”
Section: Sarda Schedulermentioning
confidence: 99%
“…The core computational engine behind SARDA, called the SARDA scheduler, is based on the Spot Release Planner (SRP) [W. Malik et al, 2012], a method to provide metering advisories. SRP is a twostage algorithm: The first stage is a runway scheduler [G. Gupta et al, 2010;J. Montoya et al, 2011], which gives the best sequence and times for runway usage by a set of departure aircraft ready for take-off and arrival aircraft waiting to cross the same departure runway.…”
Section: Sarda Schedulermentioning
confidence: 99%
“…This can be alleviated by adding more route options, thereby introducing an extra degree of freedom to the scheduler, and expanding the solution space. Many surface scheduling algorithms consider multiple route options along taxiways between spot and runway [34][35][36][37][38]. Fewer airspace schedulers consider multiple route options for a given aircraft between the same meter fix/runway pair [39][40][41].…”
Section: Expand Route Optionsmentioning
confidence: 99%
“…The main purpose of the DFW RS presented in previous SARDA research experiments is to determine a sequence of operations that optimizes a delay or throughput objective. [2][3][4][7][8][9] Three different objectives have been evaluated (i) minimize system delay, (ii) maximize throughput, and (iii) minimize maximum delay. 4 The DFW RS assigned each aircraft to one of the queues in the runway queuing area, as well as provided optimum sequencing and timing decisions for departures and crossings on the runway system.…”
Section: Dfw Sarda Runway Schedulermentioning
confidence: 99%