Solving the aircraft landing problem with time discretization approach
From MaRDI portal
Publication:2630256
Recommendations
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
- A dynamic programming approach for the aircraft landing problem with aircraft classes
- An algorithm for single- and multiple-runway aircraft landing problem
- Heuristic and exact algorithms for scheduling aircraft landings
- Dynamic scheduling of aircraft landings
Cites work
- Displacement problem and dynamically scheduling aircraft landings
- Genetic search methods in air traffic control
- Heuristic and exact algorithms for scheduling aircraft landings
- scientific article; zbMATH DE number 1951555 (Why is no real title available?)
- 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
Cited in
(15)- Dynamic scheduling of aircraft landings
- Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach
- Methods for solving of the aircraft landing problem. II: Approximate solution methods
- Methods for solving of the aircraft landing problem. I: Exact solution methods
- The aircraft runway scheduling problem: a survey
- Weighted constrained position shift model for aircraft arrival sequencing and scheduling problem
- A dynamic programming approach for the aircraft landing problem with aircraft classes
- An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem
- A 0–1 mixed‐integer program‐based group‐and‐release strategy for solving the integrated runway scheduling and taxiway routing problem
- Heuristics for flights arrival scheduling at airports
- A MILP formulation and a metaheuristic approach for the scheduling of drone landings and payload changes on an automatic platform
- A metaheuristic algorithm for efficient aircraft sequencing and scheduling in terminal maneuvering areas
- A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
- Solving air-ground collaborative scheduling problem in airports: a model-based Monte Carlo tree search approach
This page was built for publication: Solving the aircraft landing problem with time discretization approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630256)