Abstract
A simple island model with λ islands and migration occurring after every τ iterations is studied on the dynamic fitness function Maze. This model is equivalent to a (1+λ) EA if τ=1, i.e., migration occurs during every iteration. It is proved that even for an increased offspring population size up to λ=O(n1-ε), the (1+λ) EA is still not able to track the optimum of Maze. If the migration interval is increased, the algorithm is able to track the optimum even for logarithmic λ. Finally, the relationship of τ, λ, and the ability of the island model to track the optimum is investigated more closely.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '15) |
| Publisher | Association for Computing Machinery |
| Publication date | 2015 |
| Pages | 1447-1454 |
| ISBN (Print) | 978-1-4503-3472-3 |
| DOIs | |
| Publication status | Published - 2015 |
| Event | 2015 Genetic and Evolutionary Computation Conference - Madrid, Spain Duration: 11 Jul 2015 → 15 Jul 2015 http://www.sigevo.org/gecco-2015/ |
Conference
| Conference | 2015 Genetic and Evolutionary Computation Conference |
|---|---|
| Country/Territory | Spain |
| City | Madrid |
| Period | 11/07/2015 → 15/07/2015 |
| Internet address |
Keywords
- Evolutionary Algorithm
- Island Models
- Dynamic Problems
- Populations
- Runtime Analysis