Bacterial foraging optimization algorithm with mutation to solve constrained problems
نویسندگان
چکیده
منابع مشابه
Evolutionary bacterial foraging algorithm to solve constraint numerical optimization problems
A version of Modified Bacterial Foraging Optimization Algorithm to solve Constraints Numerical Optimization is tested. The proposal uses mutation operator, skew mechanism and local search operator. To prove the effectiveness of the mechanism and adaptations proposed, 24 well-known test problems are solved along set experiments. Performance measures are used for validating results obtained by th...
متن کاملA Cultural Algorithm with Differential Evolution to Solve Constrained Optimization Problems
A cultural algorithm is proposed in this paper. The main novel feature of this approach is the use of differential evolution as a population space. Differential evolution has been found to be very effective when dealing with real valued optimization problems. The knowledge sources contained in the belief space of the cultural algorithm are specifically designed according to the differential evo...
متن کاملA Study of Bacterial Foraging Optimization Algorithm and its Applications to Solve Simultaneous Equations
For the solution of a set equation (linear or non-linear) with n number (n > 1) of variables we need at least n number of different relations (called as rank). Our present work is showing how the bio-inspired Bacteria Foraging Optimization Algorithm (BFOA), which is mimicry of the life-cycle of common type of bacteria like E. Coli, can be used to solve such system of equation with rank less tha...
متن کاملA Simple Evolution Strategy to Solve Constrained Optimization Problems
In this paper, we argue that the self-adaptation mechanism of a conventional evolution strategy combined with some (very simple) tournament rules based on feasibility similar to some previous proposals (e.g., [1]) can provide us with a highly competitive evolutionary algorithm for constrained optimization. In our proposal, however, no extra mechanisms are provided to maintain diversity. In orde...
متن کاملμJADEε: Micro adaptive differential evolution to solve constrained optimization problems
A highly competitive micro evolutionary algorithm to solve unconstrained optimization problems called μJADE (micro adaptive differential evolution), is adapted to deal with constrained search spaces. Two constraint-handling techniques (the feasibility rules and the ε-constrained method) are tested in μJADE and their performance is analyzed. The most competitive version is then compared against ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitaria
سال: 2019
ISSN: 2007-9621,0188-6266
DOI: 10.15174/au.2019.2335