Adaptive multi-swarm in dynamic environments
•The number of swarms is determined adaptively.•A better tradeoff between exploration and exploitation is achieved.•Previous experiences of a swarm are utilized sufficiently. Multi-population is a promising approach to optimization in dynamic environments. To appropriately distribute multiple popula...
Gespeichert in:
Veröffentlicht in: | Swarm and evolutionary computation 2021-06, Vol.63, p.100870, Article 100870 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | 100870 |
container_title | Swarm and evolutionary computation |
container_volume | 63 |
creator | Qin, Jin Huang, Chuhua Luo, Yuan |
description | •The number of swarms is determined adaptively.•A better tradeoff between exploration and exploitation is achieved.•Previous experiences of a swarm are utilized sufficiently.
Multi-population is a promising approach to optimization in dynamic environments. To appropriately distribute multiple populations to distinct areas of the search space and refine the best solution found by each population, an adaptive multi-swarm framework for dynamic optimization problems is proposed, in which several adaptations of multi-population approaches are developed for a better exploration/exploitation tradeoff. As the first intention, a basic adaptation is the combination of a group of active swarms and a group of inactive swarms. The group of active swarms are devoted to exploring new areas of the search space, and the group of inactive swarms are devoted to preserving useful experiences. One kind of swarm can be transformed into another. An active swarm becomes inactive after it converges. An inactive swarm will become active and search for new optima again when an environmental change occurs. For the second intention, another basic adaptation is the application of a local search to the best individual of a stagnated swarm. The experimental results on various moving peaks benchmarks show that the proposed framework is competitive with other state-of-the-art methods and more effective for dynamic environments under many peaks, severe changes, and high dimensionalities. |
doi_str_mv | 10.1016/j.swevo.2021.100870 |
format | Article |
fullrecord | <record><control><sourceid>elsevier_webof</sourceid><recordid>TN_cdi_webofscience_primary_000651587800002</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S2210650221000316</els_id><sourcerecordid>S2210650221000316</sourcerecordid><originalsourceid>FETCH-LOGICAL-c303t-bfb8820e3de6c7ff5ce1ea0f4d51b20747b41b5b0e3f1d314e17bcd6396a97f73</originalsourceid><addsrcrecordid>eNqNkD1rwzAQhkVpoSHNL-jivXUqyZblDB2C6RcEurSz0McJFGI5SIpD_n3tOmQs1XLieJ_jnkPonuAlwaR62i7jEfpuSTElQwfXHF-hGaUE5xUj-Pryx_QWLWLc4uFVmDK2mqHHtZH75HrI2sMuuTweZWgz5zNz8rJ1OgPfu9D5FnyKd-jGyl2ExbnO0ffry1fznm8-3z6a9SbXBS5Srqyqa4qhMFBpbi3TQEBiWxpGFMW85KokiqkhYYkpSAmEK22qYlXJFbe8mKNimqtDF2MAK_bBtTKcBMFidBZb8essRmcxOQ_Uw0QdQXU2agdew4UcnRlhNa9HfTqk6_-nG5dkcp1vuoNPA_o8oTDcoHcQxBk3LoBOwnTuz0V_AG6igYE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Adaptive multi-swarm in dynamic environments</title><source>Web of Science - Science Citation Index Expanded - 2021<img src="https://exlibris-pub.s3.amazonaws.com/fromwos-v2.jpg" /></source><source>Access via ScienceDirect (Elsevier)</source><creator>Qin, Jin ; Huang, Chuhua ; Luo, Yuan</creator><creatorcontrib>Qin, Jin ; Huang, Chuhua ; Luo, Yuan</creatorcontrib><description>•The number of swarms is determined adaptively.•A better tradeoff between exploration and exploitation is achieved.•Previous experiences of a swarm are utilized sufficiently.
Multi-population is a promising approach to optimization in dynamic environments. To appropriately distribute multiple populations to distinct areas of the search space and refine the best solution found by each population, an adaptive multi-swarm framework for dynamic optimization problems is proposed, in which several adaptations of multi-population approaches are developed for a better exploration/exploitation tradeoff. As the first intention, a basic adaptation is the combination of a group of active swarms and a group of inactive swarms. The group of active swarms are devoted to exploring new areas of the search space, and the group of inactive swarms are devoted to preserving useful experiences. One kind of swarm can be transformed into another. An active swarm becomes inactive after it converges. An inactive swarm will become active and search for new optima again when an environmental change occurs. For the second intention, another basic adaptation is the application of a local search to the best individual of a stagnated swarm. The experimental results on various moving peaks benchmarks show that the proposed framework is competitive with other state-of-the-art methods and more effective for dynamic environments under many peaks, severe changes, and high dimensionalities.</description><identifier>ISSN: 2210-6502</identifier><identifier>EISSN: 2210-6510</identifier><identifier>DOI: 10.1016/j.swevo.2021.100870</identifier><language>eng</language><publisher>AMSTERDAM: Elsevier B.V</publisher><subject>Adaptive swarms ; Computer Science ; Computer Science, Artificial Intelligence ; Computer Science, Theory & Methods ; Dynamic environment ; Exploration/exploitation tradeoff ; Multi-swarm approach ; Science & Technology ; Technology</subject><ispartof>Swarm and evolutionary computation, 2021-06, Vol.63, p.100870, Article 100870</ispartof><rights>2021 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>true</woscitedreferencessubscribed><woscitedreferencescount>3</woscitedreferencescount><woscitedreferencesoriginalsourcerecordid>wos000651587800002</woscitedreferencesoriginalsourcerecordid><citedby>FETCH-LOGICAL-c303t-bfb8820e3de6c7ff5ce1ea0f4d51b20747b41b5b0e3f1d314e17bcd6396a97f73</citedby><cites>FETCH-LOGICAL-c303t-bfb8820e3de6c7ff5ce1ea0f4d51b20747b41b5b0e3f1d314e17bcd6396a97f73</cites><orcidid>0000-0003-4163-6067 ; 0000-0001-9843-2538</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.swevo.2021.100870$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>315,781,785,3551,27929,27930,39263,46000</link.rule.ids></links><search><creatorcontrib>Qin, Jin</creatorcontrib><creatorcontrib>Huang, Chuhua</creatorcontrib><creatorcontrib>Luo, Yuan</creatorcontrib><title>Adaptive multi-swarm in dynamic environments</title><title>Swarm and evolutionary computation</title><addtitle>SWARM EVOL COMPUT</addtitle><description>•The number of swarms is determined adaptively.•A better tradeoff between exploration and exploitation is achieved.•Previous experiences of a swarm are utilized sufficiently.
Multi-population is a promising approach to optimization in dynamic environments. To appropriately distribute multiple populations to distinct areas of the search space and refine the best solution found by each population, an adaptive multi-swarm framework for dynamic optimization problems is proposed, in which several adaptations of multi-population approaches are developed for a better exploration/exploitation tradeoff. As the first intention, a basic adaptation is the combination of a group of active swarms and a group of inactive swarms. The group of active swarms are devoted to exploring new areas of the search space, and the group of inactive swarms are devoted to preserving useful experiences. One kind of swarm can be transformed into another. An active swarm becomes inactive after it converges. An inactive swarm will become active and search for new optima again when an environmental change occurs. For the second intention, another basic adaptation is the application of a local search to the best individual of a stagnated swarm. The experimental results on various moving peaks benchmarks show that the proposed framework is competitive with other state-of-the-art methods and more effective for dynamic environments under many peaks, severe changes, and high dimensionalities.</description><subject>Adaptive swarms</subject><subject>Computer Science</subject><subject>Computer Science, Artificial Intelligence</subject><subject>Computer Science, Theory & Methods</subject><subject>Dynamic environment</subject><subject>Exploration/exploitation tradeoff</subject><subject>Multi-swarm approach</subject><subject>Science & Technology</subject><subject>Technology</subject><issn>2210-6502</issn><issn>2210-6510</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>HGBXW</sourceid><recordid>eNqNkD1rwzAQhkVpoSHNL-jivXUqyZblDB2C6RcEurSz0McJFGI5SIpD_n3tOmQs1XLieJ_jnkPonuAlwaR62i7jEfpuSTElQwfXHF-hGaUE5xUj-Pryx_QWLWLc4uFVmDK2mqHHtZH75HrI2sMuuTweZWgz5zNz8rJ1OgPfu9D5FnyKd-jGyl2ExbnO0ffry1fznm8-3z6a9SbXBS5Srqyqa4qhMFBpbi3TQEBiWxpGFMW85KokiqkhYYkpSAmEK22qYlXJFbe8mKNimqtDF2MAK_bBtTKcBMFidBZb8essRmcxOQ_Uw0QdQXU2agdew4UcnRlhNa9HfTqk6_-nG5dkcp1vuoNPA_o8oTDcoHcQxBk3LoBOwnTuz0V_AG6igYE</recordid><startdate>202106</startdate><enddate>202106</enddate><creator>Qin, Jin</creator><creator>Huang, Chuhua</creator><creator>Luo, Yuan</creator><general>Elsevier B.V</general><general>Elsevier</general><scope>BLEPL</scope><scope>DTL</scope><scope>HGBXW</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-4163-6067</orcidid><orcidid>https://orcid.org/0000-0001-9843-2538</orcidid></search><sort><creationdate>202106</creationdate><title>Adaptive multi-swarm in dynamic environments</title><author>Qin, Jin ; Huang, Chuhua ; Luo, Yuan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c303t-bfb8820e3de6c7ff5ce1ea0f4d51b20747b41b5b0e3f1d314e17bcd6396a97f73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Adaptive swarms</topic><topic>Computer Science</topic><topic>Computer Science, Artificial Intelligence</topic><topic>Computer Science, Theory & Methods</topic><topic>Dynamic environment</topic><topic>Exploration/exploitation tradeoff</topic><topic>Multi-swarm approach</topic><topic>Science & Technology</topic><topic>Technology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Qin, Jin</creatorcontrib><creatorcontrib>Huang, Chuhua</creatorcontrib><creatorcontrib>Luo, Yuan</creatorcontrib><collection>Web of Science Core Collection</collection><collection>Science Citation Index Expanded</collection><collection>Web of Science - Science Citation Index Expanded - 2021</collection><collection>CrossRef</collection><jtitle>Swarm and evolutionary computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Qin, Jin</au><au>Huang, Chuhua</au><au>Luo, Yuan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Adaptive multi-swarm in dynamic environments</atitle><jtitle>Swarm and evolutionary computation</jtitle><stitle>SWARM EVOL COMPUT</stitle><date>2021-06</date><risdate>2021</risdate><volume>63</volume><spage>100870</spage><pages>100870-</pages><artnum>100870</artnum><issn>2210-6502</issn><eissn>2210-6510</eissn><abstract>•The number of swarms is determined adaptively.•A better tradeoff between exploration and exploitation is achieved.•Previous experiences of a swarm are utilized sufficiently.
Multi-population is a promising approach to optimization in dynamic environments. To appropriately distribute multiple populations to distinct areas of the search space and refine the best solution found by each population, an adaptive multi-swarm framework for dynamic optimization problems is proposed, in which several adaptations of multi-population approaches are developed for a better exploration/exploitation tradeoff. As the first intention, a basic adaptation is the combination of a group of active swarms and a group of inactive swarms. The group of active swarms are devoted to exploring new areas of the search space, and the group of inactive swarms are devoted to preserving useful experiences. One kind of swarm can be transformed into another. An active swarm becomes inactive after it converges. An inactive swarm will become active and search for new optima again when an environmental change occurs. For the second intention, another basic adaptation is the application of a local search to the best individual of a stagnated swarm. The experimental results on various moving peaks benchmarks show that the proposed framework is competitive with other state-of-the-art methods and more effective for dynamic environments under many peaks, severe changes, and high dimensionalities.</abstract><cop>AMSTERDAM</cop><pub>Elsevier B.V</pub><doi>10.1016/j.swevo.2021.100870</doi><tpages>11</tpages><orcidid>https://orcid.org/0000-0003-4163-6067</orcidid><orcidid>https://orcid.org/0000-0001-9843-2538</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2210-6502 |
ispartof | Swarm and evolutionary computation, 2021-06, Vol.63, p.100870, Article 100870 |
issn | 2210-6502 2210-6510 |
language | eng |
recordid | cdi_webofscience_primary_000651587800002 |
source | Web of Science - Science Citation Index Expanded - 2021<img src="https://exlibris-pub.s3.amazonaws.com/fromwos-v2.jpg" />; Access via ScienceDirect (Elsevier) |
subjects | Adaptive swarms Computer Science Computer Science, Artificial Intelligence Computer Science, Theory & Methods Dynamic environment Exploration/exploitation tradeoff Multi-swarm approach Science & Technology Technology |
title | Adaptive multi-swarm in dynamic environments |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T08%3A05%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_webof&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Adaptive%20multi-swarm%20in%20dynamic%20environments&rft.jtitle=Swarm%20and%20evolutionary%20computation&rft.au=Qin,%20Jin&rft.date=2021-06&rft.volume=63&rft.spage=100870&rft.pages=100870-&rft.artnum=100870&rft.issn=2210-6502&rft.eissn=2210-6510&rft_id=info:doi/10.1016/j.swevo.2021.100870&rft_dat=%3Celsevier_webof%3ES2210650221000316%3C/elsevier_webof%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S2210650221000316&rfr_iscdi=true |