Solving the flight perturbation problem with meta heuristics
作者: Tobias Andersson
作者单位: 1Department of Science and Technology, Linköpings Universitet
刊名: Journal of Heuristics, 2006, Vol.12 (1-2), pp.37-53
来源数据库: Springer Nature Journal
DOI: 10.1007/s10732-006-4833-4
关键词: Aircraft recoveryIrregular operationsOperational airline schedulingSimulated annealingTabu searchPath relinking
英文摘要: Abstract(#br)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.
全文获取路径: Springer Nature  (合作)
影响因子:1.471 (2012)

  • problem 题目
  • heuristics 试探
  • perturbation 扰动
  • flight 飞行