2019 IEEE Symposium Series on Computational Intelligence (SSCI) 2019
DOI: 10.1109/ssci44817.2019.9003130
|View full text |Cite
|
Sign up to set email alerts
|

Performance Study of Double-Niched Evolutionary Algorithm on Multi-objective Knapsack Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 18 publications
0
0
0
Order By: Relevance
“…As a result, it is reasonable to assume that the algorithm has some information loss, as some people are unable to alert the rest of society of its existence. [7] Strength by Objective is a new fitness allocation strategy that seeks to minimize the weaknesses presented by Strength, addressing these two problems:…”
Section: Strength By Objectivementioning
confidence: 99%
“…As a result, it is reasonable to assume that the algorithm has some information loss, as some people are unable to alert the rest of society of its existence. [7] Strength by Objective is a new fitness allocation strategy that seeks to minimize the weaknesses presented by Strength, addressing these two problems:…”
Section: Strength By Objectivementioning
confidence: 99%