Hostname: page-component-848d4c4894-m9kch Total loading time: 0 Render date: 2024-06-07T17:44:54.333Z Has data issue: false hasContentIssue false
  • English
  • Français

Redinv-SA: la simulated annealingfor the quadratic assignment problem

Published online by Cambridge University Press:  15 August 2002

N. M.M. de Abreu ,
T. M. Querido  and
P. O. Boaventura-Netto
N. M.M. de Abreu
Affiliation:
OPPE/UFRJ, CP 68.507, 21.945-970 Rio de Janeiro, RJ, Brazil.
T. M. Querido
Affiliation:
CEFET/RJ, Av. Maracana n 229, 20.271-110 Rio de Janeiro, RJ, Brazil.
P. O. Boaventura-Netto
Affiliation:
OPPE/UFRJ, CP 68.507, 21.945-970 Rio de Janeiro, RJ, Brazil.
Get access

Abstract

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.

Keywords

Quadratic assignment problemmeta-heuristicssimulated annealingand combinatorial programming.
Type
Research Article
Information
RAIRO - Operations Research , Volume 33 , Issue 3 , July 1999 , pp. 249 - 273
Copyright
© EDP Sciences, 1999

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)