Combinatorial optimization np-hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU
| dc.contributor.author | Cárdenas Gómez, Eduardo | spa |
| dc.contributor.author | Poveda Chaves, Roberto | spa |
| dc.contributor.author | García Hurtado, Orlando | spa |
| dc.date | 2018-10-27 | |
| dc.date.accessioned | 2019-09-19T21:53:59Z | |
| dc.date.available | 2019-09-19T21:53:59Z | |
| dc.description | 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). | en-US |
| dc.description | En este documento se resuelven algunas instancias de problemas bien conocidos de optimización combinatorial de tipo NP-Hard a partir de la formulación de Koopmans y Beckmann del problema de Asignación Cuadrática (QAP). Dichas instancias son solucionadas mediante un Algoritmo Genético Embarasosamente Paralelo o mediante un Algoritmo Genético Paralelo de Islas, en ambos casos, la implementación se hace sobre unidades de procesamiento gráfico (GPU’s). | es-ES |
| dc.format | application/pdf | |
| dc.identifier | https://revistas.udistrital.edu.co/index.php/visele/article/view/14623 | |
| dc.identifier | 10.14483/22484728.14623 | |
| dc.identifier.uri | http://hdl.handle.net/11349/22033 | |
| dc.language | eng | |
| dc.publisher | Universidad Distrital Francisco José de Caldas | es-ES |
| dc.relation | https://revistas.udistrital.edu.co/index.php/visele/article/view/14623/14650 | |
| dc.rights | https://creativecommons.org/licenses/by-nc-nd/3.0 | es-ES |
| dc.source | Visión electrónica; Vol 11 No 2 (2017); 146-151 | en-US |
| dc.source | Visión electrónica; Vol. 11 Núm. 2 (2017); 146-151 | es-ES |
| dc.source | 2248-4728 | |
| dc.source | 1909-9746 | |
| dc.subject | Combinatorial Optimization NP-Hard Problem | en-US |
| dc.subject | Compute Unified Device Architecture (CUDA) | en-US |
| dc.subject | Graphics Processing Unit (GPU) | en-US |
| dc.subject | Parallel Genetic Algorithms (PGA) | en-US |
| dc.subject | Quadratic Assignment Problem (QAP) | en-US |
| dc.subject | Problemas de Optimización Combinatorial NP–Difíciles | es-ES |
| dc.subject | Arquitectura Unificada de Dispositivos de Cómputo (CUDA) | es-ES |
| dc.subject | Unidades de Procesamiento Gráfico (GPU) | es-ES |
| dc.subject | Algoritmos Genéticos Paralelos | es-ES |
| dc.subject | Problema de Asignación Cuadrática (QAP) | es-ES |
| dc.title | Combinatorial optimization np-hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU | en-US |
| dc.title | Problemas de optimización combinatorial np-hard solucionados a partir del problema de asignación cuadrática solución a través de un algoritmo genético paralelo sobre GPU | es-ES |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type.coar | http://purl.org/coar/resource_type/c_6501 |