Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

An evolutionary strategy for global minimization and its Markov chain analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Francois, Olivier ; Lab. de Modelisation et Calcul, Grenoble, France

The mutation-or-selection evolutionary strategy (MOSES) is presented. The goal of this strategy is to solve complex discrete optimization problems. MOSES evolves a constant sized population of labeled solutions. The dynamics employ mechanisms of mutation and selection. At each generation, the best solution is selected from the current population. A random binomial variable N which represents the number of offspring by mutation is sampled. Therefore the N first solutions are replaced by the offspring, and the other solutions are replaced by replicas of the best solution. The relationships between convergence, the parameters of the strategy, and the geometry of the optimization problem are theoretically studied. As a result, explicit parametrizations of MOSES are proposed

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:2 ,  Issue: 3 )