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

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

Szczegółowa specyfikacja

Opis bibliograficzny

Główni autorzy:	Eduardo Cárdenas Gómez, Roberto Poveda Chaves, Orlando García Hurtado
Format:	Artigo
Język:	Inglês
Wydane:	Universidad Distrital Francisco José de Caldas 2017-12-01
Seria:	Visión Electrónica
Hasła przedmiotowe:	combinatorial optimization np-hard problem compute unified device architecture (cuda) graphics processing unit (gpu) parallel genetic algorithms (pga) quadratic assignment problem (qap)
Dostęp online:	https://revistas.udistrital.edu.co/index.php/visele/article/view/14623
Etykiety:	Dodaj etykietę Nie ma etykietki, Dołącz pierwszą etykiete!