Computers and Operations Research
P-Complete Approximation Problems
Journal of the ACM (JACM)
ACO algorithms for the quadratic assignment problem
New ideas in optimization
Record breaking optimization results using the ruin and recreate principle
Journal of Computational Physics
A greedy genetic algorithm for the quadratic assignment problem
Computers and Operations Research
QAPLIB – A Quadratic Assignment ProblemLibrary
Journal of Global Optimization
Adaptive memories for the Quadratic Assignment Problems
Adaptive memories for the Quadratic Assignment Problems
Hi-index | 0.00 |
In this paper, we propose an algorithm based on so-called ruin and recreate (R&R) principle. The R&R approach is conceptual simple but at the same time powerful meta-heuristic for combinatorial optimization problems. The main components of this method are a ruin (mutation) procedure and a recreate (improvement) procedure. We have applied the R&R principle based algorithm for a well-known combinatorial optimization problem, the quadratic assignment problem (QAP). We tested this algorithm on a number of instances from the library of the QAP instances - QAPLIB. The results obtained from the experiments show that the proposed approach appears to be significantly superior to a "pure" tabu search on real-life and real-life like QAP instances.