Solving the flight perturbation problem with meta heuristics

DOI10.1007/s10732-006-4833-4zbMath1122.90346MaRDI QIDQ2491332

Tobias Andersson

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

zbMATH Keywords

Tabu search; Simulated annealing; Path relinking; Irregular operations; Aircraft recovery; Operational airline scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Review of real-time vehicle schedule recovery methods in transportation services, Disruption management in the airline industry-concepts, models and methods, Two-stage heuristic algorithm for aircraft recovery problem

Uses Software

• Tabu search

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