PKK Library

Your cart is empty.

Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Foundations of Global Genetic Optimization

By: Schaefer, Robert [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Studies in Computational Intelligence: 74Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.Description: XI, 222 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540731924.Subject(s): Engineering | Artificial intelligence | Applied mathematics | Engineering mathematics | Engineering | Appl.Mathematics/Computational Methods of Engineering | Artificial Intelligence (incl. Robotics)DDC classification: 519 Online resources: Click here to access online
Contents:
Global optimization problems -- Basic models of genetic computations -- Asymptotic behavior of the artificial genetic systems -- Adaptation in genetic search -- Two-phase stochastic global optimization strategies -- Summary and perspectives of genetic algorithms in continuous global optimization.
In: Springer eBooksSummary: This book is devoted to the application of genetic algorithms in continuous global optimization. Some of their properties and behavior are highlighted and formally justified. Various optimization techniques and their taxonomy are the background for detailed discussion. The nature of continuous genetic search is explained by studying the dynamics of probabilistic measure, which is utilized to create subsequent populations. This approach shows that genetic algorithms can be used to extract some areas of the search domain more effectively than to find isolated local minima. The biological metaphor of such behavior is the whole population surviving by rapid exploration of new regions of feeding rather than caring for a single individual. One group of strategies that can make use of this property are two-phase global optimization methods. In the first phase the central parts of the basins of attraction are distinguished by genetic population analysis. Afterwards, the minimizers are found by convex optimization methods executed in parallel.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK10156
Total holds: 0

Global optimization problems -- Basic models of genetic computations -- Asymptotic behavior of the artificial genetic systems -- Adaptation in genetic search -- Two-phase stochastic global optimization strategies -- Summary and perspectives of genetic algorithms in continuous global optimization.

This book is devoted to the application of genetic algorithms in continuous global optimization. Some of their properties and behavior are highlighted and formally justified. Various optimization techniques and their taxonomy are the background for detailed discussion. The nature of continuous genetic search is explained by studying the dynamics of probabilistic measure, which is utilized to create subsequent populations. This approach shows that genetic algorithms can be used to extract some areas of the search domain more effectively than to find isolated local minima. The biological metaphor of such behavior is the whole population surviving by rapid exploration of new regions of feeding rather than caring for a single individual. One group of strategies that can make use of this property are two-phase global optimization methods. In the first phase the central parts of the basins of attraction are distinguished by genetic population analysis. Afterwards, the minimizers are found by convex optimization methods executed in parallel.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha