2015
DOI: 10.1016/j.swevo.2015.01.004
|View full text |Cite
|
Sign up to set email alerts
|

Novel search scheme for multi-objective evolutionary algorithms to obtain well-approximated and widely spread Pareto solutions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…A conceptual multiobjective evolutionary algorithm is suggested that uses the group features of the intermediate Pareto-set estimate to obtain a consistent final estimate. [24] suggested a design mode analysis of Pareto solution sets to help humans make decisions. PCA was used to extract the design mode of the Pareto solution set.…”
Section: Pareto Setsmentioning
confidence: 99%
“…A conceptual multiobjective evolutionary algorithm is suggested that uses the group features of the intermediate Pareto-set estimate to obtain a consistent final estimate. [24] suggested a design mode analysis of Pareto solution sets to help humans make decisions. PCA was used to extract the design mode of the Pareto solution set.…”
Section: Pareto Setsmentioning
confidence: 99%
“…Thus, the goal of multi-objective problems (MOP)s is to find the Pareto front and present such set of multiple alternative solutions to the decision maker for consideration. Over the past decades, a variety of multi-objective evolutionary algorithms (MOEA)s have been developed to solve MOPs (Hiwa et al 2015). MOEA is capable of returning a set of Pareto-optimal solutions in just a single run of the algorithm.…”
Section: Multi-objective Evolutionary Algorithmsmentioning
confidence: 99%
“…An enhanced GA method is introduced and utilized to solve this problem. [29][30][31][32] However, another difficulty is shown in this situation. The exact definition of the upper and lower bounds cannot be given by the binary relationship of preference components.…”
Section: Introductionmentioning
confidence: 99%