Abstract
Running several evolutionary algorithms in parallel and occasionally exchanging good solutions is referred to as island models. The idea is that the independence of the different islands leads to diversity, thus possibly exploring the search space better. Many theoretical analyses so far have found a complete (or sufficiently quickly expanding) topology as underlying migration graph most efficient for optimization, even though a quick dissemination of individuals leads to a loss of diversity.
We suggest a simple fitness function Fork with two local optima parametrized by \(r \ge 2\) and a scheme for composite fitness functions. We show that, while the (\(1+1\)) EA gets stuck in a bad local optimum and incurs a run time of \(\varTheta (n^{2r})\) fitness evaluations on Fork, island models with a complete topology can achieve a run time of \(\varTheta (n^{1.5r})\) by making use of rare migrations in order to explore the search space more effectively. Finally, the ring topology, making use of rare migrations and a large diameter, can achieve a run time of \(\tilde{\varTheta }(n^r)\), the black box complexity of Fork. This shows that the ring topology can be preferable over the complete topology in order to maintain diversity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that in some papers migration is considered to happen deterministically every \(\tau \) rounds.
References
Alba, E.: Parallel evolutionary algorithms can achieve super-linear performance. Inf. Process. Lett. 82, 7–13 (2002)
Bäck, T., Fogel, D.B., Michalewicz, Z.: Handbook of evolutionary computation. Release 97(1), B1 (1997)
Badkobeh, G., Lehre, P.K., Sudholt, D.: Black-box complexity of parallel search with distributed populations. In: Proceedings of the 2015 FOGA XIII. pp. 3–15. ACM (2015)
Doerr, B., Fischbeck, P., Frahnow, C., Friedrich, T., Kötzing, T., Schirneck, M.: Island models meet rumor spreading. In: Proceedings of the GECCO 2017, pp. 1359–1366. ACM (2017)
Doerr, B., Goldberg, L.A.: Adaptive drift analysis. Algorithmica 65(1), 224–250 (2013)
Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673–697 (2012)
Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theory Comput. Syst. 39(4), 525–544 (2006)
Eisenberg, B.: On the expectation of the maximum of IID geometric random variables. Stat. Probab. Lett. 78(2), 135–143 (2008)
Gießen, C.: Hybridizing evolutionary algorithms with opportunistic local search. In: Proceedings of the GECCO 2013, pp. 797–804. ACM (2013)
Jansen, T., Wiegand, R.P.: Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA. In: Cantú-Paz, E. (ed.) GECCO 2003. LNCS, vol. 2723, pp. 310–321. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45105-6_37
Lässig, J., Sudholt, D.: Design and analysis of migration in parallel evolutionary algorithms. Soft Comput. 17(7), 1121–1144 (2013)
Lässig, J., Sudholt, D.: General upper bounds on the runtime of parallel evolutionary algorithms. Evol. Comput. 22, 405–437 (2014)
Lissovoi, A., Witt, C.: A runtime analysis of parallel evolutionary algorithms in dynamic optimization. Algorithmica 78(2), 641–659 (2017)
Neumann, F., Oliveto, P.S., Rudolph, G., Sudholt, D.: On the effectiveness of crossover for migration in parallel evolutionary algorithms. In: Proceedings of the GECCO 2011, 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)
Sudholt, D.: General lower bounds for the running time of evolutionary algorithms. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 124–133. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15844-5_13
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Frahnow, C., Kötzing, T. (2018). Ring Migration Topology Helps Bypassing Local Optima. In: Auger, A., Fonseca, C., Lourenço, N., Machado, P., Paquete, L., Whitley, D. (eds) Parallel Problem Solving from Nature – PPSN XV. PPSN 2018. Lecture Notes in Computer Science(), vol 11102. Springer, Cham. https://doi.org/10.1007/978-3-319-99259-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-99259-4_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99258-7
Online ISBN: 978-3-319-99259-4
eBook Packages: Computer ScienceComputer Science (R0)