ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy
Proceedings of the 3rd International Conference on Genetic Algorithms
Fine-Grained Parallel Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Cellular Evolutionary Algorithms: Evaluating the Influence of Ratio
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Genetic Algorithms, Clustering, and the Breaking of Symmetry
PPSN VI Proceedings of the 6th 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
From Twomax To The Ising Model: Easy And Hard Symmetrical Problems
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series)
Takeover time curves in random and small-world structured populations
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Using pair approximations to predict takeover dynamics in spatially structured populations
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
The influence of scaling and assortativity on takeover times in scale-free topologies
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Cellular Genetic Algorithms
Evolutionary dynamics on scale-free interaction networks
IEEE Transactions on Evolutionary Computation
General scheme for analyzing running times of parallel evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Effects of scale-free and small-world topologies on binary coded self-adaptive CEA
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Fitness sharing and niching methods revisited
IEEE Transactions on Evolutionary Computation
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
A scalable cellular implementation of parallel genetic programming
IEEE Transactions on Evolutionary Computation
Selection intensity in cellular evolutionary algorithms for regular lattices
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
The aim of this work is an investigation on the effects of networks topology to spatially-structured evolutionary algorithms' dynamics. We applied the algorithm on a multi-modal optimization problem and we focused our study on convergence time and diversity of the solutions. Using as algorithms' underlying structure different network models we studied the relationship between algorithm dynamic, i.e. convergence time, first hitting time and number of distinct optima found during the evolution, and networks' characteristics. A comparison with a panmictic evolutionary algorithm is made to study the effects of the introduction of a structure in the mating dynamics, resulting in an enhancement of diversity and containing the convergence time and first hitting time overhead. The results on the proposed multi-modal combinatorial optimization problem using regular graphs and Watts-Strogatz networks show that the underlying network characteristics clearly influences algorithm dynamics and diversity of the solutions found.