Particle swarm optimization is an efficient population based algorithm used to solve real valued and nonlinear continuous optimization problems. To resolve binary optimization problems with PSO, binary particle swarm optimization (BPSO) has been developed. In this paper, optimum design of plates using BPSO is presented. The objective function aims at finding the optimum weight of plates with th...

This paper presents a biogeography-based optimization (BBO) algorithm to solve the economic loadDispatch (ELD) problem with generator constraints in thermal plants. The applied method can solvethe ELD problem with constraints like transmission losses, ramp rate limits, and prohibited operatingzones. Biogeography is the science of the geographical distribution of biological species. The modelsof...

In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...

The Particle Swarm Optimization (PSO) Algorithm is one of swarm intelligence optimization algorithms. Usually the population’s values of PSO algorithm are random which leads to random distribution of search quality and search velocity. This paper presents PSO based on uniform design (UD). UD is widely used in various applications and introduced to generate an initial population, in which the po...

Due to the fact that the error surface of adaptive infinite impulse response (IIR) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. In this case, global optimization techniques are required in order to avoid the local minima. Harmony search (HS), a musical inspired metaheuristic, is a recently ...

In this paper, a new version of multi-objective differential evolution with dynamically adaptable mutation factor is used for Pareto optimization of a 5-degree of freedom vehicle vibration model excited by non-stationary random road profile. In this way, non-dominated sorting algorithm and crowding distance criterion have been combined to differential evolution with fuzzified mutation in order ...

Dual Population Genetic Algorithm is an effective optimization algorithm that provides additional diversity to the main population. It deals with the premature convergence problem as well as the diversity problem associated with Genetic Algorithm. But dual population introduces additional search space that increases time required to find an optimal solution. This large scale search space proble...

Population based optimization algorithms are algorithms in which a set of input values (or candidate solutions, or positions within the problem search space) is maintained through the course of the algorithm, as opposed to non-population-based methods which generally examine only one input value at each iteration of the algorithm. We shall refer to these input values as “individuals”, although ...