Solving the flight perturbation problem with meta heuristics
2006 (English)In: Journal of Heuristics, ISSN 1381-1231, Vol. 12, no 1-2, 37-53 p.Article in journal (Refereed) Published
When there is a perturbation in a carefully constructed aircraft schedule, e.g. an aircraft breakdown, it is important to minimize the negative consequences of this disturbance. Here, a tabu search and a simulated annealing approach to the flight perturbation problem are presented. The heuristics use a tree-search algorithm to find new schedules for the aircraft, and utilize a path relinking strategy to explore paths between structurally different solutions. The computational results indicate that the solution strategies, especially the tabu search, can be successfully used to solve the flight perturbation problem.
Place, publisher, year, edition, pages
2006. Vol. 12, no 1-2, 37-53 p.
Aircraft recovery - Irregular operations - Operational airline scheduling - Simulated annealing - Tabu search - Path relinking
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-17062DOI: 10.1007/s10732-006-4833-4OAI: oai:DiVA.org:liu-17062DiVA: diva2:201519
The original publication is available at www.springerlink.com:
Tobias Andersson Granberg, Solving the flight perturbation problem with meta heuristics, 2006, Journal of Heuristics, (12), 1-2, 37-53.
Copyright: Springer Science Business Media