Cooperative Hierarchical PSO With Two Stage Variable Interaction Reconstruction for Large Scale Optimization
Large scale optimization problems arise in diverse fields. Decomposing the large scale problem into small scale subproblems regarding the variable interactions and optimizing them cooperatively are critical steps in an optimization algorithm. To explore the variable interactions and perform the problem decomposition tasks, we develop a two stage variable interaction reconstruction algorithm. A learning model is proposed to explore part of the variable interactions as prior knowledge. A marginalized denoising model is proposed to construct the overall variable interactions using the prior knowledge, with which the problem is decomposed into small scale modules. To optimize the subproblems and relieve premature convergence, we propose a cooperative hierarchical particle swarm optimization framework, where the operators of contingency leadership, interactional cognition, and self-directed exploitation are designed. Finally, we conduct theoretical analysis for further understanding of the proposed algorithm. The analysis shows that the proposed algorithm can guarantee converging to the global optimal solutions if the problems are correctly decomposed. Experiments are conducted on the CEC2008 and CEC2010 benchmarks. The results demonstrate the effectiveness, convergence, and usefulness of the proposed algorithm.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2017 |
|---|---|
| Erschienen: |
2017 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:47 |
|---|---|
| Enthalten in: |
IEEE transactions on cybernetics - 47(2017), 9 vom: 15. Sept., Seite 2809-2823 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Ge, Hongwei [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
|---|
| Anmerkungen: |
Date Completed 20.02.2018 Date Revised 20.02.2018 published: Print-Electronic Citation Status PubMed-not-MEDLINE |
|---|
| doi: |
10.1109/TCYB.2017.2685944 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM270599614 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM270599614 | ||
| 003 | DE-627 | ||
| 005 | 20231224230917.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231224s2017 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1109/TCYB.2017.2685944 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n0902.xml |
| 035 | |a (DE-627)NLM270599614 | ||
| 035 | |a (NLM)28371795 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Ge, Hongwei |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Cooperative Hierarchical PSO With Two Stage Variable Interaction Reconstruction for Large Scale Optimization |
| 264 | 1 | |c 2017 | |
| 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 20.02.2018 | ||
| 500 | |a Date Revised 20.02.2018 | ||
| 500 | |a published: Print-Electronic | ||
| 500 | |a Citation Status PubMed-not-MEDLINE | ||
| 520 | |a Large scale optimization problems arise in diverse fields. Decomposing the large scale problem into small scale subproblems regarding the variable interactions and optimizing them cooperatively are critical steps in an optimization algorithm. To explore the variable interactions and perform the problem decomposition tasks, we develop a two stage variable interaction reconstruction algorithm. A learning model is proposed to explore part of the variable interactions as prior knowledge. A marginalized denoising model is proposed to construct the overall variable interactions using the prior knowledge, with which the problem is decomposed into small scale modules. To optimize the subproblems and relieve premature convergence, we propose a cooperative hierarchical particle swarm optimization framework, where the operators of contingency leadership, interactional cognition, and self-directed exploitation are designed. Finally, we conduct theoretical analysis for further understanding of the proposed algorithm. The analysis shows that the proposed algorithm can guarantee converging to the global optimal solutions if the problems are correctly decomposed. Experiments are conducted on the CEC2008 and CEC2010 benchmarks. The results demonstrate the effectiveness, convergence, and usefulness of the proposed algorithm | ||
| 650 | 4 | |a Journal Article | |
| 700 | 1 | |a Sun, Liang |e verfasserin |4 aut | |
| 700 | 1 | |a Tan, Guozhen |e verfasserin |4 aut | |
| 700 | 1 | |a Chen, Zheng |e verfasserin |4 aut | |
| 700 | 1 | |a Chen, C L Philip |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t IEEE transactions on cybernetics |d 2013 |g 47(2017), 9 vom: 15. Sept., Seite 2809-2823 |w (DE-627)NLM218340567 |x 2168-2275 |7 nnns |
| 773 | 1 | 8 | |g volume:47 |g year:2017 |g number:9 |g day:15 |g month:09 |g pages:2809-2823 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1109/TCYB.2017.2685944 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 47 |j 2017 |e 9 |b 15 |c 09 |h 2809-2823 | ||