A Systematic Literature Review of Adaptive Parameter Control Methods for Evolutionary Algorithms

被引:115
作者
Aleti, Aldeida [1 ]
Moser, Irene [2 ]
机构
[1] Monash Univ, Fac Informat Technol, 900 Dandenong Rd, Caulfield, Vic 3145, Australia
[2] Swinburne Univ Technol, Fac Sci Engn & Technol, John St, Hawthorn, Vic 3122, Australia
基金
澳大利亚研究理事会;
关键词
Evolutionary algorithms; adaptive parameter control; PARALLEL GENETIC ALGORITHM; SELF-ADAPTATION; PENALTY-FUNCTION; POPULATION-SIZE; MUTATION-RATES; OPERATOR; OPTIMIZATION; EXPLORATION; STRATEGIES; TIME;
D O I
10.1145/2996355
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Evolutionary algorithms (EAs) are robust stochastic optimisers that perform well over a wide range of problems. Their robustness, however, may be affected by several adjustable parameters, such as mutation rate, crossover rate, and population size. Algorithm parameters are usually problem-specific, and often have to be tuned not only to the problem but even the problem instance at hand to achieve ideal performance. In addition, research has shown that different parameter values may be optimal at different stages of the optimisation process. To address these issues, researchers have shifted their focus to adaptive parameter control, in which parameter values are adjusted during the optimisation process based on the performance of the algorithm. These methods redefine parameter values repeatedly based on implicit or explicit rules that decide how to make the best use of feedback from the optimisation algorithm. In this survey, we systematically investigate the state of the art in adaptive parameter control. The approaches are classified using a new conceptual model that subdivides the process of adapting parameter values into four steps that are present explicitly or implicitly in all existing approaches that tune parameters dynamically during the optimisation process. The analysis reveals the major focus areas of adaptive parameter control research as well as gaps and potential directions for further development in this area.
引用
收藏
页数:35
相关论文
共 205 条
[31]   Learning While Optimizing an Unknown Fitness Surface [J].
Battiti, Roberto ;
Brunato, Mauro ;
Campigotto, Paolo .
LEARNING AND INTELLIGENT OPTIMIZATION, 2008, 5313 :25-40
[32]   Hybrid Genetic Algorithm with an Adaptive Penalty Function for Fitting Multimodal Experimental Data: Application to Exchange-Coupled Non-Kramers Binuclear Iron Active Sites [J].
Beaser, Eric ;
Schwartz, Jennifer K. ;
Bell, Caleb B., III ;
Solomon, Edward I. .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2011, 51 (09) :2164-2173
[33]  
Ben Hamida S., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P529
[34]   Parameter Control of Genetic Algorithms by Learning and Simulation of Bayesian Networks - A Case Study for the Optimal Ordering of Tables [J].
Bielza, Concha ;
Fernandez del Pozo, Juan A. ;
Larranaga, Pedro .
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2013, 28 (04) :720-731
[35]  
Böttcher S, 2010, LECT NOTES COMPUT SC, V6238, P1, DOI 10.1007/978-3-642-15844-5_1
[36]  
Budin L., 1998, Proceedings of NC 1998. International ICSC/IFAC Symposium on Neural Computation, P157
[37]   Hyper-heuristics: a survey of the state of the art [J].
Burke, Edmund K. ;
Gendreau, Michel ;
Hyde, Matthew ;
Kendall, Graham ;
Ochoa, Gabriela ;
Oezcan, Ender ;
Qu, Rong .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2013, 64 (12) :1695-1724
[38]  
Buzdalov M, 2013, 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P2245
[39]   Increasing Efficiency of Evolutionary Algorithms by Choosing between Auxiliary Fitness Functions with Reinforcement Learning [J].
Buzdalova, Arina ;
Buzdalov, Maxim .
2012 11TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA 2012), VOL 1, 2012, :150-155
[40]  
Candan Caner, 2013, Learning and Intelligent Optimization. 7th International Conference, LION 7. Revised Selected Papers: LNCS 7997, P253, DOI 10.1007/978-3-642-44973-4_26