2008 Fourth International Conference on Natural Computation 2008
DOI: 10.1109/icnc.2008.532
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Crowding Distance?A New Diversity Maintenance Strategy for MOEAs

Abstract: In multi-objective evolutionary algorithms (MOEAs), the diversity of Pareto front (PF) is significant. For good diversity can provide more reasonable choices to decision-makers. The diversity of PF includes the span and the uniformity. In this paper, we proposed a dynamic crowding distance (DCD) based diversity maintenance strategy (DMS) (DCD-DMS), in which individual's DCD are computed based on the difference degree between the crowding distances of different objectives. The proposed strategy computes individ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
62
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 85 publications
(62 citation statements)
references
References 10 publications
0
62
0
Order By: Relevance
“…If the basement CD is applied, individuals that can help to maintain a uniform spread are removed. To overcome the drawback of NSGA-II, a dynamic crowding distance (DCD) is introduced as described in [25]. Above all, the biggest difference between CD and DCD is that CD is just calculated once, but DCD is varied during the selection of offspring generation:…”
Section: Dynamic Crowding Distancementioning
confidence: 99%
“…If the basement CD is applied, individuals that can help to maintain a uniform spread are removed. To overcome the drawback of NSGA-II, a dynamic crowding distance (DCD) is introduced as described in [25]. Above all, the biggest difference between CD and DCD is that CD is just calculated once, but DCD is varied during the selection of offspring generation:…”
Section: Dynamic Crowding Distancementioning
confidence: 99%
“…The major drawback of crowding distance is the lack of uniform diversity in obtained nondominated solutions. To overcome this problem, DCD method is suggested in [35]. The DCD of individuals is calculated based on…”
Section: Dynamic Crowding Distance (Dcd) Algorithmmentioning
confidence: 99%
“…In order to improve the diversity of the external archive, this paper employs a diversity maintenance strategy (DMS) based on dynamic crowding distance (DCD) [35], a revised version of crowding distance (CD) proposed in NSGA-II. The DCD of the individual is given as follows:…”
Section: Dynamic Crowding Distancementioning
confidence: 99%