Cooperative coevolution for large-scale global optimization based on fuzzy decomposition
Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Groupin...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Li, Lin [verfasserIn] Fang, Wei [verfasserIn] Mei, Yi [verfasserIn] Wang, Quan [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2020 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Soft Computing - Springer-Verlag, 2003, 25(2020), 5 vom: 01. Nov., Seite 3593-3608 |
|---|---|
| Übergeordnetes Werk: |
volume:25 ; year:2020 ; number:5 ; day:01 ; month:11 ; pages:3593-3608 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00500-020-05389-3 |
|---|
| Katalog-ID: |
SPR043336213 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR043336213 | ||
| 003 | DE-627 | ||
| 005 | 20210227064739.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 210227s2020 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00500-020-05389-3 |2 doi | |
| 035 | |a (DE-627)SPR043336213 | ||
| 035 | |a (DE-599)SPRs00500-020-05389-3-e | ||
| 035 | |a (SPR)s00500-020-05389-3-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Li, Lin |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Cooperative coevolution for large-scale global optimization based on fuzzy decomposition |
| 264 | 1 | |c 2020 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. | ||
| 650 | 4 | |a Large-scale global optimization |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Spectral clustering |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Differential grouping |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Cooperative co-evolution |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Fang, Wei |e verfasserin |4 aut | |
| 700 | 1 | |a Mei, Yi |e verfasserin |4 aut | |
| 700 | 1 | |a Wang, Quan |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Soft Computing |d Springer-Verlag, 2003 |g 25(2020), 5 vom: 01. Nov., Seite 3593-3608 |w (DE-627)SPR006469531 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2020 |g number:5 |g day:01 |g month:11 |g pages:3593-3608 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s00500-020-05389-3 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 951 | |a AR | ||
| 952 | |d 25 |j 2020 |e 5 |b 01 |c 11 |h 3593-3608 | ||
| author_variant |
l l ll w f wf y m ym q w qw |
|---|---|
| matchkey_str |
lilinfangweimeiyiwangquan:2020----:oprtvceouinolreclgoaotmztobs |
| hierarchy_sort_str |
2020 |
| publishDate |
2020 |
| allfields |
10.1007/s00500-020-05389-3 doi (DE-627)SPR043336213 (DE-599)SPRs00500-020-05389-3-e (SPR)s00500-020-05389-3-e DE-627 ger DE-627 rakwb eng Li, Lin verfasserin aut Cooperative coevolution for large-scale global optimization based on fuzzy decomposition 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. Large-scale global optimization (dpeaa)DE-He213 Spectral clustering (dpeaa)DE-He213 Differential grouping (dpeaa)DE-He213 Cooperative co-evolution (dpeaa)DE-He213 Fang, Wei verfasserin aut Mei, Yi verfasserin aut Wang, Quan verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 25(2020), 5 vom: 01. Nov., Seite 3593-3608 (DE-627)SPR006469531 nnns volume:25 year:2020 number:5 day:01 month:11 pages:3593-3608 https://dx.doi.org/10.1007/s00500-020-05389-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 25 2020 5 01 11 3593-3608 |
| spelling |
10.1007/s00500-020-05389-3 doi (DE-627)SPR043336213 (DE-599)SPRs00500-020-05389-3-e (SPR)s00500-020-05389-3-e DE-627 ger DE-627 rakwb eng Li, Lin verfasserin aut Cooperative coevolution for large-scale global optimization based on fuzzy decomposition 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. Large-scale global optimization (dpeaa)DE-He213 Spectral clustering (dpeaa)DE-He213 Differential grouping (dpeaa)DE-He213 Cooperative co-evolution (dpeaa)DE-He213 Fang, Wei verfasserin aut Mei, Yi verfasserin aut Wang, Quan verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 25(2020), 5 vom: 01. Nov., Seite 3593-3608 (DE-627)SPR006469531 nnns volume:25 year:2020 number:5 day:01 month:11 pages:3593-3608 https://dx.doi.org/10.1007/s00500-020-05389-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 25 2020 5 01 11 3593-3608 |
| allfields_unstemmed |
10.1007/s00500-020-05389-3 doi (DE-627)SPR043336213 (DE-599)SPRs00500-020-05389-3-e (SPR)s00500-020-05389-3-e DE-627 ger DE-627 rakwb eng Li, Lin verfasserin aut Cooperative coevolution for large-scale global optimization based on fuzzy decomposition 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. Large-scale global optimization (dpeaa)DE-He213 Spectral clustering (dpeaa)DE-He213 Differential grouping (dpeaa)DE-He213 Cooperative co-evolution (dpeaa)DE-He213 Fang, Wei verfasserin aut Mei, Yi verfasserin aut Wang, Quan verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 25(2020), 5 vom: 01. Nov., Seite 3593-3608 (DE-627)SPR006469531 nnns volume:25 year:2020 number:5 day:01 month:11 pages:3593-3608 https://dx.doi.org/10.1007/s00500-020-05389-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 25 2020 5 01 11 3593-3608 |
| allfieldsGer |
10.1007/s00500-020-05389-3 doi (DE-627)SPR043336213 (DE-599)SPRs00500-020-05389-3-e (SPR)s00500-020-05389-3-e DE-627 ger DE-627 rakwb eng Li, Lin verfasserin aut Cooperative coevolution for large-scale global optimization based on fuzzy decomposition 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. Large-scale global optimization (dpeaa)DE-He213 Spectral clustering (dpeaa)DE-He213 Differential grouping (dpeaa)DE-He213 Cooperative co-evolution (dpeaa)DE-He213 Fang, Wei verfasserin aut Mei, Yi verfasserin aut Wang, Quan verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 25(2020), 5 vom: 01. Nov., Seite 3593-3608 (DE-627)SPR006469531 nnns volume:25 year:2020 number:5 day:01 month:11 pages:3593-3608 https://dx.doi.org/10.1007/s00500-020-05389-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 25 2020 5 01 11 3593-3608 |
| allfieldsSound |
10.1007/s00500-020-05389-3 doi (DE-627)SPR043336213 (DE-599)SPRs00500-020-05389-3-e (SPR)s00500-020-05389-3-e DE-627 ger DE-627 rakwb eng Li, Lin verfasserin aut Cooperative coevolution for large-scale global optimization based on fuzzy decomposition 2020 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. Large-scale global optimization (dpeaa)DE-He213 Spectral clustering (dpeaa)DE-He213 Differential grouping (dpeaa)DE-He213 Cooperative co-evolution (dpeaa)DE-He213 Fang, Wei verfasserin aut Mei, Yi verfasserin aut Wang, Quan verfasserin aut Enthalten in Soft Computing Springer-Verlag, 2003 25(2020), 5 vom: 01. Nov., Seite 3593-3608 (DE-627)SPR006469531 nnns volume:25 year:2020 number:5 day:01 month:11 pages:3593-3608 https://dx.doi.org/10.1007/s00500-020-05389-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 25 2020 5 01 11 3593-3608 |
| language |
English |
| source |
Enthalten in Soft Computing 25(2020), 5 vom: 01. Nov., Seite 3593-3608 volume:25 year:2020 number:5 day:01 month:11 pages:3593-3608 |
| sourceStr |
Enthalten in Soft Computing 25(2020), 5 vom: 01. Nov., Seite 3593-3608 volume:25 year:2020 number:5 day:01 month:11 pages:3593-3608 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Large-scale global optimization Spectral clustering Differential grouping Cooperative co-evolution |
| isfreeaccess_bool |
false |
| container_title |
Soft Computing |
| authorswithroles_txt_mv |
Li, Lin @@aut@@ Fang, Wei @@aut@@ Mei, Yi @@aut@@ Wang, Quan @@aut@@ |
| publishDateDaySort_date |
2020-11-01T00:00:00Z |
| hierarchy_top_id |
SPR006469531 |
| id |
SPR043336213 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">SPR043336213</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210227064739.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210227s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-020-05389-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR043336213</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)SPRs00500-020-05389-3-e</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s00500-020-05389-3-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Lin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Cooperative coevolution for large-scale global optimization based on fuzzy decomposition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Large-scale global optimization</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Spectral clustering</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Differential grouping</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cooperative co-evolution</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fang, Wei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mei, Yi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Quan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft Computing</subfield><subfield code="d">Springer-Verlag, 2003</subfield><subfield code="g">25(2020), 5 vom: 01. Nov., Seite 3593-3608</subfield><subfield code="w">(DE-627)SPR006469531</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:5</subfield><subfield code="g">day:01</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:3593-3608</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s00500-020-05389-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2020</subfield><subfield code="e">5</subfield><subfield code="b">01</subfield><subfield code="c">11</subfield><subfield code="h">3593-3608</subfield></datafield></record></collection>
|
| author |
Li, Lin |
| spellingShingle |
Li, Lin misc Large-scale global optimization misc Spectral clustering misc Differential grouping misc Cooperative co-evolution Cooperative coevolution for large-scale global optimization based on fuzzy decomposition |
| authorStr |
Li, Lin |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR006469531 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
Cooperative coevolution for large-scale global optimization based on fuzzy decomposition Large-scale global optimization (dpeaa)DE-He213 Spectral clustering (dpeaa)DE-He213 Differential grouping (dpeaa)DE-He213 Cooperative co-evolution (dpeaa)DE-He213 |
| topic |
misc Large-scale global optimization misc Spectral clustering misc Differential grouping misc Cooperative co-evolution |
| topic_unstemmed |
misc Large-scale global optimization misc Spectral clustering misc Differential grouping misc Cooperative co-evolution |
| topic_browse |
misc Large-scale global optimization misc Spectral clustering misc Differential grouping misc Cooperative co-evolution |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Soft Computing |
| hierarchy_parent_id |
SPR006469531 |
| hierarchy_top_title |
Soft Computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR006469531 |
| title |
Cooperative coevolution for large-scale global optimization based on fuzzy decomposition |
| ctrlnum |
(DE-627)SPR043336213 (DE-599)SPRs00500-020-05389-3-e (SPR)s00500-020-05389-3-e |
| title_full |
Cooperative coevolution for large-scale global optimization based on fuzzy decomposition |
| author_sort |
Li, Lin |
| journal |
Soft Computing |
| journalStr |
Soft Computing |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2020 |
| contenttype_str_mv |
txt |
| container_start_page |
3593 |
| author_browse |
Li, Lin Fang, Wei Mei, Yi Wang, Quan |
| container_volume |
25 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Li, Lin |
| doi_str_mv |
10.1007/s00500-020-05389-3 |
| author2-role |
verfasserin |
| title_sort |
cooperative coevolution for large-scale global optimization based on fuzzy decomposition |
| title_auth |
Cooperative coevolution for large-scale global optimization based on fuzzy decomposition |
| abstract |
Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. |
| abstractGer |
Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. |
| abstract_unstemmed |
Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER |
| container_issue |
5 |
| title_short |
Cooperative coevolution for large-scale global optimization based on fuzzy decomposition |
| url |
https://dx.doi.org/10.1007/s00500-020-05389-3 |
| remote_bool |
true |
| author2 |
Fang, Wei Mei, Yi Wang, Quan |
| author2Str |
Fang, Wei Mei, Yi Wang, Quan |
| ppnlink |
SPR006469531 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00500-020-05389-3 |
| up_date |
2024-07-03T18:01:08.082Z |
| _version_ |
1803581829239799808 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">SPR043336213</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20210227064739.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">210227s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-020-05389-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR043336213</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)SPRs00500-020-05389-3-e</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s00500-020-05389-3-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Lin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Cooperative coevolution for large-scale global optimization based on fuzzy decomposition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Cooperative coevolution (CC) is an effective evolutionary divide-and-conquer strategy that solves large-scale global optimization (LSGO) by decomposing the problem into a set of lower-dimensional subproblems. The main challenge of CC is to find an optimal decomposition. Differential Grouping (DG) is a competitive decomposition method to identify the variable interaction with several improved versions like GDG and DG2. Although DG-based decomposition methods have shown superior performance compared to the other decomposition methods, they still have difficulty to deal with the overlapping problems since their optimal decomposition is unknown. To address this issue, instead of pursuing the high accuracy of decomposition, we propose a novel fuzzy decomposition algorithm that groups the variables according to their interaction degree. In the proposed fuzzy decomposition algorithm, the interaction structure matrix and the interactive degree for a LSGO problem are calculated at first according to the interaction among all the decision variables. Then the number of subgroups is determined based on the interactive degree. Based on the interaction structure matrix, a spectral clustering algorithm is proposed to decompose the decision variables with regard to the number of subgroups in order to achieve a better balance between high grouping accuracy and suitable group size. The proposed decomposition algorithm with DECC has been proven to outperform several state-of-the-art algorithms on the latest LSGO benchmark functions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Large-scale global optimization</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Spectral clustering</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Differential grouping</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cooperative co-evolution</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fang, Wei</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mei, Yi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Quan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft Computing</subfield><subfield code="d">Springer-Verlag, 2003</subfield><subfield code="g">25(2020), 5 vom: 01. Nov., Seite 3593-3608</subfield><subfield code="w">(DE-627)SPR006469531</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:25</subfield><subfield code="g">year:2020</subfield><subfield code="g">number:5</subfield><subfield code="g">day:01</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:3593-3608</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s00500-020-05389-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">25</subfield><subfield code="j">2020</subfield><subfield code="e">5</subfield><subfield code="b">01</subfield><subfield code="c">11</subfield><subfield code="h">3593-3608</subfield></datafield></record></collection>
|
| score |
7.400588 |