Non-Dominated Sorting Social Group Optimization Algorithm for Multi-Objective Optimization
IR@NISCAIR: CSIR-NISCAIR, New Delhi - ONLINE PERIODICALS REPOSITORY (NOPR)
View Archive Info| Field | Value | |
| Title |
Non-Dominated Sorting Social Group Optimization Algorithm for Multi-Objective Optimization
|
|
| Creator |
Naik, Anima
Jena, Junali Jasmine Satapathy, Suresh Chandra |
|
| Subject |
Crowding distance
Posterior Approach Pareto fronts Ranks |
|
| Description |
129-136
In this paper, authors have proposed a posterior multi-objective optimization algorithm named Non-dominated Sorting Social Group Optimization (NSSGO) for multi-objective optimization. ‘Non-dominated Sorting’ is the technique of sorting the population into several non-domination levels and ‘Crowding Distance’ is a concept used for maintaining diversity among the current best solutions. The algorithm acquires the combined concept of both. The proposed algorithm was simulated on a set of multi-objective CEC 2009 functions and competitive results were obtained. |
|
| Date |
2021-02-04T07:36:13Z
2021-02-04T07:36:13Z 2021-02 |
|
| Type |
Article
|
|
| Identifier |
0975-1084 (Online); 0022-4456 (Print)
http://nopr.niscair.res.in/handle/123456789/56130 |
|
| Language |
en_US
|
|
| Rights |
<img src='http://nopr.niscair.res.in/image/cc-license-sml.png'> <a href='http://creativecommons.org/licenses/by-nc-nd/2.5/in' target='_blank'>CC Attribution-Noncommercial-No Derivative Works 2.5 India</a>
|
|
| Publisher |
NISCAIR-CSIR, India
|
|
| Source |
JSIR Vol.80(02) [February 2021]
|
|