A Dual-System Variable-Grain Cooperative Coevolutionary Algorithm: Satellite-Module Layout Design
The layout design of complex engineering systems (such as satellite-module layout design) is very difficult to solve in polynomial time. This is not only a complex coupled system design problem but also a special combinatorial problem. The fitness function for this problem is characterized as multim...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on evolutionary computation 2010-06, Vol.14 (3), p.438-455 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 455 |
---|---|
container_issue | 3 |
container_start_page | 438 |
container_title | IEEE transactions on evolutionary computation |
container_volume | 14 |
creator | TENG, Hong-Fei YU CHEN WEI ZENG SHI, Yan-Jun HU, Qing-Hua |
description | The layout design of complex engineering systems (such as satellite-module layout design) is very difficult to solve in polynomial time. This is not only a complex coupled system design problem but also a special combinatorial problem. The fitness function for this problem is characterized as multimodal because of interference constraints among layout components (objects), etc. This characteristic can easily result in premature convergence when solving this problem using evolutionary algorithms. To deal with the above two problems simultaneously, we propose a dual-system framework based on the cooperative coevolutionary algorithm (CCEA, e.g., cooperative coevolutionary genetic algorithm) like multidisciplinary design optimization. The proposed algorithm has the characteristic of solving the complex coupled system problem, increasing the diversity of population, and decreasing the premature convergence. The basis for the proposed algorithm is as follows. The original coupled system P is decomposed into several subsystems according to its physical structure. The system P is duplicated as systems A and B, respectively. The A system is solved on a global level (all-in-one), whereas the solving of B system is realized through the computation of its subsystems in parallel. The individual migration between A and B is implemented through the individual migration between their corresponding subsystems. To reduce the computational complexity produced additionally by the dual-systems A and B, we employ a variable-grain model of design variables. During the process of optimization, the two systems A and B gradually approximate to the original system P, respectively. The above-proposed algorithm is called the dual-system variable-grain cooperative coevolution algorithm (DVGCCEA) or Oboe-CCEA. The numerical experimental results of a simplified satellite-module layout design case show that the proposed algorithm can obtain better robustness and trade-off between computational precision and computational efficiency. |
doi_str_mv | 10.1109/TEVC.2009.2033585 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1027207601</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5352232</ieee_id><sourcerecordid>753639544</sourcerecordid><originalsourceid>FETCH-LOGICAL-c403t-45a2d0b16f21570d1d52a542ebd3ed85fc0d83ed962e68a0aeb8fcdb2db5d6393</originalsourceid><addsrcrecordid>eNpdkEFr3DAQhU1pIGmaHxB6MZSSk9ORZNlyb8smTQsbctjNkpsZW-OtgtbaSnJg_3217JJDLzMP5pvhzcuyawa3jEHzfXW_nt9ygCYVIaSSH7IL1pSsAODVx6RBNUVdq5fz7FMIrwCslKy5yHCW301oi-U-RNrma_QGO0vFg0cz5nPnduQxmjdKmt6cnaJxI_p9PrMb5038s_2RLzGStSZS8ej0ZClf4N5NMb-jYDbj5-xsQBvo6tQvs-ef96v5r2Lx9PB7PlsUfQkiFqVErqFj1cCZrEEzLTnKklOnBWklhx60SqqpOFUKAalTQ687rjupK9GIy-zmeHfn3d-JQmy3JvTJGI7kptDWUiRMlmUiv_5HvrrJj8lcy4DXHOoKWKLYkeq9C8HT0O682abXE9QeMm8PmbeHzNtT5mnn2-kyhh7t4HHsTXhf5FypCqBK3JcjZ4jofSyF5Fxw8Q8wJ4rj</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1027207601</pqid></control><display><type>article</type><title>A Dual-System Variable-Grain Cooperative Coevolutionary Algorithm: Satellite-Module Layout Design</title><source>IEEE Electronic Library (IEL)</source><creator>TENG, Hong-Fei ; YU CHEN ; WEI ZENG ; SHI, Yan-Jun ; HU, Qing-Hua</creator><creatorcontrib>TENG, Hong-Fei ; YU CHEN ; WEI ZENG ; SHI, Yan-Jun ; HU, Qing-Hua</creatorcontrib><description>The layout design of complex engineering systems (such as satellite-module layout design) is very difficult to solve in polynomial time. This is not only a complex coupled system design problem but also a special combinatorial problem. The fitness function for this problem is characterized as multimodal because of interference constraints among layout components (objects), etc. This characteristic can easily result in premature convergence when solving this problem using evolutionary algorithms. To deal with the above two problems simultaneously, we propose a dual-system framework based on the cooperative coevolutionary algorithm (CCEA, e.g., cooperative coevolutionary genetic algorithm) like multidisciplinary design optimization. The proposed algorithm has the characteristic of solving the complex coupled system problem, increasing the diversity of population, and decreasing the premature convergence. The basis for the proposed algorithm is as follows. The original coupled system P is decomposed into several subsystems according to its physical structure. The system P is duplicated as systems A and B, respectively. The A system is solved on a global level (all-in-one), whereas the solving of B system is realized through the computation of its subsystems in parallel. The individual migration between A and B is implemented through the individual migration between their corresponding subsystems. To reduce the computational complexity produced additionally by the dual-systems A and B, we employ a variable-grain model of design variables. During the process of optimization, the two systems A and B gradually approximate to the original system P, respectively. The above-proposed algorithm is called the dual-system variable-grain cooperative coevolution algorithm (DVGCCEA) or Oboe-CCEA. The numerical experimental results of a simplified satellite-module layout design case show that the proposed algorithm can obtain better robustness and trade-off between computational precision and computational efficiency.</description><identifier>ISSN: 1089-778X</identifier><identifier>EISSN: 1941-0026</identifier><identifier>DOI: 10.1109/TEVC.2009.2033585</identifier><identifier>CODEN: ITEVF5</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Artificial intelligence ; Combinatorial analysis ; Computation ; Computer science; control theory; systems ; Concurrent computing ; Convergence ; Design engineering ; Design optimization ; Dual-system coevolutionary ; Evolutionary algorithms ; Evolutionary computation ; Exact sciences and technology ; Genetic algorithms ; Heuristic ; Interference constraints ; Learning and adaptive systems ; Mathematical analysis ; Mathematical models ; Mechanical engineering. Machine design ; Polynomials ; premature convergence ; satellite-module layout ; Satellites ; Studies ; system layout design ; Systems engineering and theory ; Theoretical computing ; variable-grain</subject><ispartof>IEEE transactions on evolutionary computation, 2010-06, Vol.14 (3), p.438-455</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c403t-45a2d0b16f21570d1d52a542ebd3ed85fc0d83ed962e68a0aeb8fcdb2db5d6393</citedby><cites>FETCH-LOGICAL-c403t-45a2d0b16f21570d1d52a542ebd3ed85fc0d83ed962e68a0aeb8fcdb2db5d6393</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5352232$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54737</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5352232$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22886006$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>TENG, Hong-Fei</creatorcontrib><creatorcontrib>YU CHEN</creatorcontrib><creatorcontrib>WEI ZENG</creatorcontrib><creatorcontrib>SHI, Yan-Jun</creatorcontrib><creatorcontrib>HU, Qing-Hua</creatorcontrib><title>A Dual-System Variable-Grain Cooperative Coevolutionary Algorithm: Satellite-Module Layout Design</title><title>IEEE transactions on evolutionary computation</title><addtitle>TEVC</addtitle><description>The layout design of complex engineering systems (such as satellite-module layout design) is very difficult to solve in polynomial time. This is not only a complex coupled system design problem but also a special combinatorial problem. The fitness function for this problem is characterized as multimodal because of interference constraints among layout components (objects), etc. This characteristic can easily result in premature convergence when solving this problem using evolutionary algorithms. To deal with the above two problems simultaneously, we propose a dual-system framework based on the cooperative coevolutionary algorithm (CCEA, e.g., cooperative coevolutionary genetic algorithm) like multidisciplinary design optimization. The proposed algorithm has the characteristic of solving the complex coupled system problem, increasing the diversity of population, and decreasing the premature convergence. The basis for the proposed algorithm is as follows. The original coupled system P is decomposed into several subsystems according to its physical structure. The system P is duplicated as systems A and B, respectively. The A system is solved on a global level (all-in-one), whereas the solving of B system is realized through the computation of its subsystems in parallel. The individual migration between A and B is implemented through the individual migration between their corresponding subsystems. To reduce the computational complexity produced additionally by the dual-systems A and B, we employ a variable-grain model of design variables. During the process of optimization, the two systems A and B gradually approximate to the original system P, respectively. The above-proposed algorithm is called the dual-system variable-grain cooperative coevolution algorithm (DVGCCEA) or Oboe-CCEA. The numerical experimental results of a simplified satellite-module layout design case show that the proposed algorithm can obtain better robustness and trade-off between computational precision and computational efficiency.</description><subject>Algorithm design and analysis</subject><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Combinatorial analysis</subject><subject>Computation</subject><subject>Computer science; control theory; systems</subject><subject>Concurrent computing</subject><subject>Convergence</subject><subject>Design engineering</subject><subject>Design optimization</subject><subject>Dual-system coevolutionary</subject><subject>Evolutionary algorithms</subject><subject>Evolutionary computation</subject><subject>Exact sciences and technology</subject><subject>Genetic algorithms</subject><subject>Heuristic</subject><subject>Interference constraints</subject><subject>Learning and adaptive systems</subject><subject>Mathematical analysis</subject><subject>Mathematical models</subject><subject>Mechanical engineering. Machine design</subject><subject>Polynomials</subject><subject>premature convergence</subject><subject>satellite-module layout</subject><subject>Satellites</subject><subject>Studies</subject><subject>system layout design</subject><subject>Systems engineering and theory</subject><subject>Theoretical computing</subject><subject>variable-grain</subject><issn>1089-778X</issn><issn>1941-0026</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkEFr3DAQhU1pIGmaHxB6MZSSk9ORZNlyb8smTQsbctjNkpsZW-OtgtbaSnJg_3217JJDLzMP5pvhzcuyawa3jEHzfXW_nt9ygCYVIaSSH7IL1pSsAODVx6RBNUVdq5fz7FMIrwCslKy5yHCW301oi-U-RNrma_QGO0vFg0cz5nPnduQxmjdKmt6cnaJxI_p9PrMb5038s_2RLzGStSZS8ej0ZClf4N5NMb-jYDbj5-xsQBvo6tQvs-ef96v5r2Lx9PB7PlsUfQkiFqVErqFj1cCZrEEzLTnKklOnBWklhx60SqqpOFUKAalTQ687rjupK9GIy-zmeHfn3d-JQmy3JvTJGI7kptDWUiRMlmUiv_5HvrrJj8lcy4DXHOoKWKLYkeq9C8HT0O682abXE9QeMm8PmbeHzNtT5mnn2-kyhh7t4HHsTXhf5FypCqBK3JcjZ4jofSyF5Fxw8Q8wJ4rj</recordid><startdate>20100601</startdate><enddate>20100601</enddate><creator>TENG, Hong-Fei</creator><creator>YU CHEN</creator><creator>WEI ZENG</creator><creator>SHI, Yan-Jun</creator><creator>HU, Qing-Hua</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope><scope>H8D</scope></search><sort><creationdate>20100601</creationdate><title>A Dual-System Variable-Grain Cooperative Coevolutionary Algorithm: Satellite-Module Layout Design</title><author>TENG, Hong-Fei ; YU CHEN ; WEI ZENG ; SHI, Yan-Jun ; HU, Qing-Hua</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c403t-45a2d0b16f21570d1d52a542ebd3ed85fc0d83ed962e68a0aeb8fcdb2db5d6393</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Combinatorial analysis</topic><topic>Computation</topic><topic>Computer science; control theory; systems</topic><topic>Concurrent computing</topic><topic>Convergence</topic><topic>Design engineering</topic><topic>Design optimization</topic><topic>Dual-system coevolutionary</topic><topic>Evolutionary algorithms</topic><topic>Evolutionary computation</topic><topic>Exact sciences and technology</topic><topic>Genetic algorithms</topic><topic>Heuristic</topic><topic>Interference constraints</topic><topic>Learning and adaptive systems</topic><topic>Mathematical analysis</topic><topic>Mathematical models</topic><topic>Mechanical engineering. Machine design</topic><topic>Polynomials</topic><topic>premature convergence</topic><topic>satellite-module layout</topic><topic>Satellites</topic><topic>Studies</topic><topic>system layout design</topic><topic>Systems engineering and theory</topic><topic>Theoretical computing</topic><topic>variable-grain</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>TENG, Hong-Fei</creatorcontrib><creatorcontrib>YU CHEN</creatorcontrib><creatorcontrib>WEI ZENG</creatorcontrib><creatorcontrib>SHI, Yan-Jun</creatorcontrib><creatorcontrib>HU, Qing-Hua</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><jtitle>IEEE transactions on evolutionary computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>TENG, Hong-Fei</au><au>YU CHEN</au><au>WEI ZENG</au><au>SHI, Yan-Jun</au><au>HU, Qing-Hua</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Dual-System Variable-Grain Cooperative Coevolutionary Algorithm: Satellite-Module Layout Design</atitle><jtitle>IEEE transactions on evolutionary computation</jtitle><stitle>TEVC</stitle><date>2010-06-01</date><risdate>2010</risdate><volume>14</volume><issue>3</issue><spage>438</spage><epage>455</epage><pages>438-455</pages><issn>1089-778X</issn><eissn>1941-0026</eissn><coden>ITEVF5</coden><abstract>The layout design of complex engineering systems (such as satellite-module layout design) is very difficult to solve in polynomial time. This is not only a complex coupled system design problem but also a special combinatorial problem. The fitness function for this problem is characterized as multimodal because of interference constraints among layout components (objects), etc. This characteristic can easily result in premature convergence when solving this problem using evolutionary algorithms. To deal with the above two problems simultaneously, we propose a dual-system framework based on the cooperative coevolutionary algorithm (CCEA, e.g., cooperative coevolutionary genetic algorithm) like multidisciplinary design optimization. The proposed algorithm has the characteristic of solving the complex coupled system problem, increasing the diversity of population, and decreasing the premature convergence. The basis for the proposed algorithm is as follows. The original coupled system P is decomposed into several subsystems according to its physical structure. The system P is duplicated as systems A and B, respectively. The A system is solved on a global level (all-in-one), whereas the solving of B system is realized through the computation of its subsystems in parallel. The individual migration between A and B is implemented through the individual migration between their corresponding subsystems. To reduce the computational complexity produced additionally by the dual-systems A and B, we employ a variable-grain model of design variables. During the process of optimization, the two systems A and B gradually approximate to the original system P, respectively. The above-proposed algorithm is called the dual-system variable-grain cooperative coevolution algorithm (DVGCCEA) or Oboe-CCEA. The numerical experimental results of a simplified satellite-module layout design case show that the proposed algorithm can obtain better robustness and trade-off between computational precision and computational efficiency.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TEVC.2009.2033585</doi><tpages>18</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1089-778X |
ispartof | IEEE transactions on evolutionary computation, 2010-06, Vol.14 (3), p.438-455 |
issn | 1089-778X 1941-0026 |
language | eng |
recordid | cdi_proquest_journals_1027207601 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithm design and analysis Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Artificial intelligence Combinatorial analysis Computation Computer science control theory systems Concurrent computing Convergence Design engineering Design optimization Dual-system coevolutionary Evolutionary algorithms Evolutionary computation Exact sciences and technology Genetic algorithms Heuristic Interference constraints Learning and adaptive systems Mathematical analysis Mathematical models Mechanical engineering. Machine design Polynomials premature convergence satellite-module layout Satellites Studies system layout design Systems engineering and theory Theoretical computing variable-grain |
title | A Dual-System Variable-Grain Cooperative Coevolutionary Algorithm: Satellite-Module Layout Design |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T15%3A34%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Dual-System%20Variable-Grain%20Cooperative%20Coevolutionary%20Algorithm:%20Satellite-Module%20Layout%20Design&rft.jtitle=IEEE%20transactions%20on%20evolutionary%20computation&rft.au=TENG,%20Hong-Fei&rft.date=2010-06-01&rft.volume=14&rft.issue=3&rft.spage=438&rft.epage=455&rft.pages=438-455&rft.issn=1089-778X&rft.eissn=1941-0026&rft.coden=ITEVF5&rft_id=info:doi/10.1109/TEVC.2009.2033585&rft_dat=%3Cproquest_RIE%3E753639544%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1027207601&rft_id=info:pmid/&rft_ieee_id=5352232&rfr_iscdi=true |