An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem
From MaRDI portal
Publication:507977
DOI10.1016/j.cam.2016.11.043zbMath1381.90041OpenAlexW2560283290MaRDI QIDQ507977
Publication date: 9 February 2017
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2016.11.043
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
A self-learning approach for optimal detailed scheduling of multi-product pipeline ⋮ The aircraft runway scheduling problem: a survey ⋮ Methods for solving of the aircraft landing problem. II: Approximate solution methods
Uses Software
Cites Work
- A dynamic programming approach for the aircraft landing problem with aircraft classes
- An efficient approximation algorithm for aircraft arrival sequencing and scheduling problem
- Solving the aircraft landing problem with time discretization approach
- Scheduling Aircraft Landings—The Static Case
- Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem