Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Parallel genetic algorithms for a hypercube
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
Proceedings of the 3rd International Conference on Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Adaptive Selection Methods for Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Distributed Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Generalized Convergence Models for Tournament- and (mu, lambda)-Selection
Proceedings of the 6th International Conference on Genetic Algorithms
The Distributed Genetic Algorithm Revisited
Proceedings of the 6th International Conference on Genetic Algorithms
Convergence Models of Genetic Algorithm Selection Schemes
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems
EP '97 Proceedings of the 6th International Conference on Evolutionary Programming VI
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Intelligent behavior as an adaptation to the task environment
Intelligent behavior as an adaptation to the task environment
Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model
Computer simulations of genetic adaptation: parallel subcomponent interaction in a multilocus model
Genetic algorithms, selection schemes, and the varying effects of noise
Evolutionary Computation
A comparison of selection schemes used in evolutionary algorithms
Evolutionary Computation
An experimental study of some control parameters in parallel genetic programming
Neural, Parallel & Scientific Computations
The influence of migration sizes and intervals on island models
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Engineering Applications of Artificial Intelligence
Designing cellular networks using a parallel hybrid metaheuristic on the computational grid
Computer Communications
Efficiency of parallel genetic algorithm for solving N-queens problem on multicomputer platform
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
The impact of the mutation strategy on the quality of solution of parallel genetic algorithms
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Advances in Engineering Software
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Genotypic differences and migration policies in an island model
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Distributed differential evolution with explorative---exploitative population families
Genetic Programming and Evolvable Machines
Fault tolerance in distributed genetic algorithms with tree topologies
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Modelling and Simulation in Engineering
Shared memory genetic algorithms in a multi-agent context
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A dual-population genetic algorithm for adaptive diversity control
IEEE Transactions on Evolutionary Computation
A dynamic Island-based genetic algorithms framework
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm
Journal of Global Optimization
Genetic Algorithm for Boolean minimization in an FPGA cluster
The Journal of Supercomputing
Diversity Guided Evolutionary Programming: A novel approach for continuous optimization
Applied Soft Computing
Biological invasion-inspired migration in distributed evolutionary algorithms
Information Sciences: an International Journal
Testing diversity-enhancing migration policies for hybrid on-line evolution of robot controllers
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
Artificial Intelligence Review
A dynamic island model for adaptive operator selection
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Computational & Mathematical Organization Theory
Enhancing the performance of hybrid genetic algorithms by differential improvement
Computers and Operations Research
A model based on biological invasions for island evolutionary algorithms
EA'11 Proceedings of the 10th international conference on Artificial Evolution
Information Sciences: an International Journal
| Hi-index | 0.00 |
This paper investigates how the policy used to select migrants and the individuals they replace affects the selection pressure in parallel evolutionary algorithms (EAs) with multiple populations. The four possible combinations of random and fitness-based emigration and replacement of existing individuals are considered. The investigation follows two approaches. The first is to calculate the takeover time under the four migration policies. This approach makes several simplifying assumptions, but the qualitative conclusions that are derived from the calculations are confirmed by the second approach. The second approach consists on quantifying the increase in the selection intensity. The selection intensity is a domain-independent adimensional quantity that can be used to compare the selection pressure of common selection methods with the pressure caused by migration. The results may help to avoid excessively high (or low) selection pressures that may cause the search to fail, and offer a plausible explanation to the frequent claims of superlinear speedups in parallel EAs.