Search

Differential evolution (DE) is an efficient population-based search algorithm for solving numerical optimization problems. However, the performance of DE is very sensitive to the choice of mutation strategies and their associated control parameters. In this paper, we propose a self-adaptive multi-population differential evolution algorithm, called SAMDE. The population is randomly divided into three equally sized sub-populations, each with different mutation strategies. At the end of each generation, all sub-populations are updated independently and recombined. Each sub-population uses an adaptive mechanism for selecting how current generation control parameters are generated. An improved mutation strategy, "rand assemble/1", is proposed, its base vector is composed proportionally of three randomly selected individuals. The performance of SAMDE is evaluated on the suite of CEC 2005 benchmark functions. A comparative study is carried out with other state-of-the-art optimization techniques. The results show that SAMDE has a competitive performance compared to several other efficient DE variants. [ABSTRACT FROM AUTHOR]

Developing efficient algorithms for solving multi-objective optimization problems is a challenging and essential task in many applications. This task involves two or more conflicting objectives that need to be simultaneously optimized. Many real-world problems fall into this category. We introduce an improved version of multi-objective differential evolution (DE) algorithm, namely MO nDE that uses a new mutation strategy and a normalization method to select non-dominated solutions. The new mutation strategy 'DE/rand-to- nbest' uses the best normalized individual in terms of all the objectives to guide the search towards the true pareto optimal solutions. As a result, the probability of producing superior solutions is increased and a faster convergence is achieved. Summation of normalized objective values method is used instead of non-domination sorting to overcome the high computational complexity and overhead problems of sorting non-dominated solutions. The performance of our approach is tested on a set of benchmark problems that consist of two to five objectives. Different combinations of multi-objective evolutionary programming and multi-objective differential evolution algorithms have been used for comparisons. The results affirm the efficiency and robustness of the proposed approach among other well-known algorithms from the literature. [ABSTRACT FROM AUTHOR]

Constrained global optimization is a highly important and challenging task in the field of optimization, and is embedded in many science and engineering optimizations. In this paper, an improved dynamic membrane evolutionary algorithm based on particle swarm optimization and differential evolution (IDMEA-PSO/DE) is proposed to solve constrained engineering design problems. The method combines the dynamic membrane structure of P systems and the PSO/DE search strategy. The performance of IDMEA-PSO/DE is tested on several well-known engineering design problems. The results of the simulation experiments show that the proposed algorithm is effective and outperforms other state-of-the-art-algorithms. [ABSTRACT FROM AUTHOR]