This paper presents a comparative study of Continuous Stirred Tank Reactor concentration control using Particle Swam Optimization and Bacterial Forging Optimization. Continuous stirred tank reactor plays a very important role in process industry. This paper presents the optimal design of PID controller based on Particle Swarm Optimization and Bacterial Forging Optimization. The first step is th...

Colliding Bodies Optimization (CBO) is a population-based metaheuristic algorithm that complies physics laws of momentum and energy. Due to the stagnation susceptibility of CBO by premature convergence and falling into local optima, some meritorious methodologies based on Sine Cosine Algorithm and a mutation operator were considered to mitigate the shortcomings mentioned earlier. Sine Cosine Al...

Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

Optimization is an area of mathematics that finds an optimum (minimum or maximum) of some function defined in a finite or infinite set. If the functions used for the problem formulation are continuous or piecewise continuous, we obtain a continuous optimization problem. When some practical task is formulated in the form of optimization problem, the success in its solution depends mainly on the ...

An algorithm with different parameter settings often performs differently on the same problem. The are difficult to determine before optimization process. variants of particle swarm (PSO) algorithms studied as exemplars intelligence algorithms. Based concept building block thesis, a PSO multiple phases was proposed analyze relation between search strategies and solved problems. Two algorithm, w...

We use the simple, but little-known, result that a uniformly continuous function on a convex set is -Lipschitz (as defined below) to extend Piyavskii’s algorithm for Lipschitz global optimization to the larger domain of continuous (not-necessarilyLipschitz) global optimization.

This work presents a method for optimum design of structures, where the design variables can he considered as Continuous or discrete. The variables are chosen as sizing variables as well as coordinates of joints. The main idea is to reduce the number of structural analyses and the overal cost of optimization. In each design cycle, first the structural response quantities such as forces, displac...

For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence number of G.