Combinatorial optimization np-hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU
Keyword(s):
Np Hard
◽
In this article, some instances of well known combinatorial optimization NP-Hard problems are solved by using Koopmans and Beckmann formulation of the quadratic assignment problem (QAP). These instances are solved by using an Embarrassingly Parallel Genetic Algorithm or by using an Island Parallel Genetic Algorithm; in both cases, the implementation is carried out on Graphics Processing Units (GPUs).
2018 ◽
Vol 103
(8)
◽
pp. 1289-1302
2018 ◽
Vol 108
(1)
◽
pp. 161-175
2013 ◽
Vol 51
(14)
◽
pp. 4117-4133
◽
2017 ◽
Vol 11
◽
pp. 2843-2854
◽
2013 ◽
Vol 51
(14)
◽
pp. i-ii
2017 ◽
Vol 29
(4)
◽
pp. 676-687
◽