Inproceedings,

Analysis of the (1+1) EA on Subclasses of Linear Functions under Uniform and Linear Constraints

, , , , and .
Foundations of Genetic Algorithms (FOGA), page 45-54. ACM Press, (2017)

Abstract

Linear functions have gained a lot of attention in the area of run time analysis of evolutionary computation methods and the corresponding analyses have provided many effective tools for analyzing more complex problems. In this paper, we consider the behavior of the classical (1+1) Evolutionary Algorithm for linear functions under linear constraint. We show tight bounds in the case where both the objective function and the constraint is given by the OneMax function and present upper bounds as well as lower bounds for the general case. Furthermore, we also consider the LeadingOnes fitness function.

Tags

Users

  • @typo3tester

Comments and Reviews