scholarly journals Bacterial foraging optimization algorithm with mutation to solve constrained problems

2019 ◽  
Vol 29 ◽  
pp. 1-16
Author(s):  
Betania Hernández-Ocaña ◽  
José Hernández-Torruco ◽  
Oscar Chávez-Bosquez ◽  
Juana Canul-Reich ◽  
Luis Gerardo Montané-Jiménez
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Search Space ◽  
Mutation Operator ◽  
Bacterial Foraging Optimization ◽  
Previous Version ◽  
Bacterial Foraging ◽  
Constrained Problems ◽  
Swarm Intelligence Algorithm ◽  
Bacterial Foraging Optimization Algorithm

A simple version of a Swarm Intelligence algorithm called bacterial foraging optimization algorithm with mutation and dynamic stepsize (BFOAM-DS) is proposed. The bacterial foraging algorithm has the ability to explore and exploit the search space through its chemotactic operator. However, premature convergence is a disadvantage. This proposal uses a mutation operator in a swim, similar to evolutionary algorithms, combined with a dynamic stepsize operator to improve its performance and allows a better balance between the exploration and exploitation of the search space. BFOAM-DS was tested in three well-known engineering design optimization problems. Results were analyzed with basic statistics and common measures for nature-inspired constrained optimization problems to evaluate the behavior of the swim with a mutation operator and the dynamic stepsize operator. Results were compared against a previous version of the proposed algorithm to conclude that BFOAM-DS is competitive and better than a previous version of the algorithm.

scholarly journals An Adaptive Bacterial Foraging Optimization Algorithm with Lifecycle and Social Learning

2012 ◽  
Vol 2012 ◽  
pp. 1-20 ◽  
Author(s):  
Xiaohui Yan ◽  
Yunlong Zhu ◽  
Hao Zhang ◽  
Hanning Chen ◽  
Ben Niu
Keyword(s):  
Social Learning ◽  
Population Size ◽  
Optimization Algorithm ◽  
Statistic Analysis ◽  
Bacterial Foraging Optimization ◽  
Bacterial Foraging ◽  
Bacterial Foraging Algorithm ◽  
Adaptive Step ◽  
Swarm Intelligence Algorithm ◽  
Bacterial Foraging Optimization Algorithm

Bacterial Foraging Algorithm (BFO) is a recently proposed swarm intelligence algorithm inspired by the foraging and chemotactic phenomenon of bacteria. However, its optimization ability is not so good compared with other classic algorithms as it has several shortages. This paper presents an improved BFO Algorithm. In the new algorithm, a lifecycle model of bacteria is founded. The bacteria could split, die, or migrate dynamically in the foraging processes, and population size varies as the algorithm runs. Social learning is also introduced so that the bacteria will tumble towards better directions in the chemotactic steps. Besides, adaptive step lengths are employed in chemotaxis. The new algorithm is named BFOLS and it is tested on a set of benchmark functions with dimensions of 2 and 20. Canonical BFO, PSO, and GA algorithms are employed for comparison. Experiment results and statistic analysis show that the BFOLS algorithm offers significant improvements than original BFO algorithm. Particulary with dimension of 20, it has the best performance among the four algorithms.

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.

Bacterial Foraging Optimization Algorithm with Quorum Sensing Mechanism

2014 ◽  
Vol 556-562 ◽  
pp. 3844-3848
Author(s):  
Hai Shen ◽  
Mo Zhang
Keyword(s):  
Quorum Sensing ◽  
Optimization Algorithm ◽  
Complex Adaptive Systems ◽  
Adaptive Systems ◽  
Cell Communication ◽  
Bacterial Foraging Optimization ◽  
Sensing Mechanism ◽  
Bacterial Foraging ◽  
Bacterial Quorum ◽  
Bacterial Foraging Optimization Algorithm

Quorum sensing is widely distributed in bacteria and make bacteria are similar to complex adaptive systems, with intelligent features such as emerging and non-linear, the ultimate expression of the adaptive to changes in the environment. Based on the phenomenon of bacterial quorum sensing and Bacterial Foraging Optimization Algorithm, some new optimization algorithms have been proposed. In this paper, it presents research situations, such as environment-dependent quorum sensing mechanism, quorum sensing mechanism with quantum behavior, cell-to-cell communication, multi-colony communication, density perception mechanism. Areas of future emphasis and direction in development were also pointed out.

A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining

2019 ◽  
pp. 587-608
Author(s):  
Pawan R. Bhaladhare ◽  
Devesh C. Jinwala
Keyword(s):  
Data Mining ◽  
Fractional Calculus ◽  
Optimization Algorithm ◽  
Information Loss ◽  
Bacterial Foraging Optimization ◽  
Bacterial Foraging ◽  
Individual Privacy ◽  
Clustering Approach ◽  
Bacterial Foraging Optimization Algorithm ◽  
Optimal Cluster

A tremendous amount of personal data of an individual is being collected and analyzed using data mining techniques. Such collected data, however, may also contain sensitive data about an individual. Thus, when analyzing such data, individual privacy can be breached. Therefore, to preserve individual privacy, one can find numerous approaches proposed for the same in the literature. One of the solutions proposed in the literature is k-anonymity which is used along with the clustering approach. During the investigation, the authors observed that the k-anonymization based clustering approaches all the times result in the loss of information. This paper presents a fractional calculus-based bacterial foraging optimization algorithm (FC-BFO) to generate an optimal cluster. In addition to this, the authors utilize the concept of fractional calculus (FC) in the chemotaxis step of a bacterial foraging optimization (BFO) algorithm. The main objective is to improve the optimization ability of the BFO algorithm. The authors also evaluate their proposed FC-BFO algorithm, empirically, focusing on information loss and execution time as a vital metric. The experimental evaluations show that our proposed FC-BFO algorithm generates an optimal cluster with lesser information loss as compared with the existing clustering approaches.

A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining

2016 ◽  
Vol 10 (1) ◽  
pp. 45-65 ◽  
Author(s):  
Pawan R. Bhaladhare ◽  
Devesh C. Jinwala
Keyword(s):  
Data Mining ◽  
Fractional Calculus ◽  
Optimization Algorithm ◽  
Information Loss ◽  
Bacterial Foraging Optimization ◽  
Bacterial Foraging ◽  
Individual Privacy ◽  
Clustering Approach ◽  
Bacterial Foraging Optimization Algorithm ◽  
Optimal Cluster

A tremendous amount of personal data of an individual is being collected and analyzed using data mining techniques. Such collected data, however, may also contain sensitive data about an individual. Thus, when analyzing such data, individual privacy can be breached. Therefore, to preserve individual privacy, one can find numerous approaches proposed for the same in the literature. One of the solutions proposed in the literature is k-anonymity which is used along with the clustering approach. During the investigation, the authors observed that the k-anonymization based clustering approaches all the times result in the loss of information. This paper presents a fractional calculus-based bacterial foraging optimization algorithm (FC-BFO) to generate an optimal cluster. In addition to this, the authors utilize the concept of fractional calculus (FC) in the chemotaxis step of a bacterial foraging optimization (BFO) algorithm. The main objective is to improve the optimization ability of the BFO algorithm. The authors also evaluate their proposed FC-BFO algorithm, empirically, focusing on information loss and execution time as a vital metric. The experimental evaluations show that our proposed FC-BFO algorithm generates an optimal cluster with lesser information loss as compared with the existing clustering approaches.

Sign in / Sign up

Export Citation Format

Share Document