This paper presents simple proofs for the global convergence of evolution strategies in spherical problems. We investigate convergence properties for both adaptive and self-adaptive strategies. Regarding adaptive strategies, the convergence rates are computed explicitly and compared with the results obtained in the so-called “rate-of-progress” theory. Regarding self-adaptive strategies, the com...

The evolution of dispersal is examined by looking at evolutionarily stable strategies (ESS) for dispersal parameters in discrete time multisite models without any cost of dispersal. ESS are investigated analytically, based on explicit results on sensitivity analysis of matrix models. The basic model considers an arbitrary number of sites and a single age class. An ESS for dispersal parameters i...

An extension of the evolution strategy formixed-integer optimizationproblems is introduced. The resulting generalized evolution strategy is applied to the problem of optical multilayer coating design and the results are compared with results obtained by standard methods. The generalized evolution strategy as a synthesis method does not require the existence of a starting design, and it competes...

Evolution strategies (ES) are efficient optimization methods for continuous problems. However, many combinatorial optimization methods can not be represented by using continuous representations. The development of the network random key representation which represents trees by using real numbers allows one to use ES for combinatorial tree problems. In this paper we apply ES to tree problems usi...

ing Numerical Values in CLP(H,N) Gerda Janssens1, Maurice Bruynooghe1, Vincent Englebert2 1 Department of Computer Science, K.U. Leuven Celestijnenlaan 200A, B-3001 Heverlee, Belgium 2 Institut d'Informatique, Facult es Universitaires Notre Dame de la Paix rue GrandGagnage 21, B-5000 Namur, Belgium Abstract. The paper de nes approximations for the numerical leaves of variables in CLP(H,N) const...

During the last years the use of intelligent strategies for tuning Proportional-Integral-Derivative (PID) controllers has been growing. The evolutionary strategies have won an important place thanks to their flexibility. In this paper, the automatic tuning of systems with stable and unstable dynamics, through a genetic approach is presented. The advantages of the proposed approach ere highlight...

A Hodge structure V of weight k on which a CM eld acts de nes, under certain conditions, a Hodge structure of weight k 1, its half twist. In this paper we consider hypersurfaces in projective space with a cyclic automorphism which de nes an action of a cyclotomic eld on a Hodge substructure in the cohomology. We determine when the half twist exists and relate it to the geometry and moduli of th...

In this paper, we propose an efficient approximated rank one update for covariance matrix adaptation evolution strategy (CMA-ES). It makes use of two evolution paths as simple as that of CMA-ES, while avoiding the computational matrix decomposition. We analyze the algorithms’ properties and behaviors. We experimentally study the proposed algorithm’s performances. It generally outperforms or per...

The performance of (==;)-ESs (Evolution Strategies) in the asymptotic limit for N ! 1 and ! 1 is investigated. The conjecture made by Schwefel that the maximum performance of such strategies scales like ln(==) will be proved. Furthermore, it will be shown that an optimally tuned (==;)-ES performs exactly times faster than an optimally tuned (1+1)-ES, if the hyper-sphere is taken as the tness mo...

We present here a simple model of radiative gravitational collapse with radial heat flux which describes qualitatively the stages close to the formation of a superdense cold star. Starting with a static general solution for a cold star, the model can generate solutions for the earlier evolutionary stages. The temporal evolution of the model is specified by solving the junction conditions approp...