{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T20:21:40Z","timestamp":1773001300580,"version":"3.50.1"},"reference-count":94,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"vor","delay-in-days":285,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["32560201"],"award-info":[{"award-number":["32560201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62062047"],"award-info":[{"award-number":["62062047"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202306350108"],"award-info":[{"award-number":["202306350108"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Intelligent Systems"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>The slime mold algorithm (SMA) is a metaheuristic optimization algorithm that simulates the foraging behavior of slime molds. Compared to other optimization algorithms, SMA has fewer parameters, faster convergence speed, and stronger optimization capabilities. However, the standard SMA uses two randomly selected individuals to guide the search direction of the population, which results in excessive randomness during the search process. This can lead to the loss of valuable information and waste computational resources. To overcome these limitations, this study proposes an enhanced slime mold algorithm (S2SMA) based on a spiral sensing search mechanism. The main contributions of this study are as follows: Firstly, a fitness\u2013distance balanced oscillation search mechanism is introduced to solve the issue of lack of guidance in the individual oscillatory search phase in the original SMA, thus enhancing the global exploration ability of the algorithm. Secondly, the spiral sensing search mechanism is introduced, reshaping the random redistribution behavior in SMA. This aims to fully utilize the effective information in the existing population, improve search efficiency, and enhance population diversity. Finally, the computational logic of SMA is restructured based on the existing parameters, improving the algorithm\u2019s performance while avoiding additional computational overhead. To validate the effectiveness of the proposed S2SMA, experiments were conducted on 71 test instances from the IEEE CEC2017 and IEEE CEC2021 benchmark sets, as well as three engineering problems. The algorithm was compared with classical algorithms, high\u2010performance algorithms, and advanced SMA variants. Experimental results show that S2SMA outperforms the classical algorithms, high\u2010performance algorithms, and other SMA variants in terms of both performance and robustness, demonstrating its potential application in engineering optimization.<\/jats:p>","DOI":"10.1155\/int\/9642959","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T01:46:05Z","timestamp":1760406365000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Augmented Slime Mold Algorithm Based on Spiral Sensing Search Mechanism and Its Engineering Application for Photovoltaic Cell Parameter Identification Problem"],"prefix":"10.1155","volume":"2025","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1675-3547","authenticated-orcid":false,"given":"Qian","family":"Qian","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2873-0001","authenticated-orcid":false,"given":"Hongyu","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8143-0444","authenticated-orcid":false,"given":"Anbo","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0415-1562","authenticated-orcid":false,"given":"Jiawen","family":"Pan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8667-672X","authenticated-orcid":false,"given":"Miao","family":"Song","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0908-1623","authenticated-orcid":false,"given":"Yong","family":"Feng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6721-8459","authenticated-orcid":false,"given":"Yingna","family":"Li","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"key":"e_1_2_11_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114689"},{"key":"e_1_2_11_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106040"},{"key":"e_1_2_11_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.02.013"},{"key":"e_1_2_11_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-021-09698-0"},{"key":"e_1_2_11_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.02.013"},{"key":"e_1_2_11_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2480741.2480752"},{"key":"e_1_2_11_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07034-6"},{"key":"e_1_2_11_8_2","doi-asserted-by":"publisher","DOI":"10.1023\/a:1022602019183"},{"key":"e_1_2_11_9_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"e_1_2_11_10_2","doi-asserted-by":"crossref","unstructured":"KennedyJ.andEberhartR. Particle Swarm optimization 4 Proceedings of ICNN\u201995: International Conference on Neural Networks 1995 Perth WA Australia IEEE http:\/\/ieeexplore.ieee.org\/document\/488968\/ https:\/\/doi.org\/10.1109\/ICNN.1995.488968.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_2_11_11_2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"e_1_2_11_12_2","unstructured":"BasturkB.andKarabogaD. An Artificial Bee Colony (ABC) Algorithm for Numeric Function Optimization 2006 IEEE Swarm Intelligence Symposium (SIS) Indianapolis IN USA: IEEE 2006 12\u201314."},{"key":"e_1_2_11_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.02.028"},{"key":"e_1_2_11_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"e_1_2_11_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"e_1_2_11_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108320"},{"key":"e_1_2_11_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116924"},{"key":"e_1_2_11_18_2","doi-asserted-by":"publisher","DOI":"10.3390\/pr11051502"},{"key":"e_1_2_11_19_2","unstructured":"WebsterB.andBernhardP. J. A Local Search Optimization Algorithm Based on Natural Principles of Gravitation Proceedings of the International Conference on Information and Knowledge Engineering: IKE\u201903 2003 255\u2013261."},{"key":"e_1_2_11_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2012.07.010"},{"key":"e_1_2_11_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2010.12.015"},{"key":"e_1_2_11_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2017.05.001"},{"key":"e_1_2_11_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104427"},{"key":"e_1_2_11_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107230"},{"key":"e_1_2_11_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2020.112764"},{"key":"e_1_2_11_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106642"},{"key":"e_1_2_11_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2021.123011"},{"key":"e_1_2_11_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2020.2971035"},{"key":"e_1_2_11_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2023.3321708"},{"key":"e_1_2_11_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04489-1"},{"key":"e_1_2_11_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"e_1_2_11_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.03.055"},{"key":"e_1_2_11_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107372"},{"key":"e_1_2_11_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111836"},{"key":"e_1_2_11_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124262"},{"key":"e_1_2_11_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-023-10398-3"},{"key":"e_1_2_11_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2023.107018"},{"key":"e_1_2_11_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.gltp.2022.06.001"},{"key":"e_1_2_11_39_2","doi-asserted-by":"publisher","DOI":"10.21608\/sej.2021.155557"},{"key":"e_1_2_11_40_2","doi-asserted-by":"publisher","DOI":"10.1080\/02726343.2020.1838044"},{"key":"e_1_2_11_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-10100-5"},{"key":"e_1_2_11_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03179-y"},{"key":"e_1_2_11_43_2","doi-asserted-by":"publisher","DOI":"10.3390\/math12101470"},{"key":"e_1_2_11_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2022.110884"},{"key":"e_1_2_11_45_2","doi-asserted-by":"crossref","unstructured":"JuiJ. J. AhmadM. A. andRashidM. I. M. Levy Slime Mould Algorithm for Solving Numerical and Engineering Optimization Problems 842 Proceedings of the 6th International Conference on Electrical Control and Computer Engineering 2022 Singapore Springer Singapore 381\u2013394 https:\/\/doi.org\/10.1007\/978-981-16-8690-0_35.","DOI":"10.1007\/978-981-16-8690-0_35"},{"key":"e_1_2_11_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2022.105885"},{"key":"e_1_2_11_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.egyr.2022.06.079"},{"key":"e_1_2_11_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-023-09883-3"},{"key":"e_1_2_11_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106642"},{"key":"e_1_2_11_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-021-01342-6"},{"key":"e_1_2_11_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-04105-8"},{"key":"e_1_2_11_52_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107761"},{"key":"e_1_2_11_53_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asej.2021.101659"},{"key":"e_1_2_11_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11269-022-03183-4"},{"key":"e_1_2_11_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2021.121164"},{"key":"e_1_2_11_56_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2023.133504"},{"key":"e_1_2_11_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-021-06513-7"},{"key":"e_1_2_11_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-023-03568-y"},{"key":"e_1_2_11_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06140-2"},{"key":"e_1_2_11_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105169"},{"key":"e_1_2_11_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2020.103273"},{"key":"e_1_2_11_62_2","doi-asserted-by":"publisher","DOI":"10.20965\/jaciii.2011.p1116"},{"key":"e_1_2_11_63_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-022-07788-z"},{"key":"e_1_2_11_64_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.07.002"},{"key":"e_1_2_11_65_2","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0792-66"},{"key":"e_1_2_11_66_2","doi-asserted-by":"publisher","DOI":"10.1162\/106365603321828970"},{"key":"e_1_2_11_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113917"},{"key":"e_1_2_11_68_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02357-7_21"},{"key":"e_1_2_11_69_2","doi-asserted-by":"crossref","unstructured":"TanabeR.andFukunagaA. S. Improving the Search Performance of SHADE Using Linear Population Size reduction 2014 IEEE Congress on Evolutionary Computation (CEC) 2014 Beijing China IEEE 1658\u20131665 https:\/\/ieeexplore.ieee.org\/document\/6900380 https:\/\/doi.org\/10.1109\/CEC.2014.6900380 2-s2.0-84908582441.","DOI":"10.1109\/CEC.2014.6900380"},{"key":"e_1_2_11_70_2","doi-asserted-by":"crossref","unstructured":"BrestJ. MaucecM. S. andBoskovicB. iL-SHADE: Improved L-SHADE Algorithm for Single Objective real-parameter optimization 2016 IEEE Congress on Evolutionary Computation (CEC) 2016 Vancouver BC Canada IEEE 1188\u20131195 http:\/\/ieeexplore.ieee.org\/document\/7743922\/ https:\/\/doi.org\/10.1109\/CEC.2016.7743922 2-s2.0-85008263898.","DOI":"10.1109\/CEC.2016.7743922"},{"key":"e_1_2_11_71_2","doi-asserted-by":"crossref","unstructured":"BrestJ. MaucecM. S. andBoskovicB. Single Objective Real-Parameter Optimization: Algorithm jSO 2017 IEEE Congress on Evolutionary Computation (CEC) 2017 IEEE 1311\u20131318 http:\/\/ieeexplore.ieee.org\/document\/7969456\/ https:\/\/doi.org\/10.1109\/CEC.2017.7969456 2-s2.0-85027887515.","DOI":"10.1109\/CEC.2017.7969456"},{"key":"e_1_2_11_72_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58930-1_7"},{"key":"e_1_2_11_73_2","doi-asserted-by":"crossref","unstructured":"MohamedA. W. HadiA. A. MohamedA. K. andAwadN. H. Evaluating the Performance of Adaptive Gainingsharing Knowledge Based Algorithm on CEC 2020 Benchmark Problems[C\/OL] 2020 IEEE Congress on Evolutionary Computation (CEC) 2020 IEEE 1\u20138 https:\/\/ieeexplore.ieee.org\/document\/9185901\/ https:\/\/doi.org\/10.1109\/CEC48606.2020.9185901.","DOI":"10.1109\/CEC48606.2020.9185901"},{"key":"e_1_2_11_74_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.10.006"},{"key":"e_1_2_11_75_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-201755"},{"key":"e_1_2_11_76_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2021.04.011"},{"key":"e_1_2_11_77_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2022.02.030"},{"key":"e_1_2_11_78_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.19"},{"key":"e_1_2_11_79_2","first-page":"2875","article-title":"The Markov Model of Shuffled Frog Leaping Algorithm and its Convergence Analysis","volume":"38","author":"Luo J. P.","year":"2010","journal-title":"Dianzi Xuebao\/Acta Electronica Sinica"},{"key":"e_1_2_11_80_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3166459"},{"key":"e_1_2_11_81_2","doi-asserted-by":"publisher","DOI":"10.3778\/j.issn.1002-8331.2205-0566"},{"key":"e_1_2_11_82_2","doi-asserted-by":"publisher","DOI":"10.3390\/su12197996"},{"key":"e_1_2_11_83_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2020.118716"},{"key":"e_1_2_11_84_2","doi-asserted-by":"publisher","DOI":"10.5958\/2454-7611.2016.00035.7"},{"key":"e_1_2_11_85_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2021.114030"},{"key":"e_1_2_11_86_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.egyr.2021.05.030"},{"key":"e_1_2_11_87_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.solmat.2014.07.016"},{"key":"e_1_2_11_88_2","doi-asserted-by":"publisher","DOI":"10.1109\/jsyst.2020.3003255"},{"key":"e_1_2_11_89_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.rser.2018.03.011"},{"key":"e_1_2_11_90_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.egyr.2021.11.179"},{"key":"e_1_2_11_91_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.solener.2012.12.005"},{"key":"e_1_2_11_92_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2018.2793216"},{"key":"e_1_2_11_93_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2023.170900"},{"key":"e_1_2_11_94_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108678"}],"container-title":["International Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/int\/9642959","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/int\/9642959","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/int\/9642959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T17:57:29Z","timestamp":1772992649000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/int\/9642959"}},"subtitle":[],"editor":[{"given":"Richard","family":"Murray","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":94,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["10.1155\/int\/9642959"],"URL":"https:\/\/doi.org\/10.1155\/int\/9642959","archive":["Portico"],"relation":{},"ISSN":["0884-8173","1098-111X"],"issn-type":[{"value":"0884-8173","type":"print"},{"value":"1098-111X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"2024-11-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9642959"}}