arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1704.06258cs.DMcs.NE
收藏

求解GPU上无容量限制的单点分配p-枢纽中心点问题

Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU

Abdelhamid Benaini, Achraf Berrajaa, Jaouad Boukachour, Mustapha Oudani

摘要:

提出了一种在GPU集群上实现的并行遗传算法来求解无容量限制的单分配p-Hub中位数问题。GA使用二进制和整数编码和遗传算子适应这个问题。我们的遗传算法是通过产生初始解位于中间节点的枢纽。所获得的实验结果进行比较与最知名的解决方案的所有基准上的实例高达1000个节点。此外,我们解决了我们自己随机生成的多达6000个节点的实例。我们的方法在解决方案的质量和时间执行方面优于大多数知名的prostitics,它允许迄今未解决的问题得到解决。

英文摘要:

A parallel genetic algorithm (GA) implemented on GPU clusters is proposed to solve the Uncapacitated Single Allocation p-Hub Median problem. The GA uses binary and integer encoding and genetic operators adapted to this problem. Our GA is improved by generated initial solution with hubs located at middle nodes. The obtained experimental results are compared with the best known solutions on all benchmarks on instances up to 1000 nodes. Furthermore, we solve our own randomly generated instances up to 6000 nodes. Our approach outperforms most well-known heuristics in terms of solution quality and time execution and it allows hitherto unsolved problems to be solved.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