Optimizing Niche Center for Multimodal Optimization Problems
Many real-world optimization problems require searching for multiple optimal solutions simultaneously, which are called multimodal optimization problems (MMOPs). For MMOPs, the algorithm is required both to enlarge population diversity for locating more global optima and to enhance refine ability for increasing the accuracy of the obtained solutions. Thus, numerous niching techniques have been proposed to divide the population into different niches, and each niche is responsible for searching on one or more peaks. However, it is often a challenge to distinguish proper individuals as niche centers in existing niching approaches, which has become a key issue for efficiently solving MMOPs. In this article, the niche center distinguish (NCD) problem is treated as an optimization problem and an NCD-based differential evolution (NCD-DE) algorithm is proposed. In NCD-DE, the niches are formed by using an internal genetic algorithm (GA) to online solve the NCD optimization problem. In the internal GA, a fitness-entropy measurement objective function is designed to evaluate whether a group of niche centers (i.e., encoded by a chromosome in the internal GA) is promising. Moreover, to enhance the exploration and exploitation abilities of NCD-DE in solving the MMOPs, a niching and global cooperative mutation strategy that uses both niche and population information is proposed to generate new individuals. The proposed NCD-DE is compared with some state-of-the-art and recent well-performing algorithms. The experimental results show that NCD-DE achieves better or competitive performance on both the accuracy and completeness of the solutions than the compared algorithms.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2023 |
|---|---|
| Erschienen: |
2023 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:53 |
|---|---|
| Enthalten in: |
IEEE transactions on cybernetics - 53(2023), 4 vom: 17. Apr., Seite 2544-2557 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Jiang, Yi [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
|---|
| Anmerkungen: |
Date Completed 10.04.2023 Date Revised 10.04.2023 published: Print-Electronic Citation Status PubMed-not-MEDLINE |
|---|
| doi: |
10.1109/TCYB.2021.3125362 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM334556805 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM334556805 | ||
| 003 | DE-627 | ||
| 005 | 20231225223946.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231225s2023 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1109/TCYB.2021.3125362 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1115.xml |
| 035 | |a (DE-627)NLM334556805 | ||
| 035 | |a (NLM)34919526 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Jiang, Yi |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Optimizing Niche Center for Multimodal Optimization Problems |
| 264 | 1 | |c 2023 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Completed 10.04.2023 | ||
| 500 | |a Date Revised 10.04.2023 | ||
| 500 | |a published: Print-Electronic | ||
| 500 | |a Citation Status PubMed-not-MEDLINE | ||
| 520 | |a Many real-world optimization problems require searching for multiple optimal solutions simultaneously, which are called multimodal optimization problems (MMOPs). For MMOPs, the algorithm is required both to enlarge population diversity for locating more global optima and to enhance refine ability for increasing the accuracy of the obtained solutions. Thus, numerous niching techniques have been proposed to divide the population into different niches, and each niche is responsible for searching on one or more peaks. However, it is often a challenge to distinguish proper individuals as niche centers in existing niching approaches, which has become a key issue for efficiently solving MMOPs. In this article, the niche center distinguish (NCD) problem is treated as an optimization problem and an NCD-based differential evolution (NCD-DE) algorithm is proposed. In NCD-DE, the niches are formed by using an internal genetic algorithm (GA) to online solve the NCD optimization problem. In the internal GA, a fitness-entropy measurement objective function is designed to evaluate whether a group of niche centers (i.e., encoded by a chromosome in the internal GA) is promising. Moreover, to enhance the exploration and exploitation abilities of NCD-DE in solving the MMOPs, a niching and global cooperative mutation strategy that uses both niche and population information is proposed to generate new individuals. The proposed NCD-DE is compared with some state-of-the-art and recent well-performing algorithms. The experimental results show that NCD-DE achieves better or competitive performance on both the accuracy and completeness of the solutions than the compared algorithms | ||
| 650 | 4 | |a Journal Article | |
| 700 | 1 | |a Zhan, Zhi-Hui |e verfasserin |4 aut | |
| 700 | 1 | |a Tan, Kay Chen |e verfasserin |4 aut | |
| 700 | 1 | |a Zhang, Jun |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t IEEE transactions on cybernetics |d 2013 |g 53(2023), 4 vom: 17. Apr., Seite 2544-2557 |w (DE-627)NLM218340567 |x 2168-2275 |7 nnns |
| 773 | 1 | 8 | |g volume:53 |g year:2023 |g number:4 |g day:17 |g month:04 |g pages:2544-2557 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1109/TCYB.2021.3125362 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 53 |j 2023 |e 4 |b 17 |c 04 |h 2544-2557 | ||