.png){kind=icon}
返回
A parallel genetic algorithm to solve the set-covering problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(01)00026-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work presents a parallel genetic algorithm (PGA) model to solve the set-covering problem (SCP). Experimental results obtained with a binary,. representation of the SCP, show that-in terms of the number of generations (computational time) needed to achieve solutions of an acceptable quality-PGA performs better than the sequential model. This comportment can be explained principally because. the PGA of p nodes-each one with its corresponding local population P-L-behaves like a sequential GA with a global population, P-G, of the same size, which it-the sequential GA-has the great disadvantage of having to completely evaluate in each generation. Not so the PGA, which only evaluates a pth part of the P-G.
Keyword:
set-covering problem
parallel genetic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
Effect of calcination temperature on the properties of CZTS absorber layer prepared by RF sputtering for solar cell applications煅烧温度对射频溅射制备的CZTS吸收层性能的影响
OAAI
OAAI分享收藏
查看更多内容