This document describes the implementation of a Master–Slave Parallel Genetic Algorithm (PGA) on Graphic Processing Units (GPU) to find solutions or solutions close to optimal solutions to particular instances of the Quadratic Assignment Problem (QAP). The efficiency of the algorithm is tested on a set of QAPLIB standard library problems.Este documento describe la implementación de un algoritmo genético paralelo maestroesclavo (AGP) en unidades de procesamiento gráfico (UPG) para encontrar soluciones o soluciones cercanas a soluciones óptimas para casos particulares del Problema de asignación Cuadrática (PAC). La eficiencia del algoritmo se prueba en un conjunto de problemas de la biblioteca estándar QAPLIB
Dissertação de mestrado integrado em Engenharia e Gestão IndustrialO Problema de Afetação Quadrática...
Background: Quadratic assignment problem (QAP) is one of the most interesting of combinatorial optim...
The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems a...
This document describes the implementation of a Master–Slave Parallel Genetic Algorithm (PGA) on Gra...
In this article, some instances of well known combinatorial optimization NP-Hard problems are solved...
This work consists in implementing a fine-grained parallel genetic algorithm improved with a greedy ...
Bu çalışmada karesel atama probleminin çözümü için melez bir genetik algoritma önerilmiştir. Önerile...
This paper proposes a genetic algorithm based on a new replacement strategy to solve the quadratic a...
Cover title.Includes bibliographical references (p. 22-24).Supported in part by ONR. N00014-94-1-009...
International audienceIn this paper we propose a parallel hybrid genetic method for solving Quadrati...
International audienceThis paper deals with the resolution of the Quadratic 3-dimensional Assignment...
The Quadratic Assignment Problem (QAP) is a combinatorial opti-mization problem used to model a numb...
Este documento presenta el trabajo realizado en la ETSIIT de la Universidad de Granada. Se pone de m...
O Problema Quadrático de Alocação, PQA, um dos mais difíceis da classe NP-hard, modela diversas apli...
Genetic algorithms (GAs) are optimization techniques which imitate the way that nature selects the b...
Dissertação de mestrado integrado em Engenharia e Gestão IndustrialO Problema de Afetação Quadrática...
Background: Quadratic assignment problem (QAP) is one of the most interesting of combinatorial optim...
The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems a...
This document describes the implementation of a Master–Slave Parallel Genetic Algorithm (PGA) on Gra...
In this article, some instances of well known combinatorial optimization NP-Hard problems are solved...
This work consists in implementing a fine-grained parallel genetic algorithm improved with a greedy ...
Bu çalışmada karesel atama probleminin çözümü için melez bir genetik algoritma önerilmiştir. Önerile...
This paper proposes a genetic algorithm based on a new replacement strategy to solve the quadratic a...
Cover title.Includes bibliographical references (p. 22-24).Supported in part by ONR. N00014-94-1-009...
International audienceIn this paper we propose a parallel hybrid genetic method for solving Quadrati...
International audienceThis paper deals with the resolution of the Quadratic 3-dimensional Assignment...
The Quadratic Assignment Problem (QAP) is a combinatorial opti-mization problem used to model a numb...
Este documento presenta el trabajo realizado en la ETSIIT de la Universidad de Granada. Se pone de m...
O Problema Quadrático de Alocação, PQA, um dos mais difíceis da classe NP-hard, modela diversas apli...
Genetic algorithms (GAs) are optimization techniques which imitate the way that nature selects the b...
Dissertação de mestrado integrado em Engenharia e Gestão IndustrialO Problema de Afetação Quadrática...
Background: Quadratic assignment problem (QAP) is one of the most interesting of combinatorial optim...
The Quadratic Assignment Problem (QAP) is one of the classical combinatorial optimization problems a...