A Projection-Based Evolutionary Algorithm for Multi-Objective and Many-Objective Optimization

被引:1
作者
Peng, Funan [1 ,2 ,3 ]
Lv, Li [1 ,2 ]
Chen, Weiru [3 ]
Wang, Jun [3 ]
机构
[1] Chinese Acad Sci, Shenyang Inst Comp Technol, Shenyang 110168, Peoples R China
[2] Univ Chinese Acad Sci, Beijing 101408, Peoples R China
[3] Shenyang Univ Chem Technol, Coll Comp Sci & Technol, Shenyang 110142, Peoples R China
关键词
many-objective optimization; decomposition; evolutionary algorithm; projection plane; free dimension; objective domain; INDICATOR;
D O I
10.3390/pr11051564
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
Many-objective optimization problems (MaOPs) are challenging optimization problems in scientific research. Research has tended to focus on algorithms rather than algorithm frameworks. In this paper, we introduce a projection-based evolutionary algorithm, MOEA/PII. Applying the idea of dimension reduction and decomposition, it divides the objective space into projection plane and free dimension(s). The balance between convergence and diversity is maintained using a Bi-Elite queue. The MOEA/PII is not only an algorithm, but also an algorithm framework. We can choose a decomposition-based or dominance-based algorithm to be the free dimension algorithm. When it is an algorithm framework, it exhibits a better performance. We compare the performance of the algorithm and the algorithm with the MOEA/PII framework. The performance is evaluated by benchmark test instances DTLZ1-7 and WFG1-9 on 3, 5, 8, 10, and 15 objectives using IGD-metric and HV-metric. In addition, we investigated its superior performance on the wireless sensor networks deployment problem using C-metric. Moreover, determining objective domain for the objects of the wireless sensor networks deployment problem reduces the time and makes the solution set more responsive to user needs.
引用
收藏
页数:22
相关论文
共 40 条
[1]   A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization [J].
Asafuddoula, M. ;
Ray, Tapabrata ;
Sarker, Ruhul .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (03) :445-460
[2]   Evolutionary multi-objective optimization for bulldozer and its blade in soil cutting [J].
Barakat, Nada ;
Sharma, Deepak .
INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2019, 14 (02) :102-112
[3]   Evolutionary Many-Objective Algorithms for Combinatorial Optimization Problems: A Comparative Study [J].
Behmanesh, Reza ;
Rahimi, Iman ;
Gandomi, Amir H. .
ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2021, 28 (02) :673-688
[4]   Multi-Objective WSN Deployment Using Genetic Algorithms Under Cost, Coverage, and Connectivity Constraints [J].
Benatia, Mohamed Amin ;
Sahnoun, M'hammed ;
Baudry, David ;
Louis, Anne ;
El-Hami, Abdelkhalak ;
Mazari, Belahcene .
WIRELESS PERSONAL COMMUNICATIONS, 2017, 94 (04) :2739-2768
[5]   A Many-Objective Analysis Framework for Large Real-World Water Distribution System Design Problems [J].
Bi, Weiwei ;
Chen, Minjie ;
Shen, Shuwen ;
Huang, Zhiyuan ;
Chen, Jie .
WATER, 2022, 14 (04)
[6]   On statistical Multi-Objective optimization of sensor networks and optimal detector derivation for structural health monitoring [J].
Colombo, Luca ;
Todd, M. D. ;
Sbarufatti, C. ;
Giglio, M. .
MECHANICAL SYSTEMS AND SIGNAL PROCESSING, 2022, 167
[7]   A hybrid greedy indicator- and Pareto-based many-objective evolutionary algorithm [J].
de Oliveira, Matheus Carvalho ;
Delgado, Myriam Regattieri ;
Britto, Andre .
APPLIED INTELLIGENCE, 2021, 51 (07) :4330-4352
[8]  
Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032
[9]   A novel hybrid hypervolume indicator and reference vector adaptation strategies based evolutionary algorithm for many-objective optimization [J].
Dhiman, Gaurav ;
Soni, Mukesh ;
Pandey, Hari Mohan ;
Slowik, Adam ;
Kaur, Harsimran .
ENGINEERING WITH COMPUTERS, 2021, 37 (04) :3017-3035
[10]   KnRVEA: A hybrid evolutionary algorithm based on knee points and reference vector adaptation strategies for many-objective optimization [J].
Dhiman, Gaurav ;
Kumar, Vijay .
APPLIED INTELLIGENCE, 2019, 49 (07) :2434-2460