A Note on the First Hitting Time of (1+N) Evolutionary Algorithm for Linear Functions with Boolean Inputs

Jun He

Research output: Chapter in Book/Report/Conference proceedingConference Proceeding (Non-Journal item)

4 Citations (SciVal)

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.
Original languageEnglish
Title of host publicationProceedings of 2010 IEEE Congress on Evolutionary Computation
PublisherIEEE Press
Pages1-6
Number of pages6
ISBN (Print)978-1-4244-6900-3
DOIs
Publication statusPublished - 27 Sept 2010
EventIEEE Congress on Evolutionary Computation (CEC) - Barcelona, Spain
Duration: 18 Jul 201023 Jul 2010

Conference

ConferenceIEEE Congress on Evolutionary Computation (CEC)
Country/TerritorySpain
CityBarcelona
Period18 Jul 201023 Jul 2010

Fingerprint

Dive into the research topics of 'A Note on the First Hitting Time of (1+N) Evolutionary Algorithm for Linear Functions with Boolean Inputs'. Together they form a unique fingerprint.

Cite this