Memetic Algorithms: Parametrization and Balancing Local and Global Search

09/29/2011
by   Dirk Sudholt, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/28/2020

Local-to-Global Contraction in Simplicial Complexes

We give a local-to-global principle for relative entropy contraction in ...
research
01/04/2021

Global2Local: Efficient Structure Search for Video Action Segmentation

Temporal receptive fields of models play an important role in action seg...
research
05/16/2014

Empirical Study of Artificial Fish Swarm Algorithm

Artificial fish swarm algorithm (AFSA) is one of the swarm intelligence ...
research
10/07/2009

Dynamic Demand-Capacity Balancing for Air Traffic Management Using Constraint-Based Local Search: First Results

Using constraint-based local search, we effectively model and efficientl...
research
04/12/2011

Extracting Parts of 2D Shapes Using Local and Global Interactions Simultaneously

Perception research provides strong evidence in favor of part based repr...
research
04/02/2020

Trustless parallel local search for effective distributed algorithm discovery

Metaheuristic search strategies have proven their effectiveness against ...
research
08/12/2020

A new notion of commutativity for the algorithmic Lovász Local Lemma

The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combina...

Please sign up or login with your details

Forgot password? Click here to reset