A Comparison between Simulated Annealing and Tabu Search with an Example from the Production Planning

1994 ◽  
pp. 498-503 ◽  
Author(s):  
Albrecht Heinrici
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Production Planning

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.

Sign in / Sign up

Export Citation Format

Share Document