Results 1 - 10
of
7,797
Completely Derandomized Self-Adaptation in Evolution Strategies
- Evolutionary Computation
, 2001
"... This paper puts forward two useful methods for self-adaptation of the mutation distribution -- the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adapta ..."
Abstract
-
Cited by 549 (58 self)
- Add to MetaCart
This paper puts forward two useful methods for self-adaptation of the mutation distribution -- the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self
A Survey of Evolution Strategies
- Proceedings of the Fourth International Conference on Genetic Algorithms
, 1991
"... Similar to Genetic Algorithms, Evolution Strategies (ESs) are algorithms which imitate the principles of natural evolution as a method to solve parameter optimization problems. The development of Evolution Strategies from the first mutation--selection scheme to the refined (¯,)--ES including the gen ..."
Abstract
-
Cited by 263 (3 self)
- Add to MetaCart
Similar to Genetic Algorithms, Evolution Strategies (ESs) are algorithms which imitate the principles of natural evolution as a method to solve parameter optimization problems. The development of Evolution Strategies from the first mutation--selection scheme to the refined (¯,)--ES including
Approximating the nondominated front using the Pareto Archived Evolution Strategy
- EVOLUTIONARY COMPUTATION
, 2000
"... We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its ..."
Abstract
-
Cited by 321 (19 self)
- Add to MetaCart
We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its
Evolution Strategies for Vector Optimization
- Parallel Problem Solving from Nature. 1st Workshop, PPSN I, volume 496 of Lecture Notes in Computer Science
, 1992
"... Evolution strategies --- a stochastic optimization method originally designed for single criterion problems --- have been modified in such a way that they can also tackle multiple criteria problems. Instead of computing only one efficient solution interactively, a decision maker can collect as many ..."
Abstract
-
Cited by 121 (2 self)
- Add to MetaCart
Evolution strategies --- a stochastic optimization method originally designed for single criterion problems --- have been modified in such a way that they can also tackle multiple criteria problems. Instead of computing only one efficient solution interactively, a decision maker can collect as many
Contemporary Evolution Strategies
, 1995
"... After an outline of the history of evolutionary algorithms, a new (¯; ; ; ae) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it is richer in the number of features than the meanwhile old (¯; ) and (¯+) versions. Finally, all important theor ..."
Abstract
-
Cited by 70 (2 self)
- Add to MetaCart
After an outline of the history of evolutionary algorithms, a new (¯; ; ; ae) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it is richer in the number of features than the meanwhile old (¯; ) and (¯+) versions. Finally, all important
Fast Evolution Strategies
- Control and Cybernetics
, 1997
"... Evolution strategies are a class of general optimisation algorithms which are applicable to functions that are multimodal, nondifferentiable, or even discontinuous. Although recombination operators have been introduced into evolution strategies, the primary search operator is still mutation. Classic ..."
Abstract
-
Cited by 51 (7 self)
- Add to MetaCart
Evolution strategies are a class of general optimisation algorithms which are applicable to functions that are multimodal, nondifferentiable, or even discontinuous. Although recombination operators have been introduced into evolution strategies, the primary search operator is still mutation
Evolution Strategies
, 2013
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
- Add to MetaCart
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Algorithms (X,sigma,eta) : quasi-random mutations for
Natural Evolution Strategies
"... Abstract — This paper presents Natural Evolution Strategies (NES), a novel algorithm for performing real-valued ‘black box ’ function optimization: optimizing an unknown objective function where algorithm-selected function measurements constitute the only information accessible to the method. Natura ..."
Abstract
-
Cited by 41 (22 self)
- Add to MetaCart
Abstract — This paper presents Natural Evolution Strategies (NES), a novel algorithm for performing real-valued ‘black box ’ function optimization: optimizing an unknown objective function where algorithm-selected function measurements constitute the only information accessible to the method
On the Adaptation of Arbitrary Normal Mutation Distributions in Evolution Strategies: The Generating Set Adaptation
, 1995
"... A new adaptation scheme for adapting arbitrary normal mutation distributions in evolution strategies is introduced. It can adapt correct scaling and correlations between object parameters. Furthermore, it is independent of any rotation of the objective function and reliably adapts mutation dis ..."
Abstract
-
Cited by 227 (31 self)
- Add to MetaCart
A new adaptation scheme for adapting arbitrary normal mutation distributions in evolution strategies is introduced. It can adapt correct scaling and correlations between object parameters. Furthermore, it is independent of any rotation of the objective function and reliably adapts mutation
Results 1 - 10
of
7,797