General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms*

@article{Lssig2014GeneralUB,
  title={General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms*},
  author={J{\"o}rg L{\"a}ssig and Dirk Sudholt},
  journal={Evolutionary Computation},
  year={2014},
  volume={22},
  pages={405-437}
}
We present a general method for analyzing the runtime of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper bounds on the expected parallel runtime. This allows for a rigorous estimate of the speedup gained by parallelization. Tailored results are given for common migration topologies: ring graphs, torus graphs, hypercubes, and the complete graph. Example applications for pseudo-Boolean optimization show that our method is… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 51 references

Spatially structured evolutionary algorithms: Artificial evolution in space and time

  • M. Tomassini
  • 2005
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…