City Research Online

Abstract

In this article we present an Elitism Levels Traverse Mechanism that we designed to find bounds on population-based Evolutionary Algorithms solving unimodal functions. We prove its efficiency theoretically and test it on OneMax function deriving bounds cμn log n-O(μn). This analysis can be generalized to any similar algorithm using variants of elitist selection and genetic operators that flip or swap only 1 bit in each string.

Publication Type:	Conference or Workshop Item (Paper)
Additional Information:	© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Publisher Keywords:	Evolutionary computation; Genetic algorithms; Computational complexity
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments:	School of Science & Technology > Computer Science

Export

Downloads