A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes

DOI10.1016/J.EJOR.2018.04.021MaRDI QIDQ724035zbMATH OpenOpenAlexWikidataFDO

Authors Alain Faye

Publication date 25 July 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2018.04.021

zbMATH Keywords

dynamic programmingpolynomial-time algorithmOR in airlineslanding timesaircraft landing problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Heuristic and exact algorithms for scheduling aircraft landings
• A dynamic programming approach for the aircraft landing problem with aircraft classes
• Solving the aircraft landing problem with time discretization approach
• An algorithm for single- and multiple-runway aircraft landing problem
• An efficient approximation algorithm for aircraft arrival sequencing and scheduling problem
• Aircraft sequencing problems via a rolling horizon algorithm
• Displacement problem and dynamically scheduling aircraft landings
• Optimal Algorithms and a Remarkably Efficient Heuristic for the Ground-Holding Problem in Air Traffic Control
• Genetic algorithm for solving the problem of optimizing aircraft landing sequence and times
• An optimal data-splitting algorithm for aircraft sequencing on a single runway

Cites work

• scientific article; zbMATH DE number 41026 (Why is no real title available?)
• scientific article; zbMATH DE number 1951555 (Why is no real title available?)
• An efficient hybrid meta-heuristic for aircraft landing problem
• Displacement problem and dynamically scheduling aircraft landings
• Dynamic scheduling of aircraft landings
• Genetic search methods in air traffic control
• Heuristic and exact algorithms for scheduling aircraft landings
• Obtaining test problems via Internet
• Runway sequencing with holding patterns
• Scatter search and bionomic algorithms for the aircraft landing problem
• Scheduling aircraft landings -- the static case
• Scheduling aircraft landings at London Heathrow using a population heuristic
• Scheduling aircraft landings using airlines' preferences
• Scheduling models for air traffic control in terminal areas
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• Solving the aircraft landing problem with time discretization approach

Cited in

(8)

• An algorithm for single- and multiple-runway aircraft landing problem
• Aircraft landing problems with aircraft classes
• The aircraft runway scheduling problem: a survey
• A dynamic programming approach for the aircraft landing problem with aircraft classes
• Solving the aircraft landing problem with time discretization approach
• An optimal data-splitting algorithm for aircraft sequencing on a single runway
• Dynamic scheduling of aircraft landings
• Heuristic and exact algorithms for scheduling aircraft landings

This page was built for publication: A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724035)