ABSTRACT
Evolutionary Algorithms constitute a very active research branch of Computational Intelligence. Typically, such algorithms are used for the detection of (sub-) optimal solutions in difficult optimization problems. Numerous works have provided experimental evidence of the remarkable efficiency of Evolutionary Algorithms. However, their performance has proved to be strongly connected to their proper parametrization. Various approaches have been proposed for (offline) tuning and (online) control of their parameters. Recently, a grid-based technique was proposed for parameter adaptation during the algorithm's run without user intervention, and it was validated on the Differential Evolution algorithm, which is widely known for its parameter sensitivity. Experimental results on high-dimensional test problems verified the effectiveness of the technique on controlling the scalar parameters and crossover type of the algorithm. The present work extends that study by considering another crucial component of the algorithm, namely the mutation operator type. Extensive experiments enrich and verify the previous evidence, suggesting that grid-based search can maintain competitive performance while absolving the user from the laborious parameter-tuning phase.
- A. Auger and N. Hansen. A restart CMA evolution strategy with increasing population size. In Proc. of the 2005 IEEE Congress on Evolutionary Computation, pages 769--1776, 2005.Google ScholarCross Ref
- T. Bartz-Beielstein. Experimental Research in Evolutionary Computation: The New Experimentalism. Springer, 2006. Google ScholarDigital Library
- M. Birattari. Tuning Metaheuristics: A Machine Learning Perspective. Springer, 2009. Google ScholarDigital Library
- J. Brest, S. Greiner, B. Bošković, M. Mernik, and V. Žumer. Self-adapting control parameters in Differential Evolution: a comparative study on numerical benchmark problems. IEEE Transactions on Evolutionary Computation., 10(6):646--657, 2006. Google ScholarDigital Library
- S. Das and P. N. Suganthan. Differential Evolution: A survey of the state-of-the-art. IEEE Transactions on Evolutionary Computation, 15(1):4--31, 2011. Google ScholarDigital Library
- A. E. Eiben, R. Hinterding, and Z. Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2):124--141, 1999. Google ScholarDigital Library
- A. E. Eiben and S. K. Smit. Evolutionary algorithm parameters and methods to tune them. In Y. Hamadi, E. Monfroy, and F. Saubion, editors, Autonomous Search, chapter 2, pages 15--36. Springer, Berlin Heidelberg, 2011.Google Scholar
- A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing. Springer-Verlag, 2015. Google ScholarDigital Library
- Eshelman, L.J., and S. J.D. Real-coded genetic algorithms and interval-schemata. Foundations of Genetic Algorithms, 2:187--202, 1993.Google Scholar
- H. H. Hoos. Automated algorithm configuration and parameter tuning. In Y. Hamadi, E. Monfroy, and F. Saubion, editors, Autonomous Search, chapter 3, pages 37--72. Springer, Berlin Heidelberg, 2011.Google Scholar
- M. Lozano, F. Herrera, and D. Molina. Evolutionary algorithms and other metaheuristics for continuous optimization problems.Google Scholar
- M. Lozano, F. Herrera, and D. Molina. Editorial: scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems. Soft Computing, 15:2085--2087, 2011. Google ScholarDigital Library
- K. V. Price, R. M. Storn, and J. A. Lampinen. Differential Evolution: A Practical Approach to Global Optimization. Springer, Verlag, Berlin, 2005. Google ScholarDigital Library
- C. Segura, C. A. C. Coello, E. Segredo, and C. León. On the adaptation of the mutation scale factor in differential evolution. Optimization Letters, 9(1):189--198, 2015.Google ScholarCross Ref
- R. Storn and K. Price. Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optimization, 11:341--359, 1997. Google ScholarDigital Library
- R. Tanabe and A. Fukunaga. Success-history based parameter adaptation for differential evolution. In IEEE Congress on Evolutionary Computation, 2013.Google Scholar
- R. Tanabe and A. Fukunaga. Improving the search performance of SHADE using linear population size reduction. In IEEE Congress on Evolutionary Computation, 2014.Google Scholar
- K. Tang, X. Yao, P. N. Suganthan, C. MacNish, Y.-P. Chen, C.-M. Chen, and Z. Yang. Benchmark functions for the cec 2008 special session and competition on large scale global optimization. Nature Inspired Computation and Applications Laboratory, USTC, China, pages 153--177, 2007.Google Scholar
- V. A. Tatsis and K. E. Parsopoulos. Differential evolution with grid-based parameter adaptation. Soft Computing, 2015, in press.Google Scholar
- J. Tvrdík. Competitive differential evolution. In 12th International Coference on Soft Computing, 2006.Google Scholar
- J. Tvrdík and R. Poláková. Competitive differential evolution applied to CEC 2013 problems. In Evolutionary Computation (CEC), 2013 IEEE Congress on, pages 1651--1657. IEEE, 2013.Google ScholarCross Ref
- M. Weber, V. Tirronen, and F. Neri. Scale factor inheritance mechanism in distributed differential evolution. Soft Computing, 14:1187--1207, 2010. Google ScholarDigital Library
- D. Zaharie. A comparative analysis of crossover variants in differential evolution. Proceedings of IMCSIT, pages 171--181, 2007.Google Scholar
- D. Zaharie. Influence of crossover on the behavior of differential evolution algorithms. Applied Soft Computing, 9(3):1126--1138, 2009. Google ScholarDigital Library
- S. Zhao, P. Suganthan, and S. Das. Self-adaptive differential evolution with multi-trajectory search for large-scale optimization. Soft Comput., 15(11):2175--2185, 2011. Google ScholarDigital Library
Recommendations
Multi-population differential evolution with adaptive parameter control for global optimization
GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computationDifferential evolution (DE) is one of the most successful evolutionary algorithms (EAs) for global numerical optimization. Like other EAs, maintaining population diversity is important for DE to escape from local optima and locate a near-global optimum. ...
Levy distributed parameter control in differential evolution for numerical optimization
Differential evolution (DE) algorithm is a population based stochastic search technique widely applied in scientific and engineering fields for global optimization over real parameter space. The performance of DE algorithm highly depends on the ...
Multi-search differential evolution algorithm
The differential evolution algorithm (DE) has been shown to be a very simple and effective evolutionary algorithm. Recently, DE has been successfully used for the numerical optimization. In this paper, first, based on the fitness value of each ...
Comments