By Topic

Evaluation of search performance of bacterial evolutionary algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

The search performance of evolutionary algorithms (EAs) has been widely studied. Interactions between genes in a chromosome, called "epistasis", make the theoretical investigation difficult. The goal of this study is a mathematical analysis of the effects of bacterial mutation on a bacterial evolutionary algorithm (BEA). The NK-landscape problem is employed for the investigation of this analysis in this paper. The search ability of bacterial mutation is formulated and compared with those of conventional mutation operations. It is shown that the bacterial mutation surpasses conventional ones in search performance

Published in:

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on  (Volume:2 )

Date of Conference:

2002