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

Abstract

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

Keywords

• combinatorial optimization np-hard problem
• compute unified device architecture (cuda)
• graphics processing unit (gpu)
• parallel genetic algorithms (pga)
• quadratic assignment problem (qap)