2012 IEEE Congress on Evolutionary Computation 2012
DOI: 10.1109/cec.2012.6256654
|View full text |Cite
|
Sign up to set email alerts
|

Finding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(17 citation statements)
references
References 9 publications
0
17
0
Order By: Relevance
“…Simulated binary crossover (SBX) [37] and polynomial mutation (PM) [38] were used for the crossover and mutation, respectively, of three NSGA-II algorithms: the original NSGA-II, the reference point-based-NSGA-II (R-NSGA-II) [39], and the extension ER-NSGA-II [40]. The root-mean-square error (RMSE) and logarithmically transformed RMSE (LOGE) between the observed and simulated hourly discharges were minimized simultaneously.…”
Section: Introductionmentioning
confidence: 99%
“…Simulated binary crossover (SBX) [37] and polynomial mutation (PM) [38] were used for the crossover and mutation, respectively, of three NSGA-II algorithms: the original NSGA-II, the reference point-based-NSGA-II (R-NSGA-II) [39], and the extension ER-NSGA-II [40]. The root-mean-square error (RMSE) and logarithmically transformed RMSE (LOGE) between the observed and simulated hourly discharges were minimized simultaneously.…”
Section: Introductionmentioning
confidence: 99%
“…We make use of the idea that the preference information given by reference point can guide the search towards better solutions corresponding to the preferences. However, if absence of the priori unknown of the searching space, it is difficult for decision maker to give a reasonable reference point and it is not involved in [15,16]. Aiming at the demand of our constraint solving, the two main contributions of our algorithms are: a dynamic reference point setting method according to the current distribution of solutions and a new crowding comparative operator which give priority to the distance ranking then to non-dominated ranking.…”
Section: Introductionmentioning
confidence: 98%
“…Reference-point multi-objective optimization idea is originally used to find a preferred solution [14] or preferred set solutions [15,16] near the reference point. We make use of the idea that the preference information given by reference point can guide the search towards better solutions corresponding to the preferences.…”
Section: Introductionmentioning
confidence: 99%
“…The crowding distance D M of point M is a measure of the objective space around M which is not occupied by any other solution in the population [26]. The main steps of NSGA-II procedure can be presented in the following steps [27]:…”
Section: Nsga-iimentioning
confidence: 99%