Incorporating domain-specific heuristics in a particle swarm optimization approach to the quadratic assignment problem

2014 ◽  
Vol 6 (4) ◽  
pp. 241-254 ◽  
Author(s):  
Ayah M. Helal ◽  
Ashraf M. Abdelbar
Keyword(s):  
Particle Swarm Optimization ◽  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Particle Swarm ◽  
Quadratic Assignment ◽  
Optimization Approach ◽  
Swarm Optimization ◽  
Domain Specific

Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem

2013 ◽  
pp. 52-70
Author(s):  
Tabitha James ◽  
Cesar Rego
Keyword(s):  
Particle Swarm Optimization ◽  
Tabu Search ◽  
Assignment Problem ◽  
Search Algorithm ◽  
Quadratic Assignment Problem ◽  
Particle Swarm ◽  
Optimization Methods ◽  
Path Relinking ◽  
Quadratic Assignment ◽  
Swarm Optimization

This paper introduces a new path relinking algorithm for the well-known quadratic assignment problem (QAP) in combinatorial optimization. The QAP has attracted considerable attention in research because of its complexity and its applicability to many domains. The algorithm presented in this study employs path relinking as a solution combination method incorporating a multistart tabu search algorithm as an improvement method. The resulting algorithm has interesting similarities and contrasts with particle swarm optimization methods. Computational testing indicates that this algorithm produces results that rival the best QAP algorithms. The authors additionally conduct an analysis disclosing how different strategies prove more or less effective depending on the landscapes of the problems to which they are applied. This analysis lays a foundation for developing more effective future QAP algorithms, both for methods based on path relinking and tabu search, and for hybrids of such methods with related processes found in particle swarm optimization.

Path Relinking with Multi-Start Tabu Search for the Quadratic Assignment Problem

2011 ◽  
Vol 2 (2) ◽  
pp. 52-70
Author(s):  
Tabitha James ◽  
Cesar Rego
Keyword(s):  
Particle Swarm Optimization ◽  
Tabu Search ◽  
Assignment Problem ◽  
Search Algorithm ◽  
Quadratic Assignment Problem ◽  
Particle Swarm ◽  
Path Relinking ◽  
Combination Method ◽  
Quadratic Assignment ◽  
Swarm Optimization

This paper introduces a new path relinking algorithm for the well-known quadratic assignment problem (QAP) in combinatorial optimization. The QAP has attracted considerable attention in research because of its complexity and its applicability to many domains. The algorithm presented in this study employs path relinking as a solution combination method incorporating a multistart tabu search algorithm as an improvement method. The resulting algorithm has interesting similarities and contrasts with particle swarm optimization methods. Computational testing indicates that this algorithm produces results that rival the best QAP algorithms. The authors additionally conduct an analysis disclosing how different strategies prove more or less effective depending on the landscapes of the problems to which they are applied. This analysis lays a foundation for developing more effective future QAP algorithms, both for methods based on path relinking and tabu search, and for hybrids of such methods with related processes found in particle swarm optimization.

Sign in / Sign up

Export Citation Format

Share Document