SINGLE-WALK PARALLELIZATION OF THE GENETIC ALGORITHM

Wojciech Bożejko, Mieczyslaw Wodecki

2011

Abstract

This paper aims at presenting theoretical properties which can be used to approximate the theoretical speedup of parallel genetic algorithms. The most frequently parallelization method employed to genetic algorithm implements a master-slave model by distributing the most computationally exhausting elements of the algorithm (usually evaluation of the fitness function, i.e. cost function calculation) among a number of processors (slaves). This master-slave parallelization is regarded as easy in programming, which makes it popular with practitioners. Additionally, if the master processor keeps the population (and slave processors are used only as computational units for individuals fitness function evaluation), it explores the solution space in exactly the same manner as the sequential genetic algorithm. In this case we can say that we analyze the single-walk parallel genetic algorithm.

Paper Citation

in Harvard Style

Bożejko W. and Wodecki M. (2011). SINGLE-WALK PARALLELIZATION OF THE GENETIC ALGORITHM . In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-40-9, pages 586-590. DOI: 10.5220/0003177805860590

in Bibtex Style

@conference{icaart11,
author={Wojciech Bożejko and Mieczyslaw Wodecki},
title={SINGLE-WALK PARALLELIZATION OF THE GENETIC ALGORITHM},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2011},
pages={586-590},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003177805860590},
isbn={978-989-8425-40-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - SINGLE-WALK PARALLELIZATION OF THE GENETIC ALGORITHM
SN - 978-989-8425-40-9
AU - Bożejko W.
AU - Wodecki M.
PY - 2011
SP - 586
EP - 590
DO - 10.5220/0003177805860590