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...
Kaydedildi:
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Universidad Distrital Francisco José de Caldas
2017-12-01
|
| Seri Bilgileri: | Visión Electrónica |
| Konular: | |
| Online Erişim: | https://revistas.udistrital.edu.co/index.php/visele/article/view/14623 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|