Solving the flight perturbation problem with meta heuristics
From MaRDI portal
Publication:2491332
DOI10.1007/s10732-006-4833-4zbMath1122.90346OpenAlexW2089719823MaRDI QIDQ2491332
Publication date: 29 May 2006
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17062
Tabu searchSimulated annealingPath relinkingIrregular operationsAircraft recoveryOperational airline scheduling
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Review of real-time vehicle schedule recovery methods in transportation services, Two-stage heuristic algorithm for aircraft recovery problem, Disruption management in the airline industry-concepts, models and methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Optimal dispatching strategy on an airline network after a schedule perturbation
- Multifleet routing and multistop flight scheduling for schedule perturbation
- Some experiments with simulated annealing techniques for packing problems
- A GRASP for aircraft routing in response to groundings and delays
- How airlines and airports recover from schedule perturbations: A survey
- Future paths for integer programming and links to artificial intelligence
- Path relinking for the vehicle routing problem
- Bandwidth Packing: A Tabu Search Approach
- A Stochastic Model of Airline Operations