Shared memory genetic algorithms in a multi-agent context

Authors:
Dana Vrajitoru
Affiliations:
Indiana University South Bend, South Bend, IN, USA
Venue:
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Year:
2010

Citing 7
Cited 0

Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms

Journal of Heuristics
The influence of migration sizes and intervals on island models

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Towards billion-bit optimization via a parallel estimation of distribution algorithm

Proceedings of the 9th annual conference on Genetic and evolutionary computation
A doubly distributed genetic algorithm for network coding

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Towards better than human capability in diagnosing prostate cancer using infrared spectroscopic imaging

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Selected population characteristics of fine-grained parallel genetic algorithms with re-initialization

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Parallelism and evolutionary algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a concurrent implementation of genetic algorithms designed for shared memory architectures, intended to take advantage of multi-core processor platforms. Our algorithm divides the problems into sub-problems along the chromosome as opposed to the usual approach of dividing the population into niches. We show tests for timing and performance on a variety of platforms