{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:00:49Z","timestamp":1773615649992,"version":"3.50.1"},"reference-count":24,"publisher":"Allerton Press","issue":"6","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.3103\/s0146411622060116","type":"journal-article","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T13:04:00Z","timestamp":1674651840000},"page":"481-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Artificial Bee Colony Optimization Algorithm Based on Slime Mold and Marine Predator"],"prefix":"10.3103","volume":"56","author":[{"family":"Liyi Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyan","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuochen","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"7507_CR1","volume-title":"An idea based on honey bee swarm for numerical optimization, Technical Report-Tr06","author":"D. Karaboga","year":"2005","unstructured":"Karaboga, D., An idea based on honey bee swarm for numerical optimization, Technical Report-Tr06, Kayseri, Turkey: Erciyes Univ., 2005."},{"key":"7507_CR2","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D. Karaboga","year":"2007","unstructured":"Karaboga, D. and Basturk, B., On the performance of artificial bee colony (ABC) algorithm, Appl. Soft Comput., 2007, vol. 8, no. 1, pp. 687\u2013697. \u00a0https:\/\/doi.org\/10.1016\/j.asoc.2007.05.007","journal-title":"Appl. Soft Comput."},{"key":"7507_CR3","doi-asserted-by":"publisher","first-page":"3030","DOI":"10.1177\/1468087420954020","volume":"22","author":"R.M. Ogren","year":"2021","unstructured":"Ogren, R.M. and Kong, S.C., Optimization of diesel fuel injection strategies through applications of cooperative particle swarm optimization and artificial bee colony algorithms, Int. J. Engine Res., 2021, vol. 22, no. 9, pp.\u00a03030\u20133041. \u00a0https:\/\/doi.org\/10.1177\/1468087420954020","journal-title":"Int. J. Engine Res."},{"key":"7507_CR4","doi-asserted-by":"publisher","first-page":"107542","DOI":"10.1016\/j.asoc.2021.107542","volume":"109","author":"Y. Xu","year":"2021","unstructured":"Xu, Y. and Wang, X.L., An artificial bee colony algorithm for scheduling call centres with weekend-off fairness, Appl. Soft Comput., 2021, vol. 109, p. 107542. https:\/\/doi.org\/10.1016\/j.asoc.2021.107542","journal-title":"Appl. Soft Comput."},{"key":"7507_CR5","doi-asserted-by":"publisher","unstructured":"Bayraktar, T., Ers\u00f6z, F., and Kubat, C., Effects of memory and genetic operators on artificial bee colony algorithm for single container loading problem, Appl. Soft Comput., vol. 108, p.\u00a0107462.\u00a0https:\/\/doi.org\/10.1016\/j.asoc.2021.107462","DOI":"10.1016\/j.asoc.2021.107462"},{"key":"7507_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","volume":"111","author":"S.M. Li","year":"2020","unstructured":"Li, S.M., Chen, H.L., Wang, M.J., Heidari, A.A., and Mirjalili, S., Slime mould algorithm: a new method for stochastic optimization, Future Gener. Comput. Syst., 2020, vol. 111, pp.\u00a0300\u2013323. \u00a0https:\/\/doi.org\/10.1016\/j.future.2020.03.055","journal-title":"Future Gener. Comput. Syst."},{"key":"7507_CR7","doi-asserted-by":"publisher","first-page":"113377","DOI":"10.1016\/j.eswa.2020.113377","volume":"152","author":"A. Faramarzi","year":"2020","unstructured":"Faramarzi, A., Heidarinejad, M., Mirjalili, S., and Gandomi, A.H., Marine predators algorithm: a nature-inspired metaheuristic, Expert Syst. Appl., 2020, vol. 152, p. 113377. \u00a0https:\/\/doi.org\/10.1016\/j.eswa.2020.113377","journal-title":"Expert Syst. Appl."},{"key":"7507_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.simpat.2018.06.004","volume":"93","author":"M. Zhang","year":"2019","unstructured":"Zhang, M., Tan, Y.T., Zhu, J., Chen, Y.N., and Liu, H.M., Modeling and simulation of improved artificial bee colony algorithm with data-driven optimization, Simul. Model. Pract. Theory, 2019, vol. 93, pp. 305\u2013321. https:\/\/doi.org\/10.1016\/j.simpat.2018.06.004","journal-title":"Simul. Model. Pract. Theory"},{"key":"7507_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.conengprac.2017.02.010","volume":"61","author":"W. Bai","year":"2017","unstructured":"Bai, W., Eke, I., and Lee, K.Y., An improved artificial bee colony optimization algorithm based on orthogonal learning for optimal power flow problem, Control Eng. Pract., 2017, vol.\u00a061, pp. 163\u2013172. \u00a0https:\/\/doi.org\/10.1016\/j.conengprac.2017.02.010","journal-title":"Control Eng. Pract."},{"key":"7507_CR10","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1016\/j.asoc.2018.06.048","volume":"71","author":"U. Taetragool","year":"2018","unstructured":"Taetragool, U., Sirinaovakul, B., and Achalakul, T., NeSS: A modified artificial bee colony approach based on nest site selection behavior, Appl. Soft Comput., 2018, vol. 71, pp. 659\u2013671. \u00a0https:\/\/doi.org\/10.1016\/j.asoc.2018.06.048","journal-title":"Appl. Soft Comput."},{"key":"7507_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ins.2019.07.022","volume":"504","author":"D. Bajer","year":"2019","unstructured":"Bajer, D. and Zori\u0107, B., An effective refined artificial bee colony algorithm for numerical optimisation, Inf. Sci., 2019, vol. 504, pp. 221\u2013275. https:\/\/doi.org\/10.1016\/j.ins.2019.07.022","journal-title":"Inf. Sci."},{"key":"7507_CR12","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.asoc.2018.04.001","volume":"68","author":"N. Sharma","year":"2018","unstructured":"Sharma, N., Sharma, H., and Sharma, A., Beer froth artificial bee colony algorithm for job-shop scheduling problem, Appl. Soft Comput., 2018, vol. 68, no. 4, pp. 507\u2013524. \u00a0https:\/\/doi.org\/10.1016\/j.asoc.2018.04.001","journal-title":"Appl. Soft Comput."},{"key":"7507_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2017.06.015","volume":"60","author":"W.L. Xiang","year":"2017","unstructured":"Xiang, W.L., Li, Y.Z., Meng, X.L., Zhang, C.M., and An, M.Q., A grey artificial bee colony algorithm, Appl. Soft Comput., 2017, vol. 60, pp. 1\u201317. https:\/\/doi.org\/10.1016\/j.asoc.2017.06.015","journal-title":"Appl. Soft Comput."},{"key":"7507_CR14","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1016\/j.cor.2012.12.006","volume":"40","author":"W.L. Xiang","year":"2013","unstructured":"Xiang, W.L. and An, M.Q., An efficient and robust artificial bee colony algorithm for numerical optimization, Comput. Oper. Res., 2013, vol. 40, no. 5, pp. 1256\u20131265. \u00a0https:\/\/doi.org\/10.1016\/j.cor.2012.12.006","journal-title":"Comput. Oper. Res."},{"key":"7507_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.ins.2020.03.064","volume":"527","author":"H. Wang","year":"2020","unstructured":"Wang, H., Wang, W.J., Xiao, S.Y., Cui, Z.H., Xu, M.Y., and Zhou, X.Y., Improving artificial bee colony algorithm using a new neighborhood selection mechanism, Inf. Sci., 2020, vol. 527, pp. 227\u2013240. \u00a0https:\/\/doi.org\/10.1016\/j.ins.2020.03.064","journal-title":"Inf. Sci."},{"key":"7507_CR16","doi-asserted-by":"publisher","first-page":"106642","DOI":"10.1016\/j.asoc.2020.106642","volume":"95","author":"M. Abdel-Basset","year":"2020","unstructured":"Abdel-Basset, M., Chang, V., and Mohamed, R., HSMA_WOA: A hybrid novel slime mould algorithm with whale optimization algorithm for tackling the image segmentation problem of chest x-ray images, Appl. Soft Comput., 2020, vol. 95, p. 106642. \u00a0https:\/\/doi.org\/10.1016\/j.asoc.2020.106642","journal-title":"Appl. Soft Comput."},{"key":"7507_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.isatra.2021.04.011","volume":"121","author":"R.M. Rizk-Allah","year":"2021","unstructured":"Rizk-Allah, R.M., Hassanien, A.E., and Song, D., Chaos-opposition-enhanced slime mould algorithm for minimizing the cost of energy for the wind turbines on high-altitude sites, ISA Trans., 2021, vol. 121, pp. 191\u2013205. \u00a0https:\/\/doi.org\/10.1016\/j.isatra.2021.04.011","journal-title":"ISA Trans."},{"key":"7507_CR18","doi-asserted-by":"publisher","first-page":"115205","DOI":"10.1016\/j.eswa.2021.115205","volume":"128","author":"M.H. Hassan","year":"2021","unstructured":"Hassan, M.H., Kamel, S., Abualigah, L., and Eid, A., Development and application of slime mould algorithm for optimal economic emission dispatch, Expert Syst. Appl., 2021, vol. 128, p. 115205. \u00a0https:\/\/doi.org\/10.1016\/j.eswa.2021.115205","journal-title":"Expert Syst. Appl."},{"key":"7507_CR19","doi-asserted-by":"publisher","first-page":"5068","DOI":"10.1109\/TII.2020.3001067","volume":"17","author":"A.B. Mohamed","year":"2020","unstructured":"Mohamed, A.B., Mohamed, R., Elhoseny, M., Bashir, A.K., and Kumar, N., Energy-aware marine predators algorithm for task scheduling in IoT-based fog computing applications, IEEE Trans. Ind. Inf., 2020, vol. 17, no.\u00a07, pp. 5068\u20135076. \u00a0https:\/\/doi.org\/10.1109\/TII.2020.3001067","journal-title":"IEEE Trans. Ind. Inf."},{"key":"7507_CR20","doi-asserted-by":"publisher","first-page":"115253","DOI":"10.1016\/j.eswa.2021.115253","volume":"183","author":"E.H. Houssein","year":"2021","unstructured":"Houssein, E.H., Mohamed, M., Ahmed, F., Hegazy, R., and Kumar, N., A modified marine predator algorithm based on opposition based learning for tracking the global MPP of shaded PV system, Expert Syst. Appl., 2021, vol. 183, p. 115253. \u00a0https:\/\/doi.org\/10.1016\/j.eswa.2021.115253","journal-title":"Expert Syst. Appl."},{"key":"7507_CR21","doi-asserted-by":"publisher","first-page":"106568","DOI":"10.1016\/j.compstruc.2021.106568","volume":"252","author":"L.V. Ho","year":"2021","unstructured":"Ho, L.V., Nguyen, D.H., Mousavi, M., De, R.G., Bui, T.T., Gandomi, A.H., and Wahab,\u00a0M.A., A hybrid computational intelligence approach for structural damage detection using marine predator algorithm and feedforward neural networks, Comput. Struct., 2021, vol.\u00a0252, p. 106568. \u00a0https:\/\/doi.org\/10.1016\/j.compstruc.2021.106568","journal-title":"Comput. Struct."},{"key":"7507_CR22","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1515\/mt-2020-0077","volume":"63","author":"N. Panagant","year":"2021","unstructured":"Panagant, N., Y\u0131ld\u0131z, M., Pholdee, N., Y\u0131ld\u0131z, A.R., Bureerat, S., and Sait, S.M., A novel hybrid marine predators-nelder-mead optimization algorithm for the optimal design of engineering problems, Mater. Test, 2021, vol. 63, no. 5, pp. 453\u2013457. \u00a0https:\/\/doi.org\/10.1515\/mt-2020-0077","journal-title":"Mater. Test"},{"key":"7507_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.5343\/bms.2010.1057","volume":"87","author":"J.D. Filmalter","year":"2011","unstructured":"Filmalter, J.D., Dagorn, L., Cowley, P.D., and Taquet, M., First descriptions of the behavior of silky sharks, Carcharhinus falciformis, around drifting fish aggregating devices in the Indian Ocean, Bull. Mar. Sci., 2011, vol.\u00a087, no. 3, pp. 325\u2013337. \u00a0https:\/\/doi.org\/10.5343\/bms.2010.1057","journal-title":"Bull. Mar. Sci."},{"key":"7507_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H. and Macready, W.G., No free lunch theorems for optimization, IEEE Trans. Evol. Comput., 1997, vol. 1, no. 1, pp. 67\u201382. \u00a0https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411622060116.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411622060116","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411622060116.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:02:45Z","timestamp":1773612165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411622060116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["7507"],"URL":"https:\/\/doi.org\/10.3103\/s0146411622060116","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"27 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}