%0 Conference Paper %1 doerr2017island %A Doerr, Benjamin %A Fischbeck, Philipp %A Frahnow, Clemens %A Friedrich, Tobias %A Kötzing, Timo %A Schirneck, Martin %B Genetic and Evolutionary Computation Conference (GECCO) %D 2017 %K testing typo3 %P 1359-1366 %T Island Models Meet Rumor Spreading %X 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 the communication effort (i) by improving the run time bounds via a careful analysis, (ii) by setting the balance between individual computation and communication in a more appropriate manner, and (iii) by replacing the usual communicate-with-all-neighbors approach with randomized rumor spreading, where 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 islands running simple (1+1) evolutionary algorithms, we regard d-dimensional tori and complete graphs as communication topologies, and optimize the classic test functions OneMax and LeadingOnes.

@inproceedings{doerr2017island, 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 the communication effort (i) by improving the run time bounds via a careful analysis, (ii) by setting the balance between individual computation and communication in a more appropriate manner, and (iii) by replacing the usual communicate-with-all-neighbors approach with randomized rumor spreading, where 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 islands running simple (1+1) evolutionary algorithms, we regard d-dimensional tori and complete graphs as communication topologies, and optimize the classic test functions OneMax and LeadingOnes.}, added-at = {2017-09-19T19:29:40.000+0200}, author = {Doerr, Benjamin and Fischbeck, Philipp and Frahnow, Clemens and Friedrich, Tobias and Kötzing, Timo and Schirneck, Martin}, biburl = {https://www.bibsonomy.org/bibtex/212a44e2ecadd56d9400548803c83f602/typo3tester}, booktitle = {Genetic and Evolutionary Computation Conference (GECCO)}, interhash = {de810cf9ac6c189b4d6c7ee20f86c682}, intrahash = {12a44e2ecadd56d9400548803c83f602}, keywords = {testing typo3}, pages = {1359-1366}, timestamp = {2017-09-19T19:29:40.000+0200}, title = {Island Models Meet Rumor Spreading}, year = 2017 }