{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T05:06:30Z","timestamp":1775192790911,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T00:00:00Z","timestamp":1685404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T00:00:00Z","timestamp":1685404800000},"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":["62106237"],"award-info":[{"award-number":["62106237"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Joint Funds of the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["U21A20524"],"award-info":[{"award-number":["U21A20524"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010010","name":"Shanxi Province Science Foundation for Youths","doi-asserted-by":"publisher","award":["201901D211237"],"award-info":[{"award-number":["201901D211237"]}],"id":[{"id":"10.13039\/501100010010","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Research Project of Shanxi Province","award":["202103021224218"],"award-info":[{"award-number":["202103021224218"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The artificial bee colony algorithm (ABC) struggles in handling complex optimization problems with high dimensions in light of its search operators\u2019 strong exploration and weak exploitation properties. To tackle this situation, in this study, we propose a bi-preference linkage-driven ABC algorithm with multi-operator fusion, named BPLABC. BPLABC couples a preference-free stochastic search operator with a global best-guided search operator in the employed bee phase to maintain the population diversity while enhancing the population quality. During the onlooker bee phase, a tailored bi-type elite-guided exploitation mechanism is employed to regulate the exploitation intensity of the promising elite nectar sources selected via a new roulette selection probability calculation paradigm. To discourage the onlooker bees from slipping into local traps, after the scout bee phase, an auxiliary adversarial search operator is assembled to tug certain promising elite solutions away from the present pseudo-global best solution. To illustrate the effectiveness and efficiency of BPLABC, two sets of test suits consisting of 23 benchmark problems, 30 complex CEC2014 functions, and two real-world problems are picked for testing. Experimental results showed that BPLABC can achieve superior or equivalent performance to several representative ABC variants on the majority of the tested problems.<\/jats:p>","DOI":"10.1007\/s40747-023-01085-5","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T03:31:16Z","timestamp":1685417476000},"page":"6729-6751","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Bi-preference linkage-driven artificial bee colony algorithm with multi-operator fusion"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2638-6485","authenticated-orcid":false,"given":"Haibo","family":"Yu","sequence":"first","affiliation":[]},{"given":"Yaxin","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Li","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Jianchao","family":"Zeng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"1085_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ins.2010.07.015","volume":"192","author":"B Akay","year":"2012","unstructured":"Akay B, Karaboga D (2012) A modified artificial bee colony algorithm for real-parameter optimization. Inf Sci 192:120\u2013142","journal-title":"Inf Sci"},{"issue":"6","key":"1085_CR2","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1007\/s10489-017-1025-x","volume":"48","author":"J Cao","year":"2017","unstructured":"Cao J, Yin B, Lu X, Kang Y, Chen X (2017) A modified artificial bee colony approach for the 0\u20131 knapsack problem. Appl Intell 48(6):1582\u20131595. https:\/\/doi.org\/10.1007\/s10489-017-1025-x","journal-title":"Appl Intell"},{"key":"1085_CR3","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1016\/j.apenergy.2017.12.115","volume":"212","author":"X Chen","year":"2018","unstructured":"Chen X, Xu B, Mei C, Ding Y, Li K (2018) Teaching\u2013learning\u2013based artificial bee colony for solar photovoltaic parameter estimation. Appl Energy 212:1578\u20131588. https:\/\/doi.org\/10.1016\/j.apenergy.2017.12.115","journal-title":"Appl Energy"},{"key":"1085_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.asoc.2015.01.067","volume":"30","author":"MA Contreras-Cruz","year":"2015","unstructured":"Contreras-Cruz MA, Ayala-Ramirez V, Hernandez-Belmonte UH (2015) Mobile robot path planning using artificial bee colony and evolutionary programming. Appl Soft Comput 30:319\u2013328. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.067","journal-title":"Appl Soft Comput"},{"key":"1085_CR5","unstructured":"Das S, Suganthan PNJJU, Nanyang Technological University, Kolkata (2010) Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems, pp 341\u2013359"},{"issue":"10","key":"1085_CR6","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1049\/iet-its.2018.5359","volume":"13","author":"X Dong","year":"2019","unstructured":"Dong X, Lin Q, Xu M, Cai Y (2019) Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem. IET Intell Transport Syst 13(10):1483\u20131491. https:\/\/doi.org\/10.1049\/iet-its.2018.5359","journal-title":"IET Intell Transport Syst"},{"key":"1085_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ins.2015.04.006","volume":"316","author":"W Gao","year":"2015","unstructured":"Gao W, Chan FTS, Huang L, Liu S (2015) Bare bones artificial bee colony algorithm with parameter adaptation and fitness-based neighborhood. Inf Sci 316:180\u2013200. https:\/\/doi.org\/10.1016\/j.ins.2015.04.006","journal-title":"Inf Sci"},{"issue":"11","key":"1085_CR8","doi-asserted-by":"publisher","first-page":"2741","DOI":"10.1016\/j.cam.2012.01.013","volume":"236","author":"W Gao","year":"2012","unstructured":"Gao W, Liu S, Huang L (2012) A global best artificial bee colony algorithm for global optimization. J Comput Appl Math 236(11):2741\u20132753. https:\/\/doi.org\/10.1016\/j.cam.2012.01.013","journal-title":"J Comput Appl Math"},{"issue":"3","key":"1085_CR9","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1109\/TSMCB.2012.2222373","volume":"43","author":"WF Gao","year":"2013","unstructured":"Gao WF, Liu SY, Huang LL (2013) A novel artificial bee colony algorithm based on modified search equation and orthogonal learning. IEEE Trans Cybern 43(3):1011\u20131024. https:\/\/doi.org\/10.1109\/TSMCB.2012.2222373","journal-title":"IEEE Trans Cybern"},{"key":"1085_CR10","doi-asserted-by":"crossref","unstructured":"Guo P, Cheng W, Liang J (2011) Global artificial bee colony search algorithm for numerical function optimization. In: 2011 seventh international conference on natural computation, vol 3. IEEE, pp 1280\u20131283","DOI":"10.1109\/ICNC.2011.6022368"},{"key":"1085_CR11","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, vol 200, pp 1\u201310. Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department"},{"key":"1085_CR12","doi-asserted-by":"crossref","unstructured":"Kennedy J (2003) Bare bones particle swarms. In: Proceedings of the 2003 IEEE swarm intelligence symposium. SIS\u201903 (Cat. No. 03EX706). IEEE, pp 80\u201387","DOI":"10.1109\/SIS.2003.1202251"},{"key":"1085_CR13","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ins.2014.12.043","volume":"300","author":"MS Kiran","year":"2015","unstructured":"Kiran MS, Hakli H, Gunduz M, Uguz H (2015) Artificial bee colony algorithm with variable search strategy for continuous optimization. Inf Sci 300:140\u2013157","journal-title":"Inf Sci"},{"issue":"1","key":"1085_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.5755\/j01.eie.23.1.17584","volume":"23","author":"T Koza","year":"2017","unstructured":"Koza T, Karaboga N (2017) Quadrature mirror filter bank design for mitral valve doppler signal using artificial bee colony algorithm. Elektron Elektrotechn 23(1):57\u201362. https:\/\/doi.org\/10.5755\/j01.eie.23.1.17584","journal-title":"Elektron Elektrotechn"},{"key":"1085_CR15","unstructured":"Liang JJ, Qu BY, Suganthan PNJCIL, Zhengzhou University, Zhengzhou China, Technical Report NTU, Singapore (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization, vol 635, p 490"},{"key":"1085_CR16","doi-asserted-by":"publisher","DOI":"10.3390\/healthcare9020152","author":"YK Lin","year":"2021","unstructured":"Lin YK, Li MY (2021) Solving operating room scheduling problem using artificial bee colony algorithm. Healthcare (Basel). https:\/\/doi.org\/10.3390\/healthcare9020152","journal-title":"Healthcare (Basel)"},{"issue":"3","key":"1085_CR17","first-page":"336","volume":"43","author":"C-F Wang","year":"2016","unstructured":"Wang C-F, Zhang Y-H (2016) An improved artificial bee colony algorithm for solving optimization problems. IAENG Int J Comput Sci 43(3):336\u2013343","journal-title":"IAENG Int J Comput Sci"},{"issue":"6","key":"1085_CR18","doi-asserted-by":"publisher","first-page":"4971","DOI":"10.1007\/s40747-022-00746-1","volume":"8","author":"C Wang","year":"2022","unstructured":"Wang C, Shang P, Shen P (2022) An improved artificial bee colony algorithm based on Bayesian estimation. Complex Intell Syst 8(6):4971\u20134991","journal-title":"Complex Intell Syst"},{"issue":"6","key":"1085_CR19","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1109\/TCYB.2016.2550502","volume":"47","author":"H Wang","year":"2016","unstructured":"Wang H, Jin Y, Yao X (2016) Diversity assessment in many-objective optimization. IEEE Trans Cybern 47(6):1510\u20131522","journal-title":"IEEE Trans Cybern"},{"issue":"3","key":"1085_CR20","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/s40747-020-00171-2","volume":"7","author":"H Wang","year":"2020","unstructured":"Wang H, Wang W, Zhou X, Zhao J, Wang Y, Xiao S, Xu M (2020) Artificial bee colony algorithm based on knowledge fusion. Complex Intell Syst 7(3):1139\u20131152. https:\/\/doi.org\/10.1007\/s40747-020-00171-2","journal-title":"Complex Intell Syst"},{"key":"1085_CR21","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ins.2014.04.013","volume":"279","author":"H Wang","year":"2014","unstructured":"Wang H, Wu Z, Rahnamayan S, Sun H, Liu Y, Pan J-s (2014) Multi-strategy ensemble artificial bee colony algorithm. Inf Sci 279:587\u2013603. https:\/\/doi.org\/10.1016\/j.ins.2014.04.013","journal-title":"Inf Sci"},{"issue":"2","key":"1085_CR22","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin GM (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1085_CR23","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00500-016-2334-4","volume":"22","author":"W-J Yu","year":"2016","unstructured":"Yu W-J, Zhan Z-H, Zhang J (2016) Artificial bee colony algorithm with an adaptive greedy position update strategy. Soft Comput 22(2):437\u2013451. https:\/\/doi.org\/10.1007\/s00500-016-2334-4","journal-title":"Soft Comput"},{"issue":"3","key":"1085_CR24","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s00500-014-1549-5","volume":"20","author":"X Zhou","year":"2014","unstructured":"Zhou X, Wu Z, Wang H, Rahnamayan S (2014) Gaussian bare-bones artificial bee colony algorithm. Soft Comput 20(3):907\u2013924. https:\/\/doi.org\/10.1007\/s00500-014-1549-5","journal-title":"Soft Comput"},{"issue":"7","key":"1085_CR25","doi-asserted-by":"publisher","first-page":"3166","DOI":"10.1016\/j.amc.2010.08.049","volume":"217","author":"G Zhu","year":"2010","unstructured":"Zhu G, Kwong S (2010) Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217(7):3166\u20133173","journal-title":"Appl Math Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01085-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01085-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01085-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T19:21:17Z","timestamp":1698434477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01085-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,30]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1085"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01085-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,30]]},"assertion":[{"value":"18 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}