The Influence of Population and Memory Sizes on the Evolutionary Algorithm's Performance for Dynamic Environments

Authors:
Anabela Simões;Ernesto Costa
Affiliations:
Department of Informatics and Systems Engineering, Coimbra Polytechnic, and Centre for Informatics and Systems of the University of Coimbra,;Centre for Informatics and Systems of the University of Coimbra,
Venue:
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Year:
2009

Citing 7
Cited 0

Evolutionary Optimization in Dynamic Environments

Evolutionary Optimization in Dynamic Environments
Introduction to Evolutionary Computing

Introduction to Evolutionary Computing
Memory-based immigrants for genetic algorithms in dynamic environments

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Experimental study on population-based incremental learning algorithms for dynamic optimization problems

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Memory based on abstraction for dynamic fitness functions

Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Associative memory scheme for genetic algorithms in dynamic environments

EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Usually, evolutionary algorithms keep the size of the population fixed. In the context of dynamic environments, many approaches divide the main population into two, one part that evolves as usual another that plays the role of memory of past good solutions. The size of these two populations is often chosen off-line. Usually memory size is chosen as a small percentage of population size, but this decision can be a strong weakness in algorithms dealing with dynamic environments. In this work we do an experimental study about the importance of this parameter for the algorithm's performance. Results show that tuning the population and memory sizes is not an easy task and the impact of that choice on the algorithm's performance is significant. Using an algorithm that dynamically adjusts the population and memory sizes outperforms standard approach.