Genetic Hybrids for the Quadratic Assignment Problem

Abstract

A new hybrid procedure that combines genetic operators to existing heuristics is proposed to solve the Quadratic Assignment Problem (QAP). Genetic operators are found to improve the performance of both local search and tabu search. Some guidelines are also given to design good hybrid schemes. These hybrid algorithms are then used to improve on the best known solutions of many test problems in the literature.