2018
DOI: 10.1016/j.ins.2018.03.015
|View full text |Cite
|
Sign up to set email alerts
|

Decomposition-based sub-problem optimal solution updating direction-guided evolutionary many-objective algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(8 citation statements)
references
References 25 publications
0
6
0
Order By: Relevance
“…For each empty subpopulation, the associated weight vector will be replaced with a unit vector, which is randomly generated inside the range specified by the minimum and maximum objective values calculated from solutions in the current population; while the other weight vectors associated with the nonempty subpopulations remain unchanged. Likewise, some other variants replace each inactive weight vector with a new one defined by a solution least similar to the current active weight vectors where the similarity is measured by either the angle [50][51][52], cosine value [53] or perpendicular distance [54].…”
Section: Delete-and-add Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…For each empty subpopulation, the associated weight vector will be replaced with a unit vector, which is randomly generated inside the range specified by the minimum and maximum objective values calculated from solutions in the current population; while the other weight vectors associated with the nonempty subpopulations remain unchanged. Likewise, some other variants replace each inactive weight vector with a new one defined by a solution least similar to the current active weight vectors where the similarity is measured by either the angle [50][51][52], cosine value [53] or perpendicular distance [54].…”
Section: Delete-and-add Methodsmentioning
confidence: 99%
“…Model-based adaptation methods T-MOEA/D [33], paλ-MOEA/D [34], apa-MOEA/D [35], DMOEA/D [36] Polynomial model MOEA/D-LTD [37,38] Parametric model MOEA/D-SOM [39], MOEA/D-GNG [40,41] Neural networks Delete-and-add MOEA/D-AWA [42], MOEA/D-URAW [43,44], AdaW [45] Less crowded or promising areas CLIA [46], MOEA/D-AM2M [47,48] RVEA* [49], [50], iRVEA [51], OD-RVEA [52], EARPEA [53], g-DBEA [54] Away from the promising areas A-NSGA-III [55], A 2 -NSGA-III [56], AMOEA/D [57], MOEA/D-TPN [58],…”
Section: Subcategory Algorithm Name Core Techniquementioning
confidence: 99%
“…In the whole solution space S , the pareto solution set is a set composed of all the non‐dominated solutions 23 . The pareto frontier is defined as follows: a series of non‐dominated solutions form the Pareto solution set PS, 37 and the surface composed of their corresponding vectors is pareto frontier (PF) 38 …”
Section: Proposed Pga Algorithmmentioning
confidence: 99%
“…23 The pareto frontier is defined as follows: a series of non-dominated solutions form the Pareto solution set PS, 37 and the surface composed of their corresponding vectors is pareto frontier (PF). 38 All constraints are transformed into convex, and the optimization problem can be reformulated as…”
Section: Pareto Optimal Solution Theorymentioning
confidence: 99%
“…Dhiman et al (2020) designed a novel hybrid evolutionary algorithm based on the RVEA to achieve great convergence and the hypervolume estimation algorithm (HYPE) to estimate the exact hypervolume values and preserve diversity, which employed both the RVEA and HYPE features in the full sense and delivered better performance. Zhao et al (2018) modified the original RVEA by the mutation strategy to guide the evolutionary direction toward the sub-problem optimal solution. The updating direction of the solution in each sub-problem is MOEVSSP in the automotive industry used to guide the generation of subsequent offspring and speed up the searching of the algorithm.…”
Section: Introductionmentioning
confidence: 99%