Displacement problem and dynamically scheduling aircraft landings

Beasley, John E.; Krishnamoorthy, Mohan; Sharaiha, Yazid M.; Abramson, David

doi:10.1057/palgrave.jors.2601650

Cited by 110 publications

(75 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…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

Section: Introductionmentioning

confidence: 99%

Aircraft landing problems with aircraft classes

Briskorn

Stolletz

2013

J Sched

View full text Add to dashboard Cite

show abstract

“…They give an extensive literature overview on the aircraft landing problem. In the works [3][4][5], they are considering both single and multiple runway formulations. Their objective is to minimize the (weighted) deviation from the preferred arrival time or the total timespan.…”

Section: Introductionmentioning

confidence: 99%

“…They give a mixed integer programming formulation and use several heuristics to solve the problem, such as using a heuristic upperbound for a three search and restarting the branch and bound algorithm [3] and genetic algorithms [4]. Another article [5] presents a dynamic formulation that includes additional cost for perturbing earlier schedules.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Aircraft Landings at LSS Airport

Diallo¹,

Ndiaye²,

Seck³

2012

AJOR

View full text Add to dashboard Cite

This paper presents a short contribution in air transportation, specifically in scheduling aircraft (plane) landings at Léopol Sédar Senghor (LSS) airport of Dakar. The safety of air navigation of LSS is managed by ASECNA: Agency for Air Navigation Safety in Africa and Madagascar. Scheduling aircraft landing is the problem of deciding a landing time on an appropriate runway for each aircraft in a given set of aircraft such that each aircraft lands within a predetermined time window. The separation criteria between the landing of an aircraft, and the landing of all successive aircraft, are respected. Our objective is to minimize the cost of deviation from the target times. We present a mixed-integer 0 -1 formulation for the single runway case. Numerical experiments and comparisons based on real datasets of LSS airport are presented.

show abstract

“…The authors of [3] use a non-stochastic model in which they minimize waiting time related costs for a fixed set of planes by a mixed-integer approach. [4] presents an approach that tries to take the dynamics of the arrivals into account. A queuing approach is given in [5] where several strategies are compared and simulated.…”

Section: Introductionmentioning

confidence: 99%

On the waiting time of arriving aircrafts and the capacity of airports with one or two runways

Bäuerle

Engelhardt-Funke

Kolonko

2007

European Journal of Operational Research

View full text Add to dashboard Cite

Summary: In this paper we examine a model for the landing procedure of aircrafts at an airport. The characteristic feature here is that due to air turbulence the safety distance between two landing aircrafts depends on the types of these two machines. Hence, an efficient routing of the aircraft to two runways may reduce their waiting time.First, we use M/SM/1 queues (with dependent service times) to model a single runway. We give the stability condition and a formula for the average waiting time of the aircrafts. Moreover, we derive easy to compute bounds on the waiting times by comparison to simpler queuing systems. In particular we study the effect of neglecting the dependency of the service times when using M/G/1-models.We then consider the case of two runways with a number of heuristic routing strategies such as coin flipping, type splitting, Round Robin and variants of the join-the-least-load rule. These strategies are analyzed and compared numerically with respect to the average delay they cause. It turns out that a certain modification of join-the-least-load gives the best results.

show abstract

Displacement problem and dynamically scheduling aircraft landings

Cited by 110 publications

References 14 publications

Aircraft landing problems with aircraft classes

Aircraft landing problems with aircraft classes

Scheduling Aircraft Landings at LSS Airport

On the waiting time of arriving aircrafts and the capacity of airports with one or two runways

Contact Info

Product

Resources

About