The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2014
DOI: 10.1109/tcyb.2013.2282503
|View full text |Cite
|
Sign up to set email alerts
|

Evolutionary Algorithms With Segment-Based Search for Multiobjective Optimization Problems

Abstract: This paper proposes a variation operator, called segment-based search (SBS), to improve the performance of evolutionary algorithms on continuous multiobjective optimization problems. SBS divides the search space into many small segments according to the evolutionary information feedback from the set of current optimal solutions. Two operations, micro-jumping and macro-jumping, are implemented upon these segments in order to guide an efficient information exchange among "good" individuals. Moreover, the running… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
9
1

Relationship

3
7

Authors

Journals

citations
Cited by 38 publications
(15 citation statements)
references
References 57 publications
0
15
0
Order By: Relevance
“…When optimising an MOP, the current nondominated solutions (i.e., the best solutions found so far) during the evolutionary process can indicate the evolutionary status [41,54]. The nondominated solution set, with the progress of the evolution, gradually approximates the Pareto front, thus being likely to reflect the shape of the Pareto front provided that it is well maintained.…”
Section: Basic Ideamentioning
confidence: 99%
“…When optimising an MOP, the current nondominated solutions (i.e., the best solutions found so far) during the evolutionary process can indicate the evolutionary status [41,54]. The nondominated solution set, with the progress of the evolution, gradually approximates the Pareto front, thus being likely to reflect the shape of the Pareto front provided that it is well maintained.…”
Section: Basic Ideamentioning
confidence: 99%
“…Numeric comparing other HV with such a zero value is meaningless [43]. Thus, we consider this case as a failure for the corresponding algorithm, since its performance is significantly worse than those in this case.…”
Section: Performance Metricmentioning
confidence: 99%
“…When evolutionary algorithms (EAs) are applied in optimal models with multi-dimensional variables, the large search space may reduce search efficiency [30]. Moreover, an unreasonable evolutionary direction may yield local optimal solutions [31] instead of a globally optimal one Therefore, to better apply MOEAs to reservoir optimal operation models, a feasible search space that considers the characteristics of the IBWT project is proposed as an improved NSGA-II to solve the multi-objective model. The improved process can be described as follows:…”
Section: Feasible Search Spacementioning
confidence: 99%