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

Eduardo Cárdenas Gómez, Roberto Poveda Chaves, Orlando García Hurtado
{"title":"Combinatorial optimization np-hard problem solved by using the quadratic assignment problem (QAP) solution through a parallel genetic algorithm on GPU","authors":"Eduardo Cárdenas Gómez, Roberto Poveda Chaves, Orlando García Hurtado","doi":"10.14483/22484728.14623","DOIUrl":null,"url":null,"abstract":"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).","PeriodicalId":34191,"journal":{"name":"Vision Electronica","volume":"12 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vision Electronica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14483/22484728.14623","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在GPU上采用并行遗传算法求解二次分配问题的组合优化np-hard问题
本文利用二次分配问题(QAP)的Koopmans和Beckmann公式解决了一些著名的组合优化NP-Hard问题。采用尴尬并行遗传算法或孤岛并行遗传算法求解这些实例;在这两种情况下,实现都是在图形处理单元(gpu)上进行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
8 weeks
期刊最新文献
Perspectives in nanoscience and nanotechnology Interpretaciones del método de Descartes en didáctica del álgebra. Estudio documental Modelo predictivo de gestión del riesgo en el curso de cálculo integral del Programa Ingeniería Industrial para la Universidad El Bosque en el proceso de la deserción estudiantil Una mirada a la estrategia didáctica a partir de los componentes estructurantes, en la práctica de enseñanza de una profesora de preescolar Laboratorios virtuales y remotos en electrónica y telecomunicaciones: una revisión técnica en educación
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1