Loading [a11y]/accessibility-menu.js
A note on the first hitting time of (1 + λ) evolutionary algorithm for linear functions with boolean inputs | IEEE Conference Publication | IEEE Xplore

A note on the first hitting time of (1 + λ) evolutionary algorithm for linear functions with boolean inputs


Abstract:

Linear functions, as a canonical model of unimodal problems, have been widely used in the theoretical study of evolutionary algorithms (EAs). However in most of cases, on...Show More

Abstract:

Linear functions, as a canonical model of unimodal problems, have been widely used in the theoretical study of evolutionary algorithms (EAs). However in most of cases, only the simplest linear function, i.e. One-Max function, is taken in the theoretical study. A question arises naturally: whether can the results for One-Max function be generalized to linear functions? The main contribution of this paper is to generalize a result about the first hitting time of (1 + λ) EA from One-Max function to linear functions. A new proof is proposed based on drift analysis. This work is a direct extension of the previous analysis of (1 + 1) EA for linear functions.
Date of Conference: 18-23 July 2010
Date Added to IEEE Xplore: 27 September 2010
ISBN Information:

ISSN Information:

Conference Location: Barcelona, Spain

Contact IEEE to Subscribe

References

References is not available for this document.