Treffer: Selection intensity in cellular evolutionary algorithms for regular lattices

Title:
Selection intensity in cellular evolutionary algorithms for regular lattices
Authors:
GIACOBINI, Mario, TOMASSINI, Marco, TETTAMANZI, Andrea G. B, ALBA, Enrique
Source:
IEEE transactions on evolutionary computation. 9(5):489-505
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2005.
Publication Year:
2005
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Algorithme génétique, Genetic algorithm, Algoritmo genético, Algorithme évolutionniste, Evolutionary algorithm, Algoritmo evoluciónista, Analyse quantitative, Quantitative analysis, Análisis cuantitativo, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Approximation polynomiale, Polynomial approximation, Aproximación polinomial, Classification hiérarchique, Hierarchical classification, Clasificación jerarquizada, Equation différences, Difference equation, Ecuación diferencias, Grille, Grid, Rejilla, Logistique, Logistics, Logística, Mise à jour, Updating, Actualización, Modélisation, Modeling, Modelización, Topologie, Topology, Topología, Tournoi, Tournament, Torneo, Treillis, Lattice, Enrejado, Algorithme cellulaire, Cellular algorithm, Algoritmo celular, Asynchronous dynamics, cellular evolutionary algorithms (cEAs), regular lattices, selection intensity, synchronous dynamics
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Information Systems Department, University of Lausanne, CP1 1015, Dorigny-Lausanne, Switzerland
Information Technologies Department University of Milano, 26013 Crema, Italy
Department of Computer Science, University of Málaga, 29071 Málaga, Spain
ISSN:
1089-778X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17159399
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17159399
Database:
PASCAL Archive

Weitere Informationen

In this paper, we present quantitative models for the selection pressure of cellular evolutionary algorithms on regular one- and two-dimensional (2-D) lattices. We derive models based on probabilistic difference equations for synchronous and several asynchronous cell update policies. The models are validated using two customary selection methods: binary tournament and linear ranking. Theoretical results are in agreement with experimental values, showing that the selection intensity can be controlled by using different update methods. It is also seen that the usual logistic approximation breaks down for low-dimensional lattices and should be replaced by a polynomial approximation. The dependence of the models on the neighborhood radius is studied for both topologies. We also derive results for 2-D lattices with variable grid axes ratio.