An algorithm for computer assisted sequencing and scheduling of terminal area operations

Dear, Roger G.; Sherif, Yosef S.

doi:10.1016/0191-2607(91)90132-a

Cited by 79 publications

(41 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, an aircraft in the 16th position in a FCFS queue would have to land in one of the positions 14-18 if the specified maximum position shift (MPS) is 2. Through many numerical examples and for several reasonable objective functions, Dear (1976) showed that by setting MPS to a small number, such as two or three, one can obtain most of the benefits of an unconstrained optimized system (e.g., 60%-80% of the potential improvements). This finding motivated several researchers (e.g., Psaraftis 1980, Venkatakrishnan et al 1992, Bianco et al 2001 to investigate a number of increasingly complex and realistic versions of the sequencing problem.…”

Section: Airside Operationsmentioning

confidence: 99%

“…Dear (1976) and Dear and Sherif (1991) developed the concept of constrained position shifting (CPS), i.e., of a limit in the number of positions by which an aircraft can deviate from its FCFS position in a queue. For instance, an aircraft in the 16th position in a FCFS queue would have to land in one of the positions 14-18 if the specified maximum position shift (MPS) is 2.…”

Section: Airside Operationsmentioning

confidence: 99%

See 1 more Smart Citation

Applications of Operations Research in the Air Transport Industry

Barnhart

Belobaba

Odoni

2003

Transportation Science

236

121

View full text Add to dashboard Cite

T his paper presents an overview of several important areas of operations research applications in the air transport industry. Specific areas covered are: the various stages of aircraft and crew schedule planning; revenue management, including overbooking and legbased and network-based seat inventory management; and the planning and operations of aviation infrastructure (airports and air traffic management). For each of these areas, the paper provides a historical perspective on OR contributions, as well as a brief summary of the state of the art. It also identifies some of the main challenges for future research.

show abstract

Section: Airside Operationsmentioning

confidence: 99%

Section: Airside Operationsmentioning

confidence: 99%

Applications of Operations Research in the Air Transport Industry

Barnhart

Belobaba

Odoni

2003

Transportation Science

236

121

View full text Add to dashboard Cite

show abstract

“…For an overview of approaches for the dynamic version we refer to Beasley et al [4] and Dear and Sherif [7]. Psaraftis [13,14] developed a dynamic programming formulation of the ALP with successive separation for single runways with E a = 0, i.e., all aircraft are available to land at time 0.…”

Section: Introductionmentioning

confidence: 99%

Aircraft landing problems with aircraft classes

Briskorn

Stolletz

2013

J Sched

View full text Add to dashboard Cite

This paper focuses on the aircraft landing problem that is to assign landing times to aircraft approaching the airport under consideration. Each aircraft's landing time must be in a time interval encompassing a target landing time. If the actual landing time deviates from the target landing time additional costs occur which depend on the amount of earliness and lateness, respectively. The objective is to minimize overall cost. We consider the set of aircraft being partitioned into aircraft classes such that two aircraft of the same class are equal with respect to wake turbulence. We develop algorithms to solve the corresponding problem. Analyzing the worst case run time behavior, we show that our algorithms run in polynomial time for fairly general cases of the problem.Moreover, we present integer programming models. We show by means of a computational study how optimality properties can be used to increase efficiency of standard solvers.

show abstract

“…For example, if the maximum position shift allowed were two, an aircraft that is in the eighth position in the FCFS order can be placed at the sixth, seventh, eighth, ninth, or tenth position in the new order. Several researchers in both the United States and Europe have since used CPS to model fairness and worked toward developing fast solution techniques for scheduling within the CPS framework [1], [7], [13]. While some variants of CPS were shown to be solvable in polynomial time [14], [15], they were unable to handle all the operational constraints that arose in practice [16].…”

Section: Introductionmentioning

confidence: 99%

A Study of Tradeoffs in Scheduling Terminal-Area Operations

Lee

Balakrishnan

2008

Proc. IEEE

View full text Add to dashboard Cite

| The terminal area surrounding an airport is an important component of the air transportation system, and efficient terminal-area schedules are essential for accommodating the projected increase in air traffic demand. Aircraft arrival schedules are subject to a variety of operational constraints, such as minimum separation for safety, required arrival time-windows, limited deviation from a first-come firstserved sequence, and precedence constraints. There is also a range of objectives associated with multiple stakeholders that could be optimized in these schedules; the associated tradeoffs are evaluated in this paper. A dynamic programming algorithm for determining the minimum cost arrival schedule, given aircraft-dependent delay costs, is presented. The proposed approach makes it possible to determine various tradeoffs in terminal-area operations. A comparison of maximum throughput and minimum average delay schedules shows that the benefit from maximizing throughput could be at the expense of an increase in average delay, and that minimizing delay is the more advantageous of the two objectives in most cases. A comprehensive analysis of the tradeoffs between throughput and fuel costs and throughput and operating costs is conducted, accounting for both the cost of delay (as reported by the airlines) and the cost of speeding up when possible (from models of aircraft performance).

show abstract

An algorithm for computer assisted sequencing and scheduling of terminal area operations

Cited by 79 publications

References 5 publications

Applications of Operations Research in the Air Transport Industry

Applications of Operations Research in the Air Transport Industry

Aircraft landing problems with aircraft classes

A Study of Tradeoffs in Scheduling Terminal-Area Operations

Contact Info

Product

Resources

About