Solving the Quadratic Assignment Problem with the modified hybrid PSO algorithm

2012 ◽  
Author(s):  
Ali Safari Mamaghani ◽  
Mohammad Reza Meybodi
Keyword(s):  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Pso Algorithm ◽  
Quadratic Assignment

scholarly journals Multi-swarm PSO Algorithm for the Quadratic Assignment Problem: A Massively Parallel Implementation on the OpenCL Platform

2018 ◽  
Author(s):  
Piotr Szwed ◽  
Wojciech Chmiel
Keyword(s):  
Assignment Problem ◽  
Parallel Implementation ◽  
Quadratic Assignment Problem ◽  
Optimal Solution ◽  
Goal Function ◽  
Pso Algorithm ◽  
Parallel Execution ◽  
Quadratic Assignment ◽  
Large Populations ◽  
Problem Instances

This paper presents a multi-swarm PSO algorithm for the Quadratic Assignment Problem (QAP) implemented on the OpenCL platform. Our work was motivated by results of time efficiency tests performed for single-swarm algorithm implementation that showed clearly that the benefits of a parallel execution platform can be fully exploited provided the processed population is large. The described algorithm can be executed in two modes: with independent swarms or with migration. We discuss the algorithm construction as well as we report results of tests performed on several problem instances from the QAPLIB library. During the experiments the algorithm was configured to process large populations. This allowed us to collect statistical data related to values of goal function reached by individual particles. We use them to demonstrate on two test cases that although single particles seem to behave chaotically during the optimization process, when the whole population is analyzed, the probability that a particle will select a near-optimal solution grows.

Hybrid Approach for Solving the Q3AP

2021 ◽  
Vol 12 (1) ◽  
pp. 98-114
Author(s):  
Imène Ait Abderrahim ◽  
Lakhdar Loukil
Keyword(s):  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Hybrid Approach ◽  
Three Dimensional ◽  
Pso Algorithm ◽  
Population Based ◽  
Combinatorial Problems ◽  
Quadratic Assignment ◽  
Symbol Mapping ◽  
Nature Inspired Algorithms

Metaheuristics algorithms are competitive methods for solving assignment problems. This paper reports on nature inspired algorithms approach which is the particle swarm optimization (PSO) method hybrid with a local search (LS) algorithm for solving the quadratic three-dimensional assignment problem (Q3AP) where population-based metaheuristics like PSO or GA failed to solve. Q3AP is one of the combinatorial problems proven to be NP-Hard. It is an extension of the quadratic assignment problem (QAP). Solving the Q3AP consists of finding an optimal symbol mapping over two vectors, whereas solving the QAP consists of finding an optimal symbol mapping over one vector only. The authors tested the proposed hybrid algorithm on many instances where some of them haven't been used in the previous works for solving Q3AP. The results show that compared with the PSO algorithm and the genetic algorithm (GA), the proposed hybrid PSO-ILS(TS) algorithm is promising for finding the optimal/best known solution.

A Memetic Heuristic for the Generalized Quadratic Assignment Problem

2006 ◽  
Vol 18 (4) ◽  
pp. 433-443 ◽  
Author(s):  
Jean-François Cordeau ◽  
Manlio Gaudioso ◽  
Gilbert Laporte ◽  
Luigi Moccia
Keyword(s):  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Generalized Quadratic Assignment Problem
Sign in / Sign up

Export Citation Format

Share Document