This book explores the use of Evolutionary Algorithms (EAs) in dynamic optimization problems. Evolutionary Algorithms are powerful tools for optimization problems. Nevertheless, when the problem is dynamic, the EA can face difficulties due to the convergence of the population on a specific region of the search space. Different improvements have been made to the standard EA to make it more robust in dynamic problems: the increase of diversity, the incorporation of memory or the inclusion of anticipation methods. In this book we introduce important and novel contributions to address some of the drawbacks of current approaches. First, the book describes different approaches to make memory more useful and effective, including a new algorithm that evolves the best memory size according to the moment and characteristics of the dynamic problem. Second, the book analyses the importance of the population’s diversity in EAs for dynamic optimization problems, by using two different biologically inspired genetic operators. Third, different prediction techniques that allow the EA to forecast both the time of the next change and the direction of this change are introduced.