Memetic Algorithms: Parametrization and Balancing Local and Global Search

TL;DR

This chapter discusses how to effectively parameterize memetic algorithms and balance their global and local search components to improve optimization performance.

Contribution

It provides insights and methodologies for tuning memetic algorithms to achieve optimal search balance, enhancing their effectiveness.

Findings

Guidelines for parameter tuning

Strategies for balancing search components

Improved optimization performance

Abstract

This is a preprint of a book chapter from the Handbook of Memetic Algorithms, Studies in Computational Intelligence, Vol. 379, ISBN 978-3-642-23246-6, Springer, edited by F. Neri, C. Cotta, and P. Moscato. It is devoted to the parametrization of memetic algorithms and how to find a good balance between global and local search.