{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T13:09:09Z","timestamp":1781356149346,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T00:00:00Z","timestamp":1685145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T00:00:00Z","timestamp":1685145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61977021"],"award-info":[{"award-number":["61977021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Hubei Provincial Key R&D Program Project","award":["2021BAA184"],"award-info":[{"award-number":["2021BAA184"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s11227-023-05405-x","type":"journal-article","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T09:02:32Z","timestamp":1685178152000},"page":"19312-19331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved clonal selection algorithm based on the directional update strategy"],"prefix":"10.1007","volume":"79","author":[{"given":"Chao","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zijing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bibo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Menglian","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aoran","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianfeng","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"5405_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ins.2019.12.083","volume":"517","author":"X Yan","year":"2020","unstructured":"Yan X, Li P, Tang K, Gao L, Wang L (2020) Clonal selection based intelligent parameter inversion algorithm for prestack seismic data. Inf Sci 517:86\u201399. https:\/\/doi.org\/10.1016\/j.ins.2019.12.083","journal-title":"Inf Sci"},{"key":"5405_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11227-021-04295-1","volume":"78","author":"D Wang","year":"2022","unstructured":"Wang D, Liang Y, Dong H, Tan C, Xiao Z, Liu S (2022) Innate immune memory and its application to artificial immune systems. J Supercomput 78:1\u201322. https:\/\/doi.org\/10.1007\/s11227-021-04295-1","journal-title":"J Supercomput"},{"key":"5405_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s40032-018-0447-5","volume":"100","author":"VK Chawla","year":"2019","unstructured":"Chawla VK, Chanda AK, Angra S (2019) A clonal selection algorithm for minimizing distance travel and back tracking of automatic guided vehicles in flexible manufacturing system. J Inst Eng (India) Ser C 100:401\u2013410","journal-title":"J Inst Eng (India) Ser C"},{"issue":"5","key":"5405_CR4","first-page":"102","volume":"49","author":"QUANHY Yanming","year":"2021","unstructured":"Yanming QUANHY (2021) Research on clonal selection algorithm for multi-robot task allocation and scheduling. J S China Univ Technol (Nat Sci Edn) 49(5):102\u2013110","journal-title":"J S China Univ Technol (Nat Sci Edn)"},{"key":"5405_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100369","volume":"40","author":"O Cheikhrouhou","year":"2021","unstructured":"Cheikhrouhou O, Khoufi I (2021) A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy. Comput Sci Rev 40:100369. https:\/\/doi.org\/10.1016\/j.cosrev.2021.100369","journal-title":"Comput Sci Rev"},{"issue":"16","key":"5405_CR6","first-page":"163","volume":"39","author":"G Yu-e","year":"2017","unstructured":"Yu-e G (2017) Research on fault recovery of ship distribution network based on cloning algorithm. Ship Sci Technol 39(16):163\u2013165","journal-title":"Ship Sci Technol"},{"issue":"02","key":"5405_CR7","first-page":"261","volume":"40","author":"FB Zhang","year":"2018","unstructured":"Zhang FB, Fan XL (2018) Research on multi-objective optimal clone selection algorithm for immune intrusion detection. Comput Eng Sci 40(02):261\u2013267","journal-title":"Comput Eng Sci"},{"key":"5405_CR8","doi-asserted-by":"publisher","unstructured":"Chen Q, Fu CQP (2022) Parameter identification of permanent magnet synchronous motor based on clone-selective differential evolutionary algorithm. Sens Microsyst 41(01): 135\u2013137141. https:\/\/doi.org\/10.13873\/J.1000-9787(2022)01-0135-03","DOI":"10.13873\/J.1000-9787(2022)01-0135-03"},{"key":"5405_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/SSCI.2017.8285340","volume":"1","author":"W Luo","year":"2018","unstructured":"Luo W, Lin X (2018) Recent advances in clonal selection algorithms and applications. Comput Intell 1:12\u20132. https:\/\/doi.org\/10.1109\/SSCI.2017.8285340","journal-title":"Comput Intell"},{"issue":"02","key":"5405_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.11999\/JEIT160359","volume":"39","author":"D Song","year":"2017","unstructured":"Song D, Fan X, Wen Z, Huang D, Qu X (2017) Double clonal selection algorithm based on fuzzy non-genetic information memory. J Electron Inf 39(02):255\u2013262. https:\/\/doi.org\/10.11999\/JEIT160359","journal-title":"J Electron Inf"},{"key":"5405_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100886","volume":"63","author":"L Li","year":"2021","unstructured":"Li L, Lin Q, Li K, Ming Z (2021) Vertical distance-based clonal selection mechanism for the multiobjective immune algorithm. Swarm Evolut Comput 63:100886. https:\/\/doi.org\/10.1016\/j.swevo.2021.100886","journal-title":"Swarm Evolut Comput"},{"key":"5405_CR12","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.asoc.2014.09.030","volume":"26","author":"A G\u00e1lvez","year":"2015","unstructured":"G\u00e1lvez A, Iglesias A, Avila A, Otero C, Arias R, Manchado C (2015) Elitist clonal selection algorithm for optimal choice of free knots in b-spline data fitting. Appl Soft Comput 26:90\u2013106. https:\/\/doi.org\/10.1016\/j.asoc.2014.09.030","journal-title":"Appl Soft Comput"},{"issue":"17","key":"5405_CR13","first-page":"68","volume":"57","author":"LL Wanf","year":"2021","unstructured":"Wanf LL, Shen Y, Xu YS et al (2021) A clone selection algorithm incorporating cloud models and backward learning. Comput Eng Appl 57(17):68\u201374","journal-title":"Comput Eng Appl"},{"key":"5405_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ins.2022.04.043","volume":"604","author":"Y Wang","year":"2022","unstructured":"Wang Y, Li T, Liu X, Yao J (2022) An adaptive clonal selection algorithm with multiple differential evolution strategies. Inf Sci 604:142\u2013169. https:\/\/doi.org\/10.1016\/j.ins.2022.04.043","journal-title":"Inf Sci"},{"issue":"11","key":"5405_CR15","doi-asserted-by":"publisher","first-page":"2763","DOI":"10.13328\/j.cnki.jos.004911","volume":"27","author":"WN Shu","year":"2016","unstructured":"Shu WN, Ding LX (2016) Optimization and quality factors of clone selection algorithms. J Softw 27(11):2763\u20132776. https:\/\/doi.org\/10.13328\/j.cnki.jos.004911","journal-title":"J Softw"},{"key":"5405_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101194","volume":"75","author":"Z Tan","year":"2022","unstructured":"Tan Z, Tang Y, Li K, Huang H, Luo S (2022) Differential evolution with hybrid parameters and mutation strategies based on reinforcement learning. Swarm Evol Comput 75:101194. https:\/\/doi.org\/10.1016\/j.swevo.2022.101194","journal-title":"Swarm Evol Comput"},{"issue":"04","key":"5405_CR17","doi-asserted-by":"publisher","first-page":"647","DOI":"10.12263\/DZXB.20200171","volume":"49","author":"R-C Zhang","year":"2021","unstructured":"Zhang R-C, Pan C-Y, Wu X, Yang K (2021) Adaptive sampling immune optimization algorithm for nonlinear multi-objective probabilistic optimization problems. Acta Electronica Sinica 49(04):647\u2013660. https:\/\/doi.org\/10.12263\/DZXB.20200171","journal-title":"Acta Electronica Sinica"},{"issue":"06","key":"5405_CR18","first-page":"1068","volume":"49","author":"J-S Liu","year":"2021","unstructured":"Liu J-S, Ma Y-X, Li Y (2021) Improved butterfly algorithm for multi-dimensional complex function optimization problem. Acta Electronica Sinica 49(06):1068\u20131076","journal-title":"Acta Electronica Sinica"},{"key":"5405_CR19","first-page":"2807056","volume":"2020","author":"C Yang","year":"2020","unstructured":"Yang C, Chen B-Q, Jia L, Wen H-Y (2020) Improved clonal selection algorithm based on biological forgetting mechanism. CompLex 2020:2807056\u20131280705610","journal-title":"CompLex"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05405-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05405-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05405-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T08:09:07Z","timestamp":1696234147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05405-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,27]]},"references-count":19,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["5405"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05405-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,27]]},"assertion":[{"value":"15 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or nonfinancial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"All experimental data in this paper are real and valid, and there is no case of multiple submissions for one manuscript in this article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}