Multi-objective differential evolution algorithm with data-driven selection strategy

被引：0
|
作者：
Hou Y. [1 ,2 ]
Wu Y.-L. [1 ,2 ]
Bai X. [1 ,3 ]
Han H.-G. [1 ,2 ,3 ]
机构：
[1] Faculty of Information Technology, Beijing University of Technology, Beijing
[2] Engineering Research Center of Digital Community of Ministry of Education, Beijing University of Technology, Beijing
[3] Beijing Key Laboratory of Computational Intelligence and Intelligent System, Beijing University of Technology, Beijing
来源：
Kongzhi yu Juece/Control and Decision | 2023年 / 38卷 / 07期
关键词：
data-driven; differential evolution algorithm; multi-objective optimization; non-dominated sorting; optimization efficiency; selection strategy;
D O I：
10.13195/j.kzyjc.2021.1957
中图分类号：
学科分类号：
摘要：
The multi-objective differential evolution (MODE) algorithm has high computational complexity of the selection strategy in solving complex multi-objective optimization problems. To address this issue, a multi-objective differential evolution with data-driven selection strategy (MODE-DDSS) is proposed. First, the ranking evaluation criteria of optimization solutions is designed, and the ranking evaluation database of optimization solutions based on evaluation criteria is established. Then, a data-driven selection strategy, based on a two-way search mechanism and a non-repeated comparison mechanism, is designed to search and compare the optimal solutions efficiently, and select the optimal solutions. Finally, a multi-objective differential evolution algorithm with the data-driven selection strategy is constructed, which reduces the complexity of optimal solution selection operation and improves the optimization efficiency of the algorithm. Experimental results show that the proposed MODE-DDSS algorithm can effectively reduce the number of comparison operations in the selection strategy, and improve the efficiency of the multi-objective differential evolution algorithm in solving complex multi-objective optimization problems. © 2023 Northeast University. All rights reserved.
引用
收藏
页码：1816 / 1824
页数：8
相关论文
共 31 条
  • [1] Wang J H, Ren W B, Zhang Z Z, Et al., A hybrid multiobjective memetic algorithm for multiobjective periodic vehicle routing problem with time windows, IEEE Transactions on Systems, Man, and Cybernetics: Systems, 50, 11, pp. 4732-4745, (2020)
  • [2] Han H G, Liu Z, Hou Y, Et al., Data-driven multiobjective predictive control for wastewater treatment process, IEEE Transactions on Industrial Informatics, 16, 4, pp. 2767-2775, (2020)
  • [3] Feng W Q, Gong D W., Multi-ob jective evolutionary optimization with ob jective space partition based on online perception of Pareto front, Acta Automatica Sinica, 46, 8, pp. 1628-1643, (2020)
  • [4] Wang Y, Wang L, Chen G C, Et al., An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice, Swarm and Evolutionary Computation, 55, (2020)
  • [5] Hou Y, Han H G, Qiao J F., Adaptive multi-objective differential evolution algorithm based on the dynamic parameters adjustment, Control and Decision, 32, 11, pp. 1985-1990, (2017)
  • [6] Hou Y, Wu Y L, Liu Z, Et al., Dynamic multi-objective differential evolution algorithm based on the information of evolution progress, Science China Technological Sciences, 64, 8, pp. 1676-1689, (2021)
  • [7] Chen X, Du W L, Qian F., Multi-objective differential evolution with ranking-based mutation operator and its application in chemical process optimization, Chemometrics and Intelligent Laboratory Systems, 136, 1, pp. 85-96, (2014)
  • [8] Zheng J H, Liu L, Li M Q, Et al., Difference selection strategy for solving complex multi-objective problems, Journal of Computer Research and Development, 52, 9, pp. 2123-2134, (2015)
  • [9] Deb K, Pratap A, Agarwal S, Et al., A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6, 2, pp. 182-197, (2002)
  • [10] Wang H D, Yao X., Corner sort for Pareto-based many-objective optimization, IEEE Transactions on Cybernetics, 44, 1, pp. 92-102, (2014)
1234