Adaptive Differential Evolution based on Exploration and Exploitation Control
Authors: 
Hao Bai, Changwu Huang, Xin YaoAuthors Info & Claims
Hao Bai, Changwu Huang, Xin YaoAuthors Info & ClaimsPages 41 - 48
Abstract
Search operator design and parameter tuning are essential parts of algorithm design. However, they often involve trial-and-error and are very time-consuming. A new differential evolution (DE) algorithm with adaptive exploration and exploitation control (AEEC-DE) is proposed in this work to tackle this challenge. The proposed method improves the performance of DE by automatically selecting trial vector generation strategies (both mutation and crossover operators) and dynamically generating the associated control parameter values. A probability-based exploration and exploitation measurement is introduced to estimate whether the state of each newly generated individual is in exploration or exploitation. The state of historical individuals is used to assess the exploration and exploitation capabilities of different generation strategies and parameter values. Then, the strategies and parameters of DE are adapted following the common belief that evolutionary algorithms (EAs) should start with exploration and then gradually change into exploitation. The performance of AEEC-DE is evaluated through experimental studies on a set of test problems and compared with several state-of-the-art adaptive DE variants.
References
[1]
H. H. Hoos, Automated Algorithm Configuration and Parameter Tuning. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 37–71.
[2]
C. Huang, Y. Li, and X. Yao, “A survey of automatic parameter tuning methods for metaheuristics,” IEEE Transactions on Evolutionary Computation, vol. 24, no. 2, pp. 201–216, 2020.
[3]
S. Liu, K. Tang, Y. Lei, and X. Yao, “On performance estimation in automatic algorithm configuration,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 03, 2020, pp. 2384–2391.
[4]
G. Karafotias, M. Hoogendoorn, and A. E. Eiben, “Parameter control in evolutionary algorithms: Trends and challenges,” IEEE Transactions on Evolutionary Computation, vol. 19, no. 2, pp. 167–187, 2015.
[5]
C. Huang, B. Yuan, Y. Li, and X. Yao, “Automatic parameter tuning using bayesian optimization method,” in 2019 IEEE Congress on Evolutionary Computation (CEC), 2019, pp. 2090–2097.
[6]
F. Hutter, H. H. Hoos, K. Leytonbrown, and T. Stutzle, “ParamILS: an automatic algorithm configuration framework,” Journal of Artificial Intelligence Research, vol. 36, no. 1, pp. 267–306, 2009.
[7]
F. Hutter, H. H. Hoos, and K. Leyton-Brown, “Sequential model-based optimization for general algorithm configuration,” in Learning and Intelligent Optimization, C. A. C. Coello, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 507–523.
[8]
R. Storn and K. Price, “Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces,” Journal of Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.
[9]
X. Lu, K. Tang, B. Sendhoff, and X. Yao, “A new self-adaptation scheme for differential evolution,” Neurocomputing, vol. 146, pp. 2–16, 2014.
[10]
K. Opara and J. Arabas, “Comparison of mutation strategies in differential evolution-a probabilistic perspective,” Swarm and Evolutionary Computation, vol. 39, pp. 53–69, 2018.
[11]
W. Gong, Álvaro Fialho, Z. Cai, and H. Li, “Adaptive strategy selection in differential evolution for numerical optimization: An empirical study,” Information Sciences, vol. 181, no. 24, pp. 5364 – 5386, 2011.
[12]
J. Zhang and A. C. Sanderson, “JADE: Adaptive differential evolution with optional external archive,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 5, pp. 945–958, 2009.
[13]
A. K. Qin, V. L. Huang, and P. N. Suganthan, “Differential evolution algorithm with strategy adaptation for global numerical optimization,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 2, pp. 398–417, 2009.
[14]
K. R. Opara and J. Arabas, “Differential evolution: A survey of theoretical analyses,” Swarm and Evolutionary Computation, vol. 44, pp. 546–558, 2019.
[15]
S. Das, S. S. Mullick, and P. N. Suganthan, “Recent advances in differential evolution–an updated survey,” Swarm and Evolutionary Computation, vol. 27, pp. 1–30, 2016.
[16]
S. Das and P. N. Suganthan, “Differential evolution: A survey of the state-of-the-art,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 4–31, 2011.
[17]
J. Brest, S. Greiner, B. Boskovic, M. Mernik, and V. Zumer, “Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 6, pp. 646–657, 2006.
[18]
A. K. Qin, V. L. Huang, and P. N. Suganthan, “Differential evolution algorithm with strategy adaptation for global numerical optimization,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 2, pp. 398–417, 2009.
[19]
R. Mallipeddi, P. N. Suganthan, Q.-K. Pan, and M. F. Tasgetiren, “Differential evolution algorithm with ensemble of parameters and mutation strategies,” Applied soft computing, vol. 11, no. 2, pp. 1679–1696, 2011.
[20]
Z. Yang, K. Tang, and X. Yao, “Scalability of generalized adaptive differential evolution for large-scale continuous optimization,” Soft Computing, vol. 15, no. 11, pp. 2141–2155, 2011.
[21]
Q. Fan, W. Wang, and X. Yan, “Differential evolution algorithm with strategy adaptation and knowledge-based control parameters,” Artificial Intelligence Review, vol. 51, no. 2, pp. 219–253, 2019.
[22]
Y. Wang, Z. Cai, and Q. Zhang, “Differential evolution with composite trial vector generation strategies and control parameters,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 55–66, 2011.
[23]
M. Crepinsek, S. Liu, and M. Mernik, “Exploration and exploitation in evolutionary algorithms: A survey,” ACM Comput. Surv., vol. 45, no. 3, pp. 35:1–35:33, 2013.
[24]
E. Parzen, “On estimation of a probability density function and mode,” The Annals of Mathematical Statistics, vol. 33, no. 3, pp. 1065–1076, sep 1962.
[25]
Y.-C. Chen, “A tutorial on kernel density estimation and recent advances,” Biostatistics & Epidemiology, vol. 1, no. 1, pp. 161–187, 2017.
[26]
R. S. Sutton and A. G. Barto, Reinforcement learning: An introduction. MIT press, 2018.
[27]
P. Auer, N. Cesa-Bianchi, and P. Fischer, “Finite-time analysis of the multiarmed bandit problem,” Mach. Learn., vol. 47, no. 2-3, pp. 235–256, 2002.
[28]
V. Kuleshov and D. Precup, “Algorithms for multi-armed bandit problems,” Journal of Machine Learning Research, vol. 1, pp. 1–48, 2000.
[29]
G. Lu, J. Li, and X. Yao, “Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms,” in European Conference on Evolutionary Computation in Combinatorial Optimization. Springer, 2011, pp. 108–117.
[30]
S. Das, A. Konar, and U. K. Chakraborty, “Two improved differential evolution schemes for faster global search,” in Genetic and Evolutionary Computation Conference, GECCO 2005, Proceedings, Washington DC, USA, June 25-29, 2005, H. Beyer and U. O’Reilly, Eds. ACM, 2005, pp. 991–998.
[31]
N. H. Awad, M. Z. Ali, J. J. Liang, B. Y. Qu, and P. N. Suganthan, “Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective bound constrained real-parameter numerical optimization,” Nanyang Technological University, Singapore, Tech. Rep., 2016.
[32]
J. Demšar, “Statistical comparisons of classifiers over multiple data sets,” Journal of Machine Learning Research, vol. 7, pp. 1–30, Dec. 2006.
Index Terms
- Adaptive Differential Evolution based on Exploration and Exploitation Control
Index terms have been assigned to the content through auto-classification.
Recommendations
Modified clustering-based differential evolution with a flexible combination of exploration and exploitation
Differential evolution (DE) has been extensively used in optimization problem. However, original DE has some shortcomings. Up to now, there have been a lot of its variations. In this paper, a modified version of differential evolution algorithm is ...
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. ...
Disturbed Exploitation compact Differential Evolution for limited memory optimization problems
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local ...
Comments
Information & Contributors
Information
Published In
Jun 2021
2584 pages
Copyright © 2021.
Publisher
IEEE Press
Publication History
Published: 28 June 2021
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025