Punctuated equilibria: a parallel genetic algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
On the 0, 1 facets of the set covering polytope
Mathematical Programming: Series A and B
On the set covering polytope: I. all the facets with coefficients in {0, 1, 2}
Mathematical Programming: Series A and B
On the set covering polytope: II. lifting the facets with coefficients in {0, 1, 2}
Mathematical Programming: Series A and B
Optimal solution of set covering/partitioning problems using dual heuristics
Management Science
On the facial structure of the set covering polytope dimensional linear programming
Mathematical Programming: Series A and B
Distributed genetic algorithms
Proceedings of the third international conference on Genetic algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Minimal cost set covering using probabilistic methods
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Simplification of the Covering Problem with Application to Boolean Expressions
Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Distributed Genetic Algorithm Revisited
Proceedings of the 6th International Conference on Genetic Algorithms
Parallel Genetic Programming on a Network of Transputers
Parallel Genetic Programming on a Network of Transputers
Optimizing the distribution of shopping centers with parallel genetic algorithm
Engineering Applications of Artificial Intelligence
A GRASP algorithm to solve the unicost set covering problem
Computers and Operations Research
A Novel EDA Tool for VLSI Test Vectors Management
Journal of Electronic Testing: Theory and Applications
A mixed integer linear program and tabu search approach for the complementary edge covering problem
Advances in Engineering Software
Artificial intelligence and intelligent systems research in Chile
Artificial intelligence
Survey: Covering problems in facility location: A review
Computers and Industrial Engineering
EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET
The Journal of Supercomputing
| Hi-index | 0.01 |
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 PL-behaves like a sequential GA with a global population, PG, 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 PG.