scholarly journals Enhanced Bacterial Foraging Optimization Based on Progressive Exploitation Toward Local Optimum and Adaptive Raid

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 95725-95738 ◽  
Author(s):  
Dongxing Wang ◽  
Xu Qian ◽  
Xiaojuan Ban ◽  
Boyuan Ma ◽  
Yan Ma ◽  
...  
Keyword(s):  
Local Optimum ◽  
Bacterial Foraging Optimization ◽  
Bacterial Foraging

scholarly journals Particle Swarm and Bacterial Foraging Inspired Hybrid Artificial Bee Colony Algorithm for Numerical Function Optimization

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Li Mao ◽  
Yu Mao ◽  
Changxi Zhou ◽  
Chaofeng Li ◽  
Xiao Wei ◽  
...  
Keyword(s):  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Function Optimization ◽  
Local Optimum ◽  
Search Range ◽  
Bacterial Foraging Optimization ◽  
Numerical Function ◽  
Bacterial Foraging ◽  
Bee Colony

Artificial bee colony (ABC) algorithm has good performance in discovering the optimal solutions to difficult optimization problems, but it has weak local search ability and easily plunges into local optimum. In this paper, we introduce the chemotactic behavior of Bacterial Foraging Optimization into employed bees and adopt the principle of moving the particles toward the best solutions in the particle swarm optimization to improve the global search ability of onlooker bees and gain a hybrid artificial bee colony (HABC) algorithm. To obtain a global optimal solution efficiently, we make HABC algorithm converge rapidly in the early stages of the search process, and the search range contracts dynamically during the late stages. Our experimental results on 16 benchmark functions of CEC 2014 show that HABC achieves significant improvement at accuracy and convergence rate, compared with the standard ABC, best-so-far ABC, directed ABC, Gaussian ABC, improved ABC, and memetic ABC algorithms.

scholarly journals Two-Swim Operators in the Modified Bacterial Foraging Algorithm for the Optimal Synthesis of Four-Bar Mechanisms

2016 ◽  
Vol 2016 ◽  
pp. 1-18 ◽  
Author(s):  
Betania Hernández-Ocaña ◽  
Ma. Del Pilar Pozos-Parra ◽  
Efrén Mezura-Montes ◽  
Edgar Alfredo Portilla-Flores ◽  
Eduardo Vega-Alvarado ◽  
...  
Keyword(s):  
Differential Evolution ◽  
Mechanical Design ◽  
Differential Evolution Algorithm ◽  
Fine Tuning ◽  
Local Optimum ◽  
Bacterial Foraging Optimization ◽  
Planar Mechanisms ◽  
Bacterial Foraging ◽  
Evolution Algorithm ◽  
Parameter Values

This paper presents two-swim operators to be added to the chemotaxis process of the modified bacterial foraging optimization algorithm to solve three instances of the synthesis of four-bar planar mechanisms. One swim favors exploration while the second one promotes fine movements in the neighborhood of each bacterium. The combined effect of the new operators looks to increase the production of better solutions during the search. As a consequence, the ability of the algorithm to escape from local optimum solutions is enhanced. The algorithm is tested through four experiments and its results are compared against two BFOA-based algorithms and also against a differential evolution algorithm designed for mechanical design problems. The overall results indicate that the proposed algorithm outperforms other BFOA-based approaches and finds highly competitive mechanisms, with a single set of parameter values and with less evaluations in the first synthesis problem, with respect to those mechanisms obtained by the differential evolution algorithm, which needed a parameter fine-tuning process for each optimization problem.

scholarly journals Incorporating Particle Swarm Optimization into Improved Bacterial Foraging Optimization Algorithm Applied to Classify Imbalanced Data

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 229 ◽  
Author(s):  
Fu-Lan Ye ◽  
Chou-Yuan Lee ◽  
Zne-Jung Lee ◽  
Jian-Qiong Huang ◽  
Jih-Fu Tu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm ◽  
Imbalanced Data ◽  
Pso Algorithm ◽  
Local Optimum ◽  
Bacterial Foraging Optimization ◽  
Swarm Optimization ◽  
Bacterial Foraging ◽  
Bacterial Foraging Optimization Algorithm

