Foundations of global genetic optimization. With contribution by Henryk Telega.

DOI10.1007/978-3-540-73192-4MaRDI QIDQ2644258zbMATH OpenOpenAlexFDO

Authors Robert Schaefer

Publication date 7 September 2007

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73192-4

zbMATH Keywords

continuous global optimizationgenetic algorithmspopulation dynamics

Mathematics Subject Classification ID

Stochastic particle methods (65C35) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation methods and heuristics in mathematical programming (90C59) Clustering in the social and behavioral sciences (91C20) Population dynamics (general) (92D25)

Review text

This volume within the book series ``Studies in Computational Intelligence is devoted to the question whether and how genetic algorithms can be utilized to solve complex global contiunous optimization problems. The first author (Robert Schaefer) introduces into the field and focusses on the idea to model genetic algorithms as dynamic systems which transform the probabilistic sampling measure in a regular way (f.e. in density oriented clustering DC, followed by a local search in each cluster which is described in chapter 6 by the second author, Henryk Telega). This approach allows to find central parts of basins of attraction of the local minima rather than isolated minima itself. Of particular interest are the chapters about the analysis of asymptotic features and stopping rules, where the authors assume self-adapting genetic algorithms, which imply the uniform Markovian rule of state transition. A taxonomy and first short analysis of adaptive genetic search is given (in chapter 5) additionally. Applicability of global genetic search strategies seems to be restricted mainly to continuous global optimization problems where the focus is on recognition and approximation of basins of attraction and of level sets.

Recommendations

• scientific article; zbMATH DE number 1747648
• scientific article; zbMATH DE number 2086835
• A continuous genetic algorithm designed for the global optimization of multimodal functions
• Optimisation globale par stratégie d'évolution
• Parallel Processing and Applied Mathematics

Cited in

(9)

• An optimization method for chaotic turbulent flow
• The use of explicit building blocks in evolutionary computation
• Multi-deme, twin adaptive strategyhp-HGS
• An agent-based model of hierarchic genetic search
• scientific article; zbMATH DE number 1747648 (Why is no real title available?)
• scientific article; zbMATH DE number 1790598 (Why is no real title available?)
• scientific article; zbMATH DE number 2086835 (Why is no real title available?)
• A new approach for optimizing traffic signals in networks considering rerouting
• Understanding measure-driven algorithms solving irreversibly ill-conditioned problems

This page was built for publication: Foundations of global genetic optimization. With contribution by Henryk Telega.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644258)