An improved hybrid genetic algorithm: new results for the quadratic assignment problem
In this paper, we propose an improved hybrid genetic algorithm (IHGA). It uses a robust local improvement procedure as well as an effective restart mechanism that is based on so-called shift mutations. IHGA has been applied to the well-known combinatorial optimization problem, the quadratic assignment problem (QAP). The results obtained from the experiments on different QAP instances show that the proposed algorithm appears to be superior to other approaches that are among the best algorithms for the QAP. The high efficiency of our algorithm is also corroborated by the fact that new record-breaking solutions were obtained for a number of large real-life instances.
genetic algorithms quadratic assignment problem combinatorial optimization