A Crossover Bacterial Foraging Optimization Algorithm. (9th October 2012)

• Record Type: Journal Article
• Authors: Panda, Rutuparna; Naik, Manoj Kumar
• Other Names: He Jun Academic Editor.
• Is Part Of: Applied computational intelligence and soft computing. Volume 2012(2012)
• Publication Date: 2012-10-09
• Subjects: Computational intelligence -- Periodicals; Soft computing -- Periodicals; 006.305
• DOI: 10.1155/2012/907853
• Languages: English
• ISSNs: 1687-9724

Abstract

Abstract : 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.