Genetic algorithm and tabu search: A hybrid strategy

Abstract The appearance of genetic algorithm and tabu search provides powerful tools for solving combinatorial optimization problems in high dimensional spaces. Two methods either have some common bonds, or significant differences. Through analyzing, a hybrid strategy is developed. The memory function of tabu search is introduced into genetic searching procedure and a new recombination operator is constructed, while mutation operator is replaced by tabu search procedure. The experiment results show that the hybrid strategy is superior to the standard genetic algorithm in many aspects.