Abstract
Island models in evolutionary computation solve problems by a careful interplay of independently running evolutionary algorithms on the island and an exchange of good solutions between the islands. In this work, we conduct rigorous run time analyses for such island models trying to simultaneously obtain good run times and low communication effort. We improve the existing upper bounds for both measures (i) by improving the run time bounds via a careful analysis, (ii) by balancing individual computation and communication in a more appropriate manner, and (iii) by replacing the usual communicate-with-all approach with randomized rumor spreading. In the latter, each island contacts a randomly chosen neighbor. This epidemic communication paradigm is known to lead to very fast and robust information dissemination in many applications. Our results concern island models running simple \((1+1)\) evolutionary algorithms to optimize the classic test functions OneMax and LeadingOnes. We investigate binary trees, d-dimensional tori, and complete graphs as communication topologies.
Similar content being viewed by others
References
Alba, E.: Parallel evolutionary algorithms can achieve super-linear performance. Inf. Process. Lett. 82, 7–13 (2002)
Alba, E., Luque, G., Nesmachnow, S.: Parallel metaheuristics: recent advances and new trends. Int. Trans. Oper. Res. 20, 1–48 (2013)
Badkobeh, G., Lehre, P.K., Sudholt, D.: Unbiased black-box complexity of parallel search. In: Proceedings of the 13th International Conference on Parallel Problem Solving from Nature (PPSN), pp. 892–901 (2014)
Badkobeh, G., Lehre, P.K., Sudholt, D.: Black-box complexity of parallel search with distributed populations. In: Proceedings of the 13th Workshop on the Foundations of Genetic Algorithms (FOGA), pp. 3–15 (2015)
Böttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the leadingones problem. In: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN), pp. 1–10 (2010)
Cantú-Paz, E.: A survey of parallel genetic algorithms. IlliGAL Report 97003 (1997)
Doerr, B.: Optimal parameter settings for the \((1+ (\lambda ,\lambda ))\) genetic algorithm. CoRR arxiv:1604.01088 (2016)
Doerr, B., Fischbeck, P., Frahnow, C., Friedrich, T., Kötzing, T., Schirneck, M.: Island models meet rumor spreading. In: Proceedings of the 2017 Genetic and Evolutionary Computation Conference (GECCO), pp. 1359–1366 (2017)
Doerr, B., Fouz, M.: Asymptotically optimal randomized rumor spreading. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP), pp. 502–513 (2011)
Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673–697 (2012)
Doerr, B., Künnemann, M.: Tight analysis of randomized rumor spreading in complete graphs. In: Proceedings of the 2014 Meeting on Analytic Algorithmics and Combinatorics (ANALCO), pp. 82–91 (2014)
Doerr, B., Künnemann, M.: Optimizing linear functions with the \((1{+}\lambda )\) evolutionary algorithm—different asymptotic runtimes for different instances. Theor. Comput. Sci. 561, 3–23 (2015)
Droste, S., Jansen, T., Wegener, I.: On the analysis of the \((1{+}1)\) evolutionary algorithm. Theor. Comput. Sci. 276, 51–81 (2002)
Gießen, C., Witt, C.: Optimal mutation rates for the \((1 + \lambda )\) EA on OneMax. In: Proceedings of the 2016 Genetic and Evolutionary Computation Conference (GECCO), pp. 1147–1154 (2016)
He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3, 21–35 (2004)
Johannsen, D.: Random combinatorial structures and randomized search heuristics. Ph.D. thesis, Universität des Saarlandes (2010)
Lässig, J., Sudholt, D.: General upper bounds on the runtime of parallel evolutionary algorithms. Evol. Comput. 22, 405–437 (2014)
Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623–642 (2012)
Lissovoi, A., Witt, C.: On the utility of island models in dynamic optimization. In: Proceedings of the 2015 Genetic and Evolutionary Computation Conference (GECCO), pp. 1447–1454 (2015)
Mambrini, A., Sudholt, D.: Design and analysis of schemes for adapting migration intervals in parallel evolutionary algorithms. Evol. Comput. 23, 559–582 (2015)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)
Neumann, F., Oliveto, P.S., Rudolph, G., Sudholt, D.: On the effectiveness of crossover for migration in parallel evolutionary algorithms. In: Proceedings of the 2011 Genetic and Evolutionary Computation Conference (GECCO), pp. 1587–1594 (2011)
Ruciński, M., Izzo, D., Biscani, F.: On the impact of the migration topology on the island model. Parallel Comput. 36, 555–571 (2010)
Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovač, Hamburg (1997)
Sudholt, D.: Parallel evolutionary algorithms. In: Springer Handbook of Computational Intelligence, pp. 929–959. Springer, Berlin (2015)
Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 64–78 (2001)
Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Comb. Probab. Comput. 22, 294–318 (2013)
Acknowledgements
This work has been partially supported by the Direction générale l’armement of the French Ministry of Defense under the X-DGA Contract and by the German Research Foundation under Grant Agreement FR2988 (TOSU). We would like to thank the anonymous reviewers as well as the guest editors, Carola Doerr and Dirk Sudholt, for their constructive feedback, which significantly improved the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
An extended abstract of this work was presented at the 2017 Genetic and Evolutionary Computation Conference (GECCO) [8]
Rights and permissions
About this article
Cite this article
Doerr, B., Fischbeck, P., Frahnow, C. et al. Island Models Meet Rumor Spreading. Algorithmica 81, 886–915 (2019). https://doi.org/10.1007/s00453-018-0445-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-018-0445-2