期刊
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
卷 24, 期 2, 页码 275-289出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2019.2921547
关键词
Optimization; Sociology; Evolutionary computation; Switches; Statistical analysis; Analytical models; Average gain model; evolutionary algorithms (EAs) for continuous optimization; experimental method; running time analysis
资金
- National Natural Science Foundation of China [61876207]
- Guangdong Natural Science Funds for Distinguished Young Scholar [2014A030306050]
- Guangdong High-Level Personnel of Special Support Program [2014TQ01X664]
- International Cooperation Project of Guangzhou [201807010047]
- Guangzhou Science and Technology Project [201802010007, 201804010276]
- Guangdong Province Key Area Research and Development Program [2018B010109003]
- Science Technique Department of Guizhou Province [[2019]1164]
Running time analysis is a fundamental problem of critical importance in evolutionary computation. However, the analysis results have rarely been applied to advanced evolutionary algorithms (EAs) in practice, let alone their variants for continuous optimization. In this paper, an experimental method is proposed for analyzing the running time of EAs that are widely used for solving continuous optimization problems. Based on Glivenko-Cantelli theorem, the proposed method simulates the distribution of gain, which is introduced by average gain model to characterize progress during the optimization process. Data fitting techniques are subsequently adopted to obtain a desired function for further analyses. To verify the validity of the proposed method, experiments were conducted to estimate the upper bounds on expected first hitting time of various evolutionary strategies, such as (1, $\lambda $ ) evolution strategy, standard evolution strategy, covariance matrix adaptation evolution strategy, and its improved variants. The results suggest that all estimated upper bounds are correct. Backed up by the proposed method, state-of-the-art EAs for continuous optimization will have identical results about the running time as simplified schemes, which will bridge the gap between theoretical foundation and applications of evolutionary computation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据