ABSTRACT
Fate Agent EAs form a novel flavour or subclass in EC. The idea is to decompose the main loop of traditional evolutionary algorithms into three independently acting forces, implemented by the so-called Fate Agents, and create an evolutionary process by injecting these agents into a population of candidate solutions. This paper introduces an extension to the original concept, adding a mechanism to self-adapt the mutation of the Breeder Agents. The method improves the behaviour of the original Fate Agent EA on dynamically changing fitness landscapes.
- E. Alba and B. Dorronsoro. Cellular Genetic Algorithms. Springer, Berlin, Heidelberg, New York, 1st edition, 2008. Google ScholarDigital Library
- J. Bim, G. Karafotias, S. K. Smit, A. E. Eiben, and E. Haasdijk. It's fate: A self-organising evolutionary algorithm. In C. A. C. Coello, V. Cutello, K. Deb, S. Forrest, G. Nicosia, and M. Pavone, editors, PPSN, volume 7491-7492 of Lecture Notes in Computer Science, pages 185--194. Springer, 2012. Google ScholarDigital Library
- B. Freisleben. Meta-evolutionary approaches. In T. Bäck, D. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages 214--223. Institute of Physics Publishing, Bristol, and Oxford University Press, New York, 1997.Google ScholarCross Ref
- Y. Gong and A. Fukunaga. Distributed island-model genetic algorithms using heterogeneous parameter settings. In IEEE Congress on Evolutionary Computation, pages 820--827, 2011.Google Scholar
- V. Gordon, R. Pirie, A. Wachter, and S. Sharp. Terrain-based genetic algorithm (TBGA): Modeling parameter space as terrain. In W. Banzhaf et al, editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999), pages 229--235. Morgan Kaufmann, San Francisco, 1999.Google Scholar
- G. Karafotias, M. Hoogendoorn, and A. E. Eiben. Parameter control in evolutionary algorithms: Trends and challenges. IEEE Transactions on Evolutionary Computation, to appear, 2014.Google Scholar
- A. Samsonovich and K. De Jong. Pricing the 'free lunch' of meta-evolution. In H.-G. Beyer and U.-M. O'Reilly, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2005), pages 1355--1362. ACM, 2005. Google ScholarDigital Library
- M. Tomassini. Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2005. Google ScholarDigital Library
Index Terms
- Fate agent evolutionary algorithms with self-adaptive mutation
Recommendations
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformaticsThis paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...
To explore or to exploit: An entropy-driven approach for evolutionary algorithms
An evolutionary algorithm is an optimization process comprising two important aspects: exploration discovers potential offspring in new search regions; and exploitation utilizes promising solutions already identified. Intelligent balance between these ...
A model based on biological invasions for island evolutionary algorithms
EA'11: Proceedings of the 10th international conference on Artificial EvolutionMigration strategy plays an important role in designing effective distributed evolutionary algorithms. Here, a novel migration model inspired to the phenomenon known as biological invasion is adopted. The migration strategy is implemented through a ...
Comments