Niching comprehensive learning gravitational search algorithm for multimodal optimization problems
Abstract Many niching algorithms have been proposed in recent times to cater complex real-world problems having several global/local optima. These algorithms help in locating as many global/local optima as possible. However, to explore the search space along with locating and maintaining a large number of global solutions is always a challenging problem. Hence, we propose a new niching strategy named, ‘niching Comprehensive Learning Gravitational Search algorithm’, in which the CLGSA algorithm is used to solve complex problems having multiple solutions. The proposed algorithm first efficiently tries to explore the search space without trapping in local optima’s and secondly it locates all possible global optima’s. This algorithm has an external memory that enhances its capability to find the maximum number of optima’s. The proposed approach is tested on the IEEE CEC-2013 Multimodal Optimization benchmark problems (Li et al. in Evolutionary computation and machine learning group, RMIT University, Melbourne, Australia, Technical Report, 2013). The results of the proposed scheme are compared with five other state-of-the-art methods. In order to show the efficiency of CLGSA algorithm over real-life multimodal optimization problems, it applied to non-linear, and a mixed variable problem this is, the Reactive Power Dispatch problem (RPD). A standard benchmark IEEE-57 bus system is considered to evaluate the efficiency of the CLGSA. The evaluated simulation results show that CLGSA algorithm successfully solve multimodal problems and the RPD problem with significant accuracy..
| Medienart: |
Artikel |
|---|
| Erscheinungsjahr: |
2021 |
|---|---|
| Erschienen: |
2021 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:15 |
|---|---|
| Enthalten in: |
Evolutionary intelligence - 15(2021), 1 vom: 01. Feb., Seite 695-721 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Bala, Indu [VerfasserIn] |
|---|
| Links: |
Volltext [lizenzpflichtig] |
|---|
| Themen: |
CLGSA |
|---|
| Anmerkungen: |
© The Author(s), under exclusive licence to Springer-Verlag GmbH, DE part of Springer Nature 2021 |
|---|
| doi: |
10.1007/s12065-020-00547-w |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
OLC2078176672 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2078176672 | ||
| 003 | DE-627 | ||
| 005 | 20230519000934.0 | ||
| 007 | tu | ||
| 008 | 221220s2021 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s12065-020-00547-w |2 doi | |
| 035 | |a (DE-627)OLC2078176672 | ||
| 035 | |a (DE-He213)s12065-020-00547-w-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 082 | 0 | 4 | |a 570 |q VZ |
| 100 | 1 | |a Bala, Indu |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Niching comprehensive learning gravitational search algorithm for multimodal optimization problems |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer-Verlag GmbH, DE part of Springer Nature 2021 | ||
| 520 | |a Abstract Many niching algorithms have been proposed in recent times to cater complex real-world problems having several global/local optima. These algorithms help in locating as many global/local optima as possible. However, to explore the search space along with locating and maintaining a large number of global solutions is always a challenging problem. Hence, we propose a new niching strategy named, ‘niching Comprehensive Learning Gravitational Search algorithm’, in which the CLGSA algorithm is used to solve complex problems having multiple solutions. The proposed algorithm first efficiently tries to explore the search space without trapping in local optima’s and secondly it locates all possible global optima’s. This algorithm has an external memory that enhances its capability to find the maximum number of optima’s. The proposed approach is tested on the IEEE CEC-2013 Multimodal Optimization benchmark problems (Li et al. in Evolutionary computation and machine learning group, RMIT University, Melbourne, Australia, Technical Report, 2013). The results of the proposed scheme are compared with five other state-of-the-art methods. In order to show the efficiency of CLGSA algorithm over real-life multimodal optimization problems, it applied to non-linear, and a mixed variable problem this is, the Reactive Power Dispatch problem (RPD). A standard benchmark IEEE-57 bus system is considered to evaluate the efficiency of the CLGSA. The evaluated simulation results show that CLGSA algorithm successfully solve multimodal problems and the RPD problem with significant accuracy. | ||
| 650 | 4 | |a Niching Algorithm | |
| 650 | 4 | |a CLGSA | |
| 650 | 4 | |a Evolutionary algorithms | |
| 650 | 4 | |a Power system | |
| 650 | 4 | |a Reactive power dispatch | |
| 700 | 1 | |a Yadav, Anupam |0 (orcid)0000-0002-9179-3151 |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Evolutionary intelligence |d Springer Berlin Heidelberg, 2008 |g 15(2021), 1 vom: 01. Feb., Seite 695-721 |w (DE-627)560434049 |w (DE-600)2416843-9 |w (DE-576)307016145 |x 1864-5909 |7 nnns |
| 773 | 1 | 8 | |g volume:15 |g year:2021 |g number:1 |g day:01 |g month:02 |g pages:695-721 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s12065-020-00547-w |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a SSG-OLC-DE-84 | ||
| 951 | |a AR | ||
| 952 | |d 15 |j 2021 |e 1 |b 01 |c 02 |h 695-721 | ||