Bi-Hierarchical Cooperative Coevolution for Large Scale Global Optimization
Taking “divide-and-conquer” as a basic idea, cooperative coevolution (CC) has shown a promising prospect in large scale global optimization. However, its high requirement on the decomposition accuracy can hardly be satisfied in practice. Directing against this issue, this study...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9016273/ |
_version_ | 1818932163183116288 |
---|---|
author | Zhigang Ren An Chen Muyi Wang Yang Yang Yongsheng Liang Ke Shang |
author_facet | Zhigang Ren An Chen Muyi Wang Yang Yang Yongsheng Liang Ke Shang |
author_sort | Zhigang Ren |
collection | DOAJ |
description | Taking “divide-and-conquer” as a basic idea, cooperative coevolution (CC) has shown a promising prospect in large scale global optimization. However, its high requirement on the decomposition accuracy can hardly be satisfied in practice. Directing against this issue, this study proposes a bi-hierarchical cooperative coevolution (BHCC), which can tolerate a certain degree of decomposition error. Besides the cooperation among sub-problems as in the conventional CC, BHCC introduces a kind of cooperation between sub-problems and the overall problem. By systematically exploiting the excellent sub-solutions obtained during the sub-space optimization process, it initializes the population for the optimization process on the overall problem and thus can conduct search in promising regions of the whole solution space. The newly acquired complete solutions are in turn employed to update the context vector and the population of each sub-problem, where the context vector is used for sub-solution evaluation. Consequently, the search direction misdirected by an improper decomposition can be corrected to a great extent. To keep the balance between the two types of optimization processes, an adaptive triggering mechanism for the overall optimization process is specially designed for BHCC. Experimental results on two widely-used benchmark suites verify the effectiveness of the new strategies in BHCC and also indicate that BHCC is more robust than existing CCs and can achieve competitive performance compared with several state-of-the-art algorithms. |
first_indexed | 2024-12-20T04:28:07Z |
format | Article |
id | doaj.art-61a49c564ade416a974e16a08fa924be |
institution | Directory Open Access Journal |
issn | 2169-3536 |
language | English |
last_indexed | 2024-12-20T04:28:07Z |
publishDate | 2020-01-01 |
publisher | IEEE |
record_format | Article |
series | IEEE Access |
spelling | doaj.art-61a49c564ade416a974e16a08fa924be2022-12-21T19:53:27ZengIEEEIEEE Access2169-35362020-01-018419134192810.1109/ACCESS.2020.29764889016273Bi-Hierarchical Cooperative Coevolution for Large Scale Global OptimizationZhigang Ren0https://orcid.org/0000-0001-6862-3763An Chen1https://orcid.org/0000-0002-1674-4480Muyi Wang2https://orcid.org/0000-0003-1766-827XYang Yang3https://orcid.org/0000-0001-8687-4427Yongsheng Liang4https://orcid.org/0000-0001-8575-495XKe Shang5https://orcid.org/0000-0003-2363-9504School of Automation Science and Engineering, Xi’an Jiaotong University, Xi’an, ChinaSchool of Automation Science and Engineering, Xi’an Jiaotong University, Xi’an, ChinaSchool of Automation Science and Engineering, Xi’an Jiaotong University, Xi’an, ChinaSchool of Automation Science and Engineering, Xi’an Jiaotong University, Xi’an, ChinaSchool of Automation Science and Engineering, Xi’an Jiaotong University, Xi’an, ChinaDepartment of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, ChinaTaking “divide-and-conquer” as a basic idea, cooperative coevolution (CC) has shown a promising prospect in large scale global optimization. However, its high requirement on the decomposition accuracy can hardly be satisfied in practice. Directing against this issue, this study proposes a bi-hierarchical cooperative coevolution (BHCC), which can tolerate a certain degree of decomposition error. Besides the cooperation among sub-problems as in the conventional CC, BHCC introduces a kind of cooperation between sub-problems and the overall problem. By systematically exploiting the excellent sub-solutions obtained during the sub-space optimization process, it initializes the population for the optimization process on the overall problem and thus can conduct search in promising regions of the whole solution space. The newly acquired complete solutions are in turn employed to update the context vector and the population of each sub-problem, where the context vector is used for sub-solution evaluation. Consequently, the search direction misdirected by an improper decomposition can be corrected to a great extent. To keep the balance between the two types of optimization processes, an adaptive triggering mechanism for the overall optimization process is specially designed for BHCC. Experimental results on two widely-used benchmark suites verify the effectiveness of the new strategies in BHCC and also indicate that BHCC is more robust than existing CCs and can achieve competitive performance compared with several state-of-the-art algorithms.https://ieeexplore.ieee.org/document/9016273/Cooperative coevolutionlarge scale global optimizationdivide-and-conquercontext vectordecomposition accuracy |
spellingShingle | Zhigang Ren An Chen Muyi Wang Yang Yang Yongsheng Liang Ke Shang Bi-Hierarchical Cooperative Coevolution for Large Scale Global Optimization IEEE Access Cooperative coevolution large scale global optimization divide-and-conquer context vector decomposition accuracy |
title | Bi-Hierarchical Cooperative Coevolution for Large Scale Global Optimization |
title_full | Bi-Hierarchical Cooperative Coevolution for Large Scale Global Optimization |
title_fullStr | Bi-Hierarchical Cooperative Coevolution for Large Scale Global Optimization |
title_full_unstemmed | Bi-Hierarchical Cooperative Coevolution for Large Scale Global Optimization |
title_short | Bi-Hierarchical Cooperative Coevolution for Large Scale Global Optimization |
title_sort | bi hierarchical cooperative coevolution for large scale global optimization |
topic | Cooperative coevolution large scale global optimization divide-and-conquer context vector decomposition accuracy |
url | https://ieeexplore.ieee.org/document/9016273/ |
work_keys_str_mv | AT zhigangren bihierarchicalcooperativecoevolutionforlargescaleglobaloptimization AT anchen bihierarchicalcooperativecoevolutionforlargescaleglobaloptimization AT muyiwang bihierarchicalcooperativecoevolutionforlargescaleglobaloptimization AT yangyang bihierarchicalcooperativecoevolutionforlargescaleglobaloptimization AT yongshengliang bihierarchicalcooperativecoevolutionforlargescaleglobaloptimization AT keshang bihierarchicalcooperativecoevolutionforlargescaleglobaloptimization |