An experimental study of variable depth search algorithms for the quadratic assignment problem
This paper introduces a new variable depth search method for the Quadratic Assignment Problem. The new method considers the cost of edges assignment as the criterion to decide which vertices to exchange during local search moves. It also presents the results of an extensive experimental study that c...
Main Authors: | Elizabeth Ferreira Gouvêa Goldbarg, Marco Cesar Goldbarg |
---|---|
Format: | Article |
Language: | English |
Published: |
Sociedade Brasileira de Pesquisa Operacional
2012-04-01
|
Series: | Pesquisa Operacional |
Subjects: | |
Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000100010&lng=en&tlng=en |
Similar Items
-
An experimental study of variable depth search algorithms for the quadratic assignment problem
by: Elizabeth Ferreira Gouvêa Goldbarg, et al.
Published: (2012-04-01) -
Stochastic local search algorithms for single and bi-objective quadratic assignment problems
by: Bin Hussin, Mohamed Saifullah
Published: (2015) -
A 2-Level Iterated Tabu Search Algorithm for the Quadratic Assignment Problem
by: Alfonsas Misevičius, et al.
Published: (2019-10-01) -
A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem
by: Mohamad Amin Kaviani, et al.
Published: (2014-06-01) -
Robust quadratic assignment problem with budgeted uncertain flows
by: Mohammad Javad Feizollahi, et al.
Published: (2015-12-01)