Genetic algorithm hybridized with ruin and recreate procedure: application to the quadratic assignment problem

摘要

Genetic algorithms (GAs) are among the widely used in various areas of computer science, including optimization problems. In this paper, we propose a GA hybridized with so-called ruin and recreate (R and R) procedure. We have applied this new hybrid strategy 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 belongs to the best heuristics for the QAP. The power of this algorithm is also demonstrated by the fact that the new best known solutions were found for several QAP instances.