Improved clonal selection algorithm based on the directional update strategy

At present, many cloning selection algorithms have been studied, and improvements have been made to the cloning, mutation and selection steps. However, there is a lack of research on the optimization of the updating operation steps. The clonal selection algorithm is traditionally updated through a r...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of supercomputing 2023-11, Vol.79 (17), p.19312-19331
Hauptverfasser: Yang, Chao, Huang, Zijing, Jiang, Bibo, Zhu, Menglian, Luo, Aoran, He, Jianfeng
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 19331
container_issue 17
container_start_page 19312
container_title The Journal of supercomputing
container_volume 79
creator Yang, Chao
Huang, Zijing
Jiang, Bibo
Zhu, Menglian
Luo, Aoran
He, Jianfeng
description At present, many cloning selection algorithms have been studied, and improvements have been made to the cloning, mutation and selection steps. However, there is a lack of research on the optimization of the updating operation steps. The clonal selection algorithm is traditionally updated through a random complement of antibodies, which is a blind and uncertain process. The added antibodies may gather near a local optimal solution, resulting in the need for more iterations to obtain the global optimal solution. To solve this problem, our improved algorithm introduces a crowding degree factor in the antibody updating stage to determine whether there is crowding between antibodies. By eliminating antibodies with high crowding potential and poor affinity, the improved algorithm guides the antibodies to update in the direction of the global optimal solution and ensures stable convergence with fewer iterations. Experimental results show that the overall performance of the improved algorithm is 1% higher than that of the clonal selection algorithm and 2.2% higher than that of the genetic algorithm, indicating that the improved algorithm is effective. The improved algorithm is also transplanted to other improved clonal selection algorithms, and the overall performance is improved by 0.97%, indicating that the improved algorithm can be a beneficial supplement to other improved clonal selection algorithms.
doi_str_mv 10.1007/s11227-023-05405-x
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2871753138</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2871753138</sourcerecordid><originalsourceid>FETCH-LOGICAL-c314t-ba458228fd71572113ace5e6acc2c535d7ef9cccf89f188301085aa746f0305c3</originalsourceid><addsrcrecordid>eNp9kE9LAzEUxIMoWKtfwNOC5-h7-dOkRylqCwUveg5pNmm3bLs1yUr77Y2u4M3T8B6_GYYh5BbhHgHUQ0JkTFFgnIIUIOnxjIxQqnIKLc7JCKYMqJaCXZKrlLYAILjiI7Jc7A6x-_R15dpub9sq-da73HT7yrbrLjZ5s6tWNhWgvPLGV3UTB6DA_aG22VcpxyLr0zW5CLZN_uZXx-T9-eltNqfL15fF7HFJHUeR6coKqRnToValIkPk1nnpJ9Y55iSXtfJh6pwLehpQaw4IWlqrxCQAB-n4mNwNuaX6R-9TNtuuj6VQMkwrVJIj14ViA-Vil1L0wRxis7PxZBDM92pmWM2U1czPauZYTHwwpQLv1z7-Rf_j-gLrIXCh</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2871753138</pqid></control><display><type>article</type><title>Improved clonal selection algorithm based on the directional update strategy</title><source>SpringerLink Journals</source><creator>Yang, Chao ; Huang, Zijing ; Jiang, Bibo ; Zhu, Menglian ; Luo, Aoran ; He, Jianfeng</creator><creatorcontrib>Yang, Chao ; Huang, Zijing ; Jiang, Bibo ; Zhu, Menglian ; Luo, Aoran ; He, Jianfeng</creatorcontrib><description>At present, many cloning selection algorithms have been studied, and improvements have been made to the cloning, mutation and selection steps. However, there is a lack of research on the optimization of the updating operation steps. The clonal selection algorithm is traditionally updated through a random complement of antibodies, which is a blind and uncertain process. The added antibodies may gather near a local optimal solution, resulting in the need for more iterations to obtain the global optimal solution. To solve this problem, our improved algorithm introduces a crowding degree factor in the antibody updating stage to determine whether there is crowding between antibodies. By eliminating antibodies with high crowding potential and poor affinity, the improved algorithm guides the antibodies to update in the direction of the global optimal solution and ensures stable convergence with fewer iterations. Experimental results show that the overall performance of the improved algorithm is 1% higher than that of the clonal selection algorithm and 2.2% higher than that of the genetic algorithm, indicating that the improved algorithm is effective. The improved algorithm is also transplanted to other improved clonal selection algorithms, and the overall performance is improved by 0.97%, indicating that the improved algorithm can be a beneficial supplement to other improved clonal selection algorithms.</description><identifier>ISSN: 0920-8542</identifier><identifier>EISSN: 1573-0484</identifier><identifier>DOI: 10.1007/s11227-023-05405-x</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Antibodies ; Cloning ; Compilers ; Computer Science ; Crowding ; Genetic algorithms ; Interpreters ; Optimization ; Processor Architectures ; Programming Languages</subject><ispartof>The Journal of supercomputing, 2023-11, Vol.79 (17), p.19312-19331</ispartof><rights>The Author(s) 2023</rights><rights>The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c314t-ba458228fd71572113ace5e6acc2c535d7ef9cccf89f188301085aa746f0305c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11227-023-05405-x$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11227-023-05405-x$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Yang, Chao</creatorcontrib><creatorcontrib>Huang, Zijing</creatorcontrib><creatorcontrib>Jiang, Bibo</creatorcontrib><creatorcontrib>Zhu, Menglian</creatorcontrib><creatorcontrib>Luo, Aoran</creatorcontrib><creatorcontrib>He, Jianfeng</creatorcontrib><title>Improved clonal selection algorithm based on the directional update strategy</title><title>The Journal of supercomputing</title><addtitle>J Supercomput</addtitle><description>At present, many cloning selection algorithms have been studied, and improvements have been made to the cloning, mutation and selection steps. However, there is a lack of research on the optimization of the updating operation steps. The clonal selection algorithm is traditionally updated through a random complement of antibodies, which is a blind and uncertain process. The added antibodies may gather near a local optimal solution, resulting in the need for more iterations to obtain the global optimal solution. To solve this problem, our improved algorithm introduces a crowding degree factor in the antibody updating stage to determine whether there is crowding between antibodies. By eliminating antibodies with high crowding potential and poor affinity, the improved algorithm guides the antibodies to update in the direction of the global optimal solution and ensures stable convergence with fewer iterations. Experimental results show that the overall performance of the improved algorithm is 1% higher than that of the clonal selection algorithm and 2.2% higher than that of the genetic algorithm, indicating that the improved algorithm is effective. The improved algorithm is also transplanted to other improved clonal selection algorithms, and the overall performance is improved by 0.97%, indicating that the improved algorithm can be a beneficial supplement to other improved clonal selection algorithms.</description><subject>Algorithms</subject><subject>Antibodies</subject><subject>Cloning</subject><subject>Compilers</subject><subject>Computer Science</subject><subject>Crowding</subject><subject>Genetic algorithms</subject><subject>Interpreters</subject><subject>Optimization</subject><subject>Processor Architectures</subject><subject>Programming Languages</subject><issn>0920-8542</issn><issn>1573-0484</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><recordid>eNp9kE9LAzEUxIMoWKtfwNOC5-h7-dOkRylqCwUveg5pNmm3bLs1yUr77Y2u4M3T8B6_GYYh5BbhHgHUQ0JkTFFgnIIUIOnxjIxQqnIKLc7JCKYMqJaCXZKrlLYAILjiI7Jc7A6x-_R15dpub9sq-da73HT7yrbrLjZ5s6tWNhWgvPLGV3UTB6DA_aG22VcpxyLr0zW5CLZN_uZXx-T9-eltNqfL15fF7HFJHUeR6coKqRnToValIkPk1nnpJ9Y55iSXtfJh6pwLehpQaw4IWlqrxCQAB-n4mNwNuaX6R-9TNtuuj6VQMkwrVJIj14ViA-Vil1L0wRxis7PxZBDM92pmWM2U1czPauZYTHwwpQLv1z7-Rf_j-gLrIXCh</recordid><startdate>20231101</startdate><enddate>20231101</enddate><creator>Yang, Chao</creator><creator>Huang, Zijing</creator><creator>Jiang, Bibo</creator><creator>Zhu, Menglian</creator><creator>Luo, Aoran</creator><creator>He, Jianfeng</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20231101</creationdate><title>Improved clonal selection algorithm based on the directional update strategy</title><author>Yang, Chao ; Huang, Zijing ; Jiang, Bibo ; Zhu, Menglian ; Luo, Aoran ; He, Jianfeng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c314t-ba458228fd71572113ace5e6acc2c535d7ef9cccf89f188301085aa746f0305c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Antibodies</topic><topic>Cloning</topic><topic>Compilers</topic><topic>Computer Science</topic><topic>Crowding</topic><topic>Genetic algorithms</topic><topic>Interpreters</topic><topic>Optimization</topic><topic>Processor Architectures</topic><topic>Programming Languages</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Chao</creatorcontrib><creatorcontrib>Huang, Zijing</creatorcontrib><creatorcontrib>Jiang, Bibo</creatorcontrib><creatorcontrib>Zhu, Menglian</creatorcontrib><creatorcontrib>Luo, Aoran</creatorcontrib><creatorcontrib>He, Jianfeng</creatorcontrib><collection>Springer Nature OA/Free Journals</collection><collection>CrossRef</collection><jtitle>The Journal of supercomputing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Chao</au><au>Huang, Zijing</au><au>Jiang, Bibo</au><au>Zhu, Menglian</au><au>Luo, Aoran</au><au>He, Jianfeng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improved clonal selection algorithm based on the directional update strategy</atitle><jtitle>The Journal of supercomputing</jtitle><stitle>J Supercomput</stitle><date>2023-11-01</date><risdate>2023</risdate><volume>79</volume><issue>17</issue><spage>19312</spage><epage>19331</epage><pages>19312-19331</pages><issn>0920-8542</issn><eissn>1573-0484</eissn><abstract>At present, many cloning selection algorithms have been studied, and improvements have been made to the cloning, mutation and selection steps. However, there is a lack of research on the optimization of the updating operation steps. The clonal selection algorithm is traditionally updated through a random complement of antibodies, which is a blind and uncertain process. The added antibodies may gather near a local optimal solution, resulting in the need for more iterations to obtain the global optimal solution. To solve this problem, our improved algorithm introduces a crowding degree factor in the antibody updating stage to determine whether there is crowding between antibodies. By eliminating antibodies with high crowding potential and poor affinity, the improved algorithm guides the antibodies to update in the direction of the global optimal solution and ensures stable convergence with fewer iterations. Experimental results show that the overall performance of the improved algorithm is 1% higher than that of the clonal selection algorithm and 2.2% higher than that of the genetic algorithm, indicating that the improved algorithm is effective. The improved algorithm is also transplanted to other improved clonal selection algorithms, and the overall performance is improved by 0.97%, indicating that the improved algorithm can be a beneficial supplement to other improved clonal selection algorithms.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11227-023-05405-x</doi><tpages>20</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0920-8542
ispartof The Journal of supercomputing, 2023-11, Vol.79 (17), p.19312-19331
issn 0920-8542
1573-0484
language eng
recordid cdi_proquest_journals_2871753138
source SpringerLink Journals
subjects Algorithms
Antibodies
Cloning
Compilers
Computer Science
Crowding
Genetic algorithms
Interpreters
Optimization
Processor Architectures
Programming Languages
title Improved clonal selection algorithm based on the directional update strategy
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T02%3A32%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improved%20clonal%20selection%20algorithm%20based%20on%20the%20directional%20update%20strategy&rft.jtitle=The%20Journal%20of%20supercomputing&rft.au=Yang,%20Chao&rft.date=2023-11-01&rft.volume=79&rft.issue=17&rft.spage=19312&rft.epage=19331&rft.pages=19312-19331&rft.issn=0920-8542&rft.eissn=1573-0484&rft_id=info:doi/10.1007/s11227-023-05405-x&rft_dat=%3Cproquest_cross%3E2871753138%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2871753138&rft_id=info:pmid/&rfr_iscdi=true