In this paper, a parallel hybrid algorithm (PHA) with three stages was proposed. In the first stage, a genetic algorithm was used to obtain a high quality seed.
The known sequential algorithms can solve small problem instances within long computational times; moreover, parallelization may provide only a linear speed-up.
The known sequential algorithms can solve small problem instances within long computational times; moreover, parallelization may provide only a linear speed-up.
On the performance of parallel hybrid algorithms for the solution of ...
typeset.io › Paper Directory
TL;DR: The PHA was able to solve even the largest problem instance size of 256 within 11 h, and with a higher accuracy than the best-known solutions, ...
The quadratic assignment problem (QAP) is a combinatorial optimization problem, which is computa- tionally demanding, and considered to be NP-hard.
Experimental results indicate that the hybrid algorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.
Experimental results indicate that the hybrid algorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.
People also ask
Is the quadratic assignment problem NP-hard?
What is the quadratic assignment problem?
This study introduces a discrete rat swarm optimizer (DRSO)algorithm for the first time as a solution to the quadratic assignment problem.
In this paper we present a parallel branch and bound algorithm for the solution of quadratic assignment problems. The algorithm has been coded in VS/FORTRAN ...
Many recent hybrid approaches have improved performance in solving QAP ... A cooperative parallel tabu search algorithm for the quadratic assignment problem.