| Article ID: | iaor20127621 |
| Volume: | 33 |
| Issue: | 3 |
| Start Page Number: | 249 |
| End Page Number: | 273 |
| Publication Date: | Jul 1999 |
| Journal: | RAIRO - Operations Research |
| Authors: | de Abreu N M M, Querido T M, Boaventura-Netto P O |
| Keywords: | optimization: simulated annealing, programming: quadratic, heuristics, programming: assignment |
An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced theoretical results that can be applied to (meta) heuristics to give them information about the problem structure, allowing the construction of algorithms. In this paper those results were applied to inform a Simulated Annealing‐type heuristic (which we called RedInv‐SA). Some results from tests with known literature instances are presented.