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

Autor:	Eduardo Cárdenas Gómez, Roberto Poveda Chaves, Orlando García Hurtado
Jazyk:	English<br />Spanish; Castilian
Rok vydání:	2017
Předmět:	combinatorial optimization np-hard problem compute unified device architecture (cuda) graphics processing unit (gpu) parallel genetic algorithms (pga) quadratic assignment problem (qap) Electrical engineering. Electronics. Nuclear engineering TK1-9971
Zdroj:	Visión Electrónica, Vol 11, Iss 2, Pp 146-151 (2017)
Druh dokumentu:	article
ISSN:	1909-9746 2248-4728 22484728
DOI:	10.14483/22484728.14623
Popis:	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).
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/0792cf53cd2a46b0a1f6b83752cc4c45 Zobrazit plný text záznamu View record in DOAJ