ABSTRACT
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of DE. Performance comparisons of the two proposed methods are provided against (a) the original DE, (b) the canonical particle swarm optimization (PSO), and (c) two PSO-variants. The new DE-variants are shown to be statistically significantly better on a seven-function test bed for the following performance measures: solution quality, time to find the solution, frequency of finding the solution, and scalability.
- Angeline, P. J. Evolutionary optimization versus particle swarm optimization: Philosophy and the performance difference, Lecture Notes in Computer Science (vol. 1447), Proceedings of 7th International Conference on. Evolutionary Programming - Evolutionary Programming VII (1998) 84--89. Google ScholarDigital Library
- Blackwell, T. A., Bentley, P. Improvised music with swarms, In Proceedings of IEEE Congress on Evolutionary Computation 2002, vol. 2, Honolulu, HI, (2002) 1462--1467. Google ScholarDigital Library
- Eberhart, R. C., Shi, Y. Particle swarm optimization: Developments, applications and resources, In Proceedings of IEEE International Conference on Evolutionary Computation, vol. 1, (2001) 81--86.Google Scholar
- Eberhart, R. C., Shi, Y. Comparing inertia weights and constriction factors in particle swarm optimization, Proceedings of IEEE International Congress on Evolutionary Computation, vol. 1, (2000) 84--88.Google ScholarCross Ref
- Kennedy, J., Eberhart, R. Particle swarm optimization, In Proceedings of IEEE International Conference on Neural Networks, (1995) 1942--1948.Google Scholar
- Kennedy, J. Stereotyping: Improving particle swarm performance with cluster analysis, Proc. IEEE Int. Conf. Evolutionary Computation, vol. 2, (2000) 303--308.Google ScholarCross Ref
- Shi, Y., Eberhart, R. C. Comparison between genetic algorithm and particle swarm optimization, Lecture Notes in Computer Science -- Evolutionary Programming VII, vol. 1447, (1998) 611--616. Google ScholarDigital Library
- Shi, Y., Eberhart, R. C. Parameter selection in particle swarm optimization, Lecture Notes in Computer Science Evolutionary Programming VII, vol. 1447, (1998) 591--600. Google ScholarDigital Library
- Shi, Y., Eberhart, R. C. Empirical study of particle swarm optimization. In Proceedings of IEEE International Conference on Evolutionary Computation, vol 3, (1999) 101--106.Google ScholarCross Ref
- Storn, R., Price, K. Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces, Journal of Global Optimization, 11(4) (1997) 341--359. Google ScholarDigital Library
- van den Bergh, F., Engelbrecht, P. A. Effects of swarm size on cooperative particle swarm optimizers, In Proceedings of GECCO-2001, San Francisco, CA, (2001) 892--899.Google Scholar
- Yao, X., Liu, Y., Lin, G. Evolutionary programming made faster, IEEE Transactions on Evolutionary Computation, vol 3, No 2, (1999) 82--102. Google ScholarDigital Library
Index Terms
- Two improved differential evolution schemes for faster global search
Recommendations
Ensemble of clearing differential evolution for multi-modal optimization
ICSI'12: Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part IMulti-modal Optimization refers to finding multiple global and local optima of a function in one single run, so that the user can have a better knowledge about different optimal solutions. Multiple global/local peaks generate extra difficulties for the ...
A hybrid particle swarm optimization approach with prior crossover differential evolution
GEC '09: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary ComputationParticle swarm optimization (PSO) is population-based heuristic searching algorithm. PSO has excellent ability of global optimization. However, there are some shortcomings of prematurity, low convergence accuracy and speed, similarly to other ...
Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems
Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problemsThis paper presents a novel algorithm based on generalized opposition-based learning (GOBL) to improve the performance of differential evolution (DE) to solve high-dimensional optimization problems efficiently. The proposed approach, namely GODE, ...
Comments