SOME NP-HARD PROBLEMS SOLVED FROM THE QUADRATIC ASSIGNMENT PROBLEM THROUGH A PARALLEL GENETIC ALGORITHM BASED GRID ON GPU

2018 ◽  
Vol 103 (8) ◽  
pp. 1289-1302
Author(s):  
Ch. Roberto Poveda ◽  
G. Eduardo Cárdenas ◽  
H. Orlando García
Keyword(s):  
Genetic Algorithm ◽  
Assignment Problem ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Np Hard ◽  
Parallel Genetic Algorithm ◽  
Hard Problems ◽  
Np Hard Problems

scholarly journals Combinatorial optimization np-hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU

2018 ◽  
Vol 11 (2) ◽  
pp. 146-151
Author(s):  
Eduardo Cárdenas Gómez ◽  
Roberto Poveda Chaves ◽  
Orlando García Hurtado
Keyword(s):  
Genetic Algorithm ◽  
Combinatorial Optimization ◽  
Assignment Problem ◽  
Graphics Processing Units ◽  
Quadratic Assignment Problem ◽  
Quadratic Assignment ◽  
Np Hard ◽  
Parallel Genetic Algorithm ◽  
Hard Problems ◽  
Graphics Processing

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).

Sign in / Sign up

Export Citation Format

Share Document