An offline learning co-evolutionary algorithm with problem-specific knowledge

被引:13
作者
Zhao, Fuqing [1 ]
Zhu, Bo [1 ]
Wang, Ling [2 ]
Xu, Tianpeng [1 ]
Zhu, Ningning [1 ]
Jonrinaldi, Jonrinaldi [3 ]
机构
[1] Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou 730050, Peoples R China
[2] Tsinghua Univ, Dept Automat, Beijing 10084, Peoples R China
[3] Univ Andalas, Dept Ind Engn, Padang 25163, Indonesia
基金
中国国家自然科学基金;
关键词
Fitness landscape; Random forest; Offline-learning; Estimation of distribution; Differential evolution; DIFFERENTIAL EVOLUTION; GAUSSIAN ESTIMATION; OPTIMIZATION; SEARCH; LANDSCAPES; ALLOCATION; SELECTION;
D O I
10.1016/j.swevo.2022.101148
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The meta-heuristics is an effective way to solve the complex optimization problems. However, the applicability of meta-heuristic is restricted in real applications due to the various characteristics of the corresponding problems. An offline learning co-evolutionary algorithm (OLCA) based on the fitness landscape analysis that introduces the Gaussian estimation of distribution algorithm (EDA) and a variant of differential evolution (DE) for enhancing the search ability, is proposed for complex continuous real-valued problems. The relationship between strategies and fitness landscapes is established by using offline learning of a random forest. The suitable strategy is determined based on the properties of the fitness landscape trained by a random forest before the beginning of the evolutionary process. The proposed OLCA is tested by using the CEC 2017 benchmark test suite and is compared with several state-of-the-art algorithms. The results show that the proposed OLCA is efficient and competitive for solving complex continuous optimization problems. In addition, the effectiveness of the proposed OLCA is also verified by using 19 IEEE CEC 2011 benchmark problems for tackling real-world problems.
引用
收藏
页数:19
相关论文
共 98 条
[1]  
[Anonymous], A machine learning method based on the genetic and world competitive, DOI DOI 10.5555/865123
[2]   What makes a VRP solution good? The generation of problem-specific knowledge for heuristics [J].
Arnold, Florian ;
Sorensen, Kenneth .
COMPUTERS & OPERATIONS RESEARCH, 2019, 106 :280-288
[3]  
Awad N. H., 2017, 2017 IEEE C EVOLUTIO, DOI DOI 10.1007/S00366-020-01233-2
[4]  
Bengio Y, 2019, Arxiv, DOI arXiv:1912.08112
[5]  
Bosman P.A.N., 2008, LECT NOTES COMPUTER, V5199
[6]   Hybridizing Biogeography-Based Optimization With Differential Evolution for Optimal Power Allocation in Wireless Sensor Networks [J].
Boussaid, Ilhem ;
Chatterjee, Amitava ;
Siarry, Patrick ;
Ahmed-Nacer, Mohamed .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2011, 60 (05) :2347-2353
[7]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[8]  
Brest J, 2017, IEEE C EVOL COMPUTAT, P1311, DOI 10.1109/CEC.2017.7969456
[9]  
Brest J, 2016, IEEE C EVOL COMPUTAT, P1188, DOI 10.1109/CEC.2016.7743922
[10]  
Cai Y., 2007, CROSS ENTROPY ADAPTI, DOI [10.1145/1276958.1277081, DOI 10.1145/1276958.1277081]