In this paper, particle swarm optimization is incorporated into an improved bacterial foraging optimization algorithm, which is applied to classifying imbalanced data to solve the problem of how original bacterial foraging optimization easily falls into local optimization. In this study, the borderline synthetic minority oversampling technique (Borderline-SMOTE) and Tomek link are used to pre-process imbalanced data. Then, the proposed algorithm is used to classify the imbalanced data. In the proposed algorithm, firstly, the chemotaxis process is improved. The particle swarm optimization (PSO) algorithm is used to search first and then treat the result as bacteria, improving the global searching ability of bacterial foraging optimization (BFO). Secondly, the reproduction operation is improved and the selection standard of survival of the cost is improved. Finally, we improve elimination and dispersal operation, and the population evolution factor is introduced to prevent the population from stagnating and falling into a local optimum. In this paper, three data sets are used to test the performance of the proposed algorithm. The simulation results show that the classification accuracy of the proposed algorithm is better than the existing approaches.

scholarly journals Bacterial Foraging Optimization Based on Self-Adaptive Chemotaxis Strategy

2020 ◽  
Vol 2020 ◽  
pp. 1-15
Author(s):  
Huang Chen ◽  
Lide Wang ◽  
Jun Di ◽  
Shen Ping
Keyword(s):  
Information Exchange ◽  
Global Optimum ◽  
The Self ◽  
Local Optimum ◽  
Step Size ◽  
Bacterial Foraging Optimization ◽  
Bacterial Foraging ◽  
Wide Range ◽  
Swarm Intelligence Optimization ◽  
Self Adaptive

Bacterial foraging optimization (BFO) algorithm is a novel swarm intelligence optimization algorithm that has been adopted in a wide range of applications. However, at present, the classical BFO algorithm still has two major drawbacks: one is the fixed step size that makes it difficult to balance exploration and exploitation abilities; the other is the weak connection among the bacteria that takes the risk of getting to the local optimum instead of the global optimum. To overcome these two drawbacks of the classical BFO, the BFO based on self-adaptive chemotaxis strategy (SCBFO) is proposed in this paper. In the SCBFO algorithm, the self-adaptive chemotaxis strategy is designed considering two aspects: the self-adaptive swimming based on bacterial search state features and the improvement of chemotaxis flipping based on information exchange strategy. The optimization results of the SCBFO algorithm are analyzed with the CEC 2015 benchmark test set and compared with the results of the classical and other improved BFO algorithms. Through the test and comparison, the SCBFO algorithm proves to be effective in reducing the risk of local convergence, balancing the exploration and the exploitation, and enhancing the stability of the algorithm. Hence, the major contribution in this research is the SCBFO algorithm that provides a novel and practical strategy to deal with more complex optimization tasks.

Economic Load Dispatch Using Bacterial Foraging Optimization Algorithm Based on Evolution Strategies

2013 ◽  
Vol 860-863 ◽  
pp. 2040-2045 ◽  
Author(s):  
Xiao Hua Feng ◽  
Yu Yao He ◽  
Juan Yu
Keyword(s):  
Search Space ◽  
Complex Problem ◽  
Evolution Strategies ◽  
Power Losses ◽  
Bacterial Foraging Optimization ◽  
Thermal Generation ◽  
Bacterial Foraging ◽  
Global And Local ◽  
Generation Test ◽  
Bacterial Foraging Optimization Algorithm

This paper presents a novel modified bacterial foraging optimization(BFO) to solve economic loaddispatch (ELD) problems. BFO isalready successfully employed to solve variousoptimization problems. However original BFOfor small problems with moderate dimensionand searching space is satisfactory. As searchspace and complexity growexponentially in scalable ELD problems, it shows poorconvergence properties. To tackle this complex problem considering itshigh-dimensioned search space, the Evolution Strategies is introduced to thebasic BFO. The chemotactic step is adjusted to have a dynamic non-linearbehavior in order to improve balancing the global and local search. Theproposed algorithm is validated using several thermal generation test systems.The results are compared with those obtained by other algorithms previouslyapplied to solve the problem considering valve-point effects and power losses.

Sign in / Sign up

Export Citation Format

Share Document