{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:54:38Z","timestamp":1740174878797,"version":"3.37.3"},"reference-count":66,"publisher":"Wiley","license":[{"start":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T00:00:00Z","timestamp":1641427200000},"content-version":"unspecified","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":["51766005","52166001","2019530000241019"],"award-info":[{"award-number":["51766005","52166001","2019530000241019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Project of Yunnan Tobacco Company of China","award":["51766005","52166001","2019530000241019"],"award-info":[{"award-number":["51766005","52166001","2019530000241019"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2022,1,6]]},"abstract":"<jats:p>This article comes up with a complex-valued encoding multichain seeker optimization algorithm (CMSOA) for the engineering optimization problems. The complex-valued encoding strategy and the multichain strategy are leaded in the seeker optimization algorithm (SOA). These strategies enhance the individuals\u2019 diversity, enhance the local search, avert falling into the local optimum, and are the influential global optimization strategies. This article chooses fifteen benchmark functions, four proportional integral derivative (PID) control parameter models, and six constrained engineering problems to test. According to the experimental results, the CMSOA can be used in the benchmark functions, in the PID control parameter optimization, and in the optimization of constrained engineering problems. Compared to the particle swarm optimization (PSO), simulated annealing based on genetic algorithm (SA_GA), gravitational search algorithm (GSA), sine cosine algorithm (SCA), multiverse optimizer (MVO), and seeker optimization algorithm (SOA), the optimization ability and robustness of the CMSOA are better than those of others algorithms.<\/jats:p>","DOI":"10.1155\/2022\/8249030","type":"journal-article","created":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T22:20:10Z","timestamp":1641507610000},"page":"1-35","source":"Crossref","is-referenced-by-count":1,"title":["A Complex-Valued Encoding Multichain Seeker Optimization Algorithm for Engineering Problems"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7159-1480","authenticated-orcid":true,"given":"Shaomi","family":"Duan","sequence":"first","affiliation":[{"name":"The Faculty of Civil Engineering and Mechanics, Kunming University of Science and Technology, Kunming 650500, China"},{"name":"The Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1260-2696","authenticated-orcid":true,"given":"Huilong","family":"Luo","sequence":"additional","affiliation":[{"name":"The Faculty of Civil Engineering and Mechanics, Kunming University of Science and Technology, Kunming 650500, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7478-773X","authenticated-orcid":true,"given":"Haipeng","family":"Liu","sequence":"additional","affiliation":[{"name":"The Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0792-66"},{"first-page":"39","article-title":"A new optimizer using particle swarm theory","author":"R. C. Eberhart","key":"3"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.004"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.07.006"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.022"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1870-7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.12785\/amis\/070304"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1923-y"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.03.055"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-016-0212-3"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114864"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115079"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.02.028"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/2996355"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/7081653"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/5684939"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/jas.2020.1003462"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.034"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/tsmc.2019.2956121"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.3028064"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.06.112"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-95957-3_89"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-016-0855-2"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1158-1"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1504\/ijmmno.2017.086795"},{"first-page":"225","article-title":"Seeker optimization algorithm","author":"C. Dai","key":"29"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74377-4_18"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/tpwrs.2009.2021226"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.3969\/j.issn.1004-4132.2010.02.021"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/tie.2009.2031194"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.08.025"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2010.08.032"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21515-5_37"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1080\/18756891.2013.864476"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.044"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.12.004"},{"key":"40","first-page":"1","volume-title":"Genetic Algorithm Based on Complex-Valued Encoding","author":"Z. Zheng","year":"2003"},{"issue":"10","key":"41","first-page":"59","article-title":"Particle swarm optimization based on complex-valued encoding and application in function optimization","volume":"45","author":"D. Chen","year":"2009","journal-title":"Computer Times"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-014-1624-y"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-015-9465-y"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/936374"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1433-8"},{"article-title":"Test functions for optimization needs","year":"2005","author":"M. Molga","key":"46"},{"key":"47","first-page":"760","volume-title":"Particle Swarm Optimization in Encyclopedia of Machine Learning","author":"J. Kennedy","year":"2010"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1016\/s0098-1354(00)00601-3"},{"key":"49","first-page":"15","volume-title":"Algorithms","author":"S. Dasgupta","year":"2009"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1145\/2480741.2480752"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3592-0"},{"key":"52","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100671"},{"key":"53","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"54","doi-asserted-by":"publisher","DOI":"10.1109\/tsmcb.2006.873185"},{"key":"55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2004.09.007"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1080\/03081070701303470"},{"key":"57","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2006.11.020"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1108\/02644401011008577"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.2514\/3.10834"},{"key":"60","doi-asserted-by":"publisher","DOI":"10.1007\/s00366-011-0241-y"},{"key":"61","doi-asserted-by":"publisher","DOI":"10.1002\/(sici)1097-0207(19960315)39:5<829::aid-nme884>3.0.co;2-u"},{"key":"62","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2014.03.007"},{"key":"63","doi-asserted-by":"publisher","DOI":"10.1115\/1.2912596"},{"key":"64","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.11.026"},{"key":"65","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.02.014"},{"key":"66","doi-asserted-by":"publisher","DOI":"10.1115\/1.1561044"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2022\/8249030.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2022\/8249030.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2022\/8249030.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T22:20:16Z","timestamp":1641507616000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2022\/8249030\/"}},"subtitle":[],"editor":[{"given":"Jiwei","family":"Huang","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2022,1,6]]},"references-count":66,"alternative-id":["8249030","8249030"],"URL":"https:\/\/doi.org\/10.1155\/2022\/8249030","relation":{},"ISSN":["1875-919X","1058-9244"],"issn-type":[{"type":"electronic","value":"1875-919X"},{"type":"print","value":"1058-9244"}],"subject":[],"published":{"date-parts":[[2022,1,6]]}}}