Abstract
In order to improve the performance of BFO (bacterial foraging optimization) algorithm in multi-modal problems, the algorithm is optimized and improved in this paper. In the chemotaxis operation, the gradient accumulation variable swimming step size is realized, and the convergence speed of the algorithm is accelerated. In the reproduction operation, a new population competition mechanism is added, and a double-index sorting is realized, which improves the ability of the algorithm to jump out of the local optimum and the diversity of the population. In the migration operation, the vitality index of bacteria is added to dynamically affect the migration probability, ensure the survival probability of elite individuals, and further improve the global optimization ability of the algorithm. Finally, a multi-modal function is selected to test. Compared with the genetic algorithm, the improved BFO algorithm is better than the genetic algorithm in speed and quality.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
