A New Asynchronous Parallel Evolutionary Algorithm for Function Optimization
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
Lifetime aware resource management for sensor network using distributed genetic algorithm
Proceedings of the 2006 international symposium on Low power electronics and design
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence
The crowding approach to niching in genetic algorithms
Evolutionary Computation
Evolutionary dynamics on scale-free interaction networks
IEEE Transactions on Evolutionary Computation
Minimising the delta test for variable selection in regression problems
International Journal of High Performance Systems Architecture
A framework for parallel genetic algorithms on PC cluster
IMCAS'06 Proceedings of the 5th WSEAS international conference on Instrumentation, measurement, circuits and systems
| Hi-index | 0.00 |
Implementations of parallel genetic algorithms (GA) with multiple populations are common, but they introduce several parameters whose effect on the quality of the search is not well understood. Parameters such as the number of populations, their size, the topology of communications, and the migration rate have to be set carefully to reach adequate solutions. This paper presents models that predict the effects of the parallel GA parameters on its search quality. The paper reviews some recent results on the case where each population is connected to all the others and the migration rate is set to the maximum value possible. This bounding case is the simplest to analyze, and it introduces the methodology that is used in the remainder of the paper to analyze parallel GA with arbitrary migration rates and communication topologies. This investigation considers that migration occurs only after each population converges; then, incoming individuals are incorporated into the populations and the algorithm restarts. The models find the probability that each population converges to the correct solution after each restart, and also calculate the long-run chance of success. The accuracy of the models is verified with experiments using one additively decomposable function