Solving the aircraft landing problem with time discretization approach
From MaRDI portal
Publication:2630256
DOI10.1016/j.ejor.2014.10.064zbMath1341.90044OpenAlexW1977680864MaRDI QIDQ2630256
Publication date: 26 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.10.064
mixed integer programmingtime discretizationaircraft landing problemdynamic constraint generation algorithm
Related Items (10)
The aircraft runway scheduling problem: a survey ⋮ 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 ⋮ Dynamic scheduling of aircraft landings ⋮ An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem ⋮ A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes ⋮ Methods for solving of the aircraft landing problem. II: Approximate solution methods ⋮ Weighted Constrained Position Shift Model for Aircraft Arrival Sequencing and Scheduling Problem ⋮ Solving the time-discrete winter runway scheduling problem: a column generation and constraint programming approach ⋮ Methods for solving of the aircraft landing problem. I: Exact solution methods
Cites Work
- Unnamed Item
- Unnamed Item
- Scatter search and bionomic algorithms for the aircraft landing problem
- Scheduling models for air traffic control in terminal areas
- Genetic search methods in air traffic control
- Obtaining test problems via Internet
- Runway sequencing with holding patterns
- Scheduling aircraft landings using airlines' preferences
- Scheduling Aircraft Landings—The Static Case
- Scheduling aircraft landings at London Heathrow using a population heuristic
- Displacement problem and dynamically scheduling aircraft landings
This page was built for publication: Solving the aircraft landing problem with time discretization approach
