This paper presents a modified bacterial foraging optimization algorithm called crossover bacterial foraging optimization algorithm, which inherits the crossover technique of genetic algorithm. This can be used for improvising the evaluation of optimal objective function values. The idea of using crossover mechanism is to search nearby locations by offspring (50 percent of bacteria), because they are randomly produced at different locations. In the traditional bacterial foraging optimization algorithm, search starts from the same locations (50 percent of bacteria are replicated) which is not desirable. Seven different benchmark functions are considered for performance evaluation. Also, comparison with the results of previous methods is presented to reveal the effectiveness of the proposed algorithm.
CITATION STYLE
Panda, R., & Naik, M. K. (2012). A Crossover Bacterial Foraging Optimization Algorithm. Applied Computational Intelligence and Soft Computing, 2012, 1–7. https://doi.org/10.1155/2012/907853
Mendeley helps you to discover research relevant for your work.