A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem

2003 ◽  
Author(s):  
P. Merz ◽  
B. Freisleben
Keyword(s):  
Tabu Search ◽  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Memetic Algorithms ◽  
Quadratic Assignment ◽  
Ant Colonies

scholarly journals Parallel Ant Colonies for the quadratic assignment problem

2001 ◽  
Vol 17 (4) ◽  
pp. 441-449 ◽  
Author(s):  
E.-G. Talbi ◽  
O. Roux ◽  
C. Fonlupt ◽  
D. Robillard
Keyword(s):  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Ant Colonies

AN IMPROVED HYBRID OPTIMIZATION ALGORITHM FOR THE QUADRATIC ASSIGNMENT PROBLEM

2005 ◽  
Vol 9 (2) ◽  
pp. 149-168 ◽  
Author(s):  
A. Misevičius
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Optimization Algorithm ◽  
Assignment Problem ◽  
Optimization Problem ◽  
Heuristic Algorithms ◽  
Quadratic Assignment Problem ◽  
Hybrid Optimization ◽  
Quadratic Assignment ◽  
Hybrid Optimization Algorithm

In this paper, we present an improved hybrid optimization algorithm, which was applied to the hard combinatorial optimization problem, the quadratic assignment problem (QAP). This is an extended version of the earlier hybrid heuristic approach proposed by the author. The new algorithm is distinguished for the further exploitation of the idea of hybridization of the well‐known efficient heuristic algorithms, namely, simulated annealing (SA) and tabu search (TS). The important feature of our algorithm is the so‐called “cold restart mechanism”, which is used in order to avoid a possible “stagnation” of the search. This strategy resulted in very good solutions obtained during simulations with a number of the QAP instances (test data). These solutions show that the proposed algorithm outperforms both the “pure” SA/TS algorithms and the earlier author's combined SA and TS algorithm. Key words: hybrid optimization, simulated annealing, tabu search, quadratic assignment problem, simulation.

scholarly journals A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem

2014 ◽  
Vol 3 (3) ◽  
pp. 391-396 ◽  
Author(s):  
Mohamad Amin Kaviani ◽  
Mehdi Abbasi ◽  
Bentolhoda Rahpeyma ◽  
Mohamad Mehdi Yusefi
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Simulated Annealing Method ◽  
Annealing Method

scholarly journals A new heuristic for the quadratic assignment problem

2002 ◽  
Vol 6 (3) ◽  
pp. 143-153 ◽  
Author(s):  
Zvi Drezner
Keyword(s):  
Genetic Algorithms ◽  
Tabu Search ◽  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Test Problems ◽  
Heuristic Procedures

We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.

Ant Colonies for the Quadratic Assignment Problem

1999 ◽  
Vol 50 (2) ◽  
pp. 167 ◽  
Author(s):  
L. M. Gambardella ◽  
E. D. Taillard ◽  
M. Dorigo
Keyword(s):  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Ant Colonies
Sign in / Sign up

Export Citation Format

Share Document