Article ID: | iaor20011987 |
Country: | Lithuania |
Volume: | 11 |
Issue: | 2 |
Start Page Number: | 145 |
End Page Number: | 162 |
Publication Date: | Apr 2000 |
Journal: | Informatica |
Authors: | Misevicius Alfonsas |
Keywords: | quadratic assignment, Intensive search, metaheuristics |
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic algorithm, which is applied to the quadratic assignment problem. We refer to this algorithm as intensive search algorithm (or briefly intensive search). We tested our algorithm on the various instances from the library of the QAP instances – QAPLIB. The results obtained from the experiments show that the proposed algorithm appears superior, in many cases, to the well-known algorithm – simulated annealing.