Betania Hernández-Ocaña

Learn More
This paper presents the mechanical synthesis of a four-bar mechanism, its definition as a constrained optimization problem in presence of one dynamic constraint and its solution with a swarm intelligence algorithm based on the bacteria foraging process. The algorithm is adapted to solve the optimization problem by adding a suitable constraint-handling(More)
The stepsize value is one of the most sensitive parameters in the bacterial foraging optimization algorithm when solving constrained numerical optimization problems. In this paper, four stepsize control mechanisms are proposed and analyzed in the modified bacterial foraging optimization algorithm. The first one is based on a random value which remains fixed(More)
—A review of the bacterial foraging optimization algorithm used to solve numerical constrained optimization problems is presented in this paper. After an introduction to the algorithm and its main elements, a taxonomy of constraint-handling techniques is presented and adopted to discuss the different approaches based on the algorithm. Aspects related to the(More)
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(More)
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(More)
This paper presents the solution of a real-world constrained bi-objective mechanical design problem in presence of a dynamic constraint by using the Modified Bacterial Foraging Optimization Algorithm. This algorithm, originally designed to solve single-objective optimization problems, is adapted to include in its processes Pareto dominance as selection(More)
  • 1