𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Parameter Setting in Evolutionary Algorithms (Studies in Computational Intelligence, 54)

✍ Scribed by F.J. Lobo (editor), ClÑudio F. Lima (editor), Zbigniew Michalewicz (editor)


Publisher
Springer
Year
2007
Tongue
English
Leaves
323
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, operator probabilities, not to mention the representation and the operators themselves. This book gives the reader a solid perspective on the different approaches that have been proposed to automate control of these parameters as well as understanding their interactions. The book covers a broad area of evolutionary computation, including genetic algorithms, evolution strategies, genetic programming, estimation of distribution algorithms, and also discusses the issues of specific parameters used in parallel implementations, multi-objective evolutionary algorithms, and practical consideration for real-world applications. It is a recommended read for researchers and practitioners of evolutionary computation and heuristic methods.


πŸ“œ SIMILAR VOLUMES


Parameter Setting in Evolutionary Algori
✍ Kenneth De Jong (auth.), Fernando G. Lobo, ClΓ‘udio F. Lima, Zbigniew Michalewicz πŸ“‚ Library πŸ“… 2007 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, oper

Parameter Setting in Evolutionary Algori
✍ F.J. Lobo, ClΓ‘udio F. Lima, Zbigniew Michalewicz πŸ“‚ Library πŸ“… 2010 πŸ› Springer 🌐 English

One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, operato

Parameter Setting in Evolutionary Algori
✍ Kenneth De Jong (auth.), Fernando G. Lobo, ClΓ‘udio F. Lima, Zbigniew Michalewicz πŸ“‚ Library πŸ“… 2007 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, oper

Parameter Setting in Evolutionary Algori
✍ Kenneth De Jong (auth.), Fernando G. Lobo, ClΓ‘udio F. Lima, Zbigniew Michalewicz πŸ“‚ Library πŸ“… 2007 πŸ› Springer-Verlag Berlin Heidelberg 🌐 English

<p>One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, oper

Success in Evolutionary Computation (Stu
✍ Ang Yang (editor), Yin Shan (editor), Lam Thu Bui (editor) πŸ“‚ Library πŸ“… 2008 πŸ› Springer 🌐 English

<p><span>Darwinian evolutionary theory is one of the most important theories in human history for it has equipped us with a valuable tool to understand the amazing world around us. There can be little surprise, therefore, that Evolutionary Computation (EC), inspired by natural evolution, has been so

Archiving Strategies for Evolutionary Mu
✍ Oliver SchΓΌtze, Carlos HernΓ‘ndez πŸ“‚ Library πŸ“… 2021 πŸ› Springer 🌐 English

<div><p>This book presents an overview of archiving strategies developed over the last years by the authors that deal with suitable approximations of the sets of optimal and nearly optimal solutions of multi-objective optimization problems by means of stochastic search algorithms. All presented arch