%0 Journal Article
%T Terminating Evolutionary Algorithms at their Steady State
%A Debora Gil
%A David Roche
%A Agnes Borras
%A Jesus Giraldo
%J Computational Optimization and Applications
%D 2015
%V 61
%N 2
%I Springer US
%@ 0926-6003
%F Debora Gil2015
%O IAM; 600.044; 605.203; 600.060; 600.075
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=2560), last updated on Mon, 27 Jun 2016 17:12:37 +0200
%X 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 use a regression model in order to determine the requirements ensuring that a measure derived from EA evolving population is related to the distance to the optimum in decision variable space. Our framework is analyzed across 24 benchmark test functions and two standard termination criteria based on function fitness value in objective function space and EA population decision variable space distribution for the differential evolution (DE) paradigm. Results validate our framework as a powerful tool for determining the capability of a measure for terminating EA and the results also identify the decision variable space distribution as the best-suited for accurately terminating DE in real-world applications.
%K Evolutionary algorithms
%K Termination condition
%K Steady state
%K Differential evolution
%U http://dx.doi.org/10.1007/s10589-014-9722-4
%P 489-515