Redinv-SA: la simulated annealing for the quadratic assignment problem

N. M.M. de Abreu; T. M. Querido; P. O. Boaventura-Netto

RAIRO - Operations Research (2010)

  • Volume: 33, Issue: 3, page 249-273
  • ISSN: 0399-0559

Abstract

top
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.

How to cite

top

de Abreu, N. M.M., Querido, T. M., and Boaventura-Netto, P. O.. "Redinv-SA: la simulated annealing for the quadratic assignment problem ." RAIRO - Operations Research 33.3 (2010): 249-273. <http://eudml.org/doc/197814>.

@article{deAbreu2010,
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. },
author = {de Abreu, N. M.M., Querido, T. M., Boaventura-Netto, P. O.},
journal = {RAIRO - Operations Research},
keywords = {Quadratic assignment problem; meta-heuristics; simulated annealing; and combinatorial programming. ; combinatorial programming; quadratic assignment problem; simulated annealing-type heuristic},
language = {eng},
month = {3},
number = {3},
pages = {249-273},
publisher = {EDP Sciences},
title = {Redinv-SA: la simulated annealing for the quadratic assignment problem },
url = {http://eudml.org/doc/197814},
volume = {33},
year = {2010},
}

TY - JOUR
AU - de Abreu, N. M.M.
AU - Querido, T. M.
AU - Boaventura-Netto, P. O.
TI - Redinv-SA: la simulated annealing for the quadratic assignment problem
JO - RAIRO - Operations Research
DA - 2010/3//
PB - EDP Sciences
VL - 33
IS - 3
SP - 249
EP - 273
AB - 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.
LA - eng
KW - Quadratic assignment problem; meta-heuristics; simulated annealing; and combinatorial programming. ; combinatorial programming; quadratic assignment problem; simulated annealing-type heuristic
UR - http://eudml.org/doc/197814
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.