.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
set-covering problem
parallel genetic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more