Standard Steady State Genetic Algorithms Can Hillclimb Faster Than Mutation-Only Evolutionary Algorithms
نویسندگان
چکیده
منابع مشابه
Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms
Explaining to what extent the real power of genetic algorithms lies in the ability of crossover to recombine individuals into higher quality solutions is an important problem in evolutionary computation. In this paper we show how the interplay between mutation and crossover can make genetic algorithms hillclimb faster than their mutation-only counterparts. We devise a Markov Chain framework tha...
متن کاملTerminating evolutionary algorithms at their steady state
Assessing the reliability of termination conditions for evolutionary algorithms (EAs) is of prime importance. An erroneous or weak stop criterion can negatively affect both the computational effort and the final result.We introduce a statistical framework for assessing whether a termination condition is able to stop an EA at its steady state, so that its results can not be improved anymore. We ...
متن کاملOn Replacement Strategies in Steady State Evolutionary Algorithms
Steady State models of Evolutionary Algorithms are widely used, yet surprisingly little attention has been paid to the effects arising from different replacement strategies. This paper explores the use of mathematical models to characterise the selection pressures arising in a selection-only environment. The first part brings together models for the behaviour of seven different replacement mech...
متن کاملReplacement Strategies in Steady State Genetic Algorithms: Static Environments
This paper investigates the effects of a number of replacement strategies for use in steady state genetic algorithms. Some of these (deleting the oldest, worst or random members, or deletion by “Kill Tournament”) are well known from the literature. The last, “conservative” replacement was developed for use in timevarying problems and combines a Replace–Oldest strategy with modified selection to...
متن کاملAn Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is adaptively computed along the run according to information extracted from the current population such as the existence of feasible individuals and the level of violation of each constraint. Using real coding, rank-base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2018
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2017.2745715