Wakunda, Jürgen and Zell, Andreas

EvA: A Tool for Optimization with Evolutionary Algorithms

23rd EUROMICRO Conference '97 New Frontiers of Information Technology, Los Alamitos, CA, USA vol. 0, IEEE Computer Society, 1997, pp. 644-651


Abstract

We describe the EvA software package which consists of parallel (and sequential) implementations of genetic algorithms (GAs) and evolution strategies (ESs) and a common graphical user interface. We concentrate on the descriptions of the two distributed implementations of GAs and ESs which are of most interest for the future. We present comparisons of different kinds of genetic algorithms and evolution strategies that include implementations of distributed algorithms on the Intel Paragon, a large MIMD computer, and massively parallel algorithms on a 16384 processor MasPar MP-1, a large SIMD computer. The results show that parallelization of evolution strategies not only achieves a speedup in execution time of the algorithm, but also a higher probability of convergence and an increase of quality of the achieved solutions. In the benchmark functions we tested, the distributed ESs have a better performance than the distributed GAs.


Downloads and Links

[doi] [pdf] [pdf]


BibTeX

@inproceedings{wakunda1997EvA,
  author = {Wakunda, J\"urgen and Zell, Andreas},
  title = {{EvA: A Tool for Optimization with Evolutionary Algorithms}},
  booktitle = {23\textsuperscript{rd} EUROMICRO Conference '97 New Frontiers of
	Information Technology},
  year = {1997},
  volume = {0},
  pages = {644--651},
  address = {Los Alamitos, CA, USA},
  month = sep,
  publisher = {IEEE Computer Society},
  abstract = {We describe the EvA software package which consists of parallel (and
	sequential) implementations of genetic algorithms (GAs) and evolution
	strategies (ESs) and a common graphical user interface. We concentrate
	on the descriptions of the two distributed implementations of GAs
	and ESs which are of most interest for the future. We present comparisons
	of different kinds of genetic algorithms and evolution strategies
	that include implementations of distributed algorithms on the Intel
	Paragon, a large MIMD computer, and massively parallel algorithms
	on a 16384 processor MasPar MP-1, a large SIMD computer. The results
	show that parallelization of evolution strategies not only achieves
	a speedup in execution time of the algorithm, but also a higher probability
	of convergence and an increase of quality of the achieved solutions.
	In the benchmark functions we tested, the distributed ESs have a
	better performance than the distributed GAs.},
  doi = {http://www.computer.org/portal/web/csdl/doi/10.1109/EURMIC.1997.617395},
  isbn = {0-8186-8129-2},
  issn = {1089-6503},
  pdf = {http://www.cogsys.cs.uni-tuebingen.de/publikationen/1997/Wakunda1997.pdf},
  url = {http://doi.ieeecomputersociety.org/10.1109/EURMIC.1997.617395}
}