Solving the flight perturbation problem with meta heuristics
From MaRDI portal
Publication:2491332
Recommendations
- scientific article; zbMATH DE number 2079913
- Using heuristics to solve the dedicated aircraft recovery problem
- Metaheuristics approach to the aircrew rostering problem
- A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems
- Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem
Cites work
- A GRASP for aircraft routing in response to groundings and delays
- A Stochastic Model of Airline Operations
- Bandwidth Packing: A Tabu Search Approach
- Future paths for integer programming and links to artificial intelligence
- How airlines and airports recover from schedule perturbations: A survey
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 2079913 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- Multifleet routing and multistop flight scheduling for schedule perturbation
- Optimal dispatching strategy on an airline network after a schedule perturbation
- Optimization by simulated annealing
- Path relinking for the vehicle routing problem
- Some experiments with simulated annealing techniques for packing problems
Cited in
(4)
This page was built for publication: Solving the flight perturbation problem with meta heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491332)