{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:24:37Z","timestamp":1786980277126,"version":"build-2736575974"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00500-021-06140-2","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T08:03:27Z","timestamp":1629705807000},"page":"14297-14313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":78,"title":["Adaptive opposition slime mould algorithm"],"prefix":"10.1007","volume":"25","author":[{"given":"Manoj Kumar","family":"Naik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8676-0144","authenticated-orcid":false,"given":"Rutuparna","family":"Panda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajith","family":"Abraham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,23]]},"reference":[{"key":"6140_CR1","doi-asserted-by":"publisher","first-page":"115079","DOI":"10.1016\/j.eswa.2021.115079","volume":"181","author":"I Ahmadianfar","year":"2021","unstructured":"Ahmadianfar I, Heidari AA, Gandomi AH et al (2021) RUN beyond the metaphor: an efficient optimization algorithm based on Runge Kutta method. Expert Syst Appl 181:115079. https:\/\/doi.org\/10.1016\/j.eswa.2021.115079","journal-title":"Expert Syst Appl"},{"key":"6140_CR2","doi-asserted-by":"publisher","first-page":"113389","DOI":"10.1016\/j.eswa.2020.113389","volume":"151","author":"S Dhargupta","year":"2020","unstructured":"Dhargupta S, Ghosh M, Mirjalili S, Sarkar R (2020) Selective opposition based grey wolf optimization. Expert Syst Appl 151:113389. https:\/\/doi.org\/10.1016\/j.eswa.2020.113389","journal-title":"Expert Syst Appl"},{"key":"6140_CR3","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge"},{"key":"6140_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/10286608.2013.820280","volume":"31","author":"A Faramarzi","year":"2014","unstructured":"Faramarzi A, Afshar M (2014) A novel hybrid cellular automata-linear programming approach for the optimal sizing of planar truss structures. Civ Eng Environ Syst 31:209\u2013228. https:\/\/doi.org\/10.1080\/10286608.2013.820280","journal-title":"Civ Eng Environ Syst"},{"key":"6140_CR5","doi-asserted-by":"publisher","first-page":"105190","DOI":"10.1016\/j.knosys.2019.105190","volume":"191","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A, Heidarinejad M, Stephens B, Mirjalili S (2020) Equilibrium optimizer: a novel optimization algorithm. Knowl-Based Syst 191:105190. https:\/\/doi.org\/10.1016\/j.knosys.2019.105190","journal-title":"Knowl-Based Syst"},{"key":"6140_CR6","volume-title":"Differential evolution","author":"V Feoktistov","year":"2006","unstructured":"Feoktistov V (2006) Differential evolution. Springer, New York"},{"key":"6140_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1:190\u2013206. https:\/\/doi.org\/10.1287\/ijoc.1.3.190","journal-title":"ORSA J Comput"},{"key":"6140_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2014part II. ORSA J Comput 2:4\u201332. https:\/\/doi.org\/10.1287\/ijoc.2.1.4","journal-title":"ORSA J Comput"},{"key":"6140_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-05183-1","author":"R Guha","year":"2020","unstructured":"Guha R, Ghosh M, Mutsuddi S et al (2020) Embedded chaotic whale survival algorithm for filter\u2013wrapper feature selection. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-020-05183-1","journal-title":"Soft Comput"},{"key":"6140_CR10","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari AA, Mirjalili S, Faris H et al (2019) Harris hawks optimization: algorithm and applications. Future Gener Comput Syst 97:849\u2013872. https:\/\/doi.org\/10.1016\/j.future.2019.02.028","journal-title":"Future Gener Comput Syst"},{"key":"6140_CR11","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Michigan"},{"key":"6140_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.swevo.2018.02.013","volume":"44","author":"M Jain","year":"2019","unstructured":"Jain M, Singh V, Rani A (2019) A novel nature-inspired algorithm for optimization: Squirrel search algorithm. Swarm Evol Comput 44:148\u2013175. https:\/\/doi.org\/10.1016\/j.swevo.2018.02.013","journal-title":"Swarm Evol Comput"},{"key":"6140_CR13","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687\u2013697. https:\/\/doi.org\/10.1016\/j.asoc.2007.05.007","journal-title":"Appl Soft Comput"},{"key":"6140_CR14","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Neural networks, 1995. Proceedings., IEEE International Conference on, vol 4. pp 1942\u20131948"},{"key":"6140_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science (80- ) 220:671. https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science (80- )"},{"key":"6140_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.03.055","author":"S Li","year":"2020","unstructured":"Li S, Chen H, Wang M et al (2020) Slime mould algorithm: a new method for stochastic optimization. Future Gener Comput Syst. https:\/\/doi.org\/10.1016\/j.future.2020.03.055","journal-title":"Future Gener Comput Syst"},{"key":"6140_CR17","unstructured":"Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization"},{"key":"6140_CR18","doi-asserted-by":"publisher","first-page":"121164","DOI":"10.1016\/j.energy.2021.121164","volume":"234","author":"Y Liu","year":"2021","unstructured":"Liu Y, Heidari AA, Ye X et al (2021) Boosting slime mould algorithm for parameter identification of photovoltaic models. Energy 234:121164. https:\/\/doi.org\/10.1016\/j.energy.2021.121164","journal-title":"Energy"},{"key":"6140_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2017.09.010","volume":"39","author":"S Mahdavi","year":"2018","unstructured":"Mahdavi S, Rahnamayan S, Deb K (2018) Opposition based learning: a literature review. Swarm Evol Comput 39:1\u201323. https:\/\/doi.org\/10.1016\/j.swevo.2017.09.010","journal-title":"Swarm Evol Comput"},{"key":"6140_CR20","doi-asserted-by":"publisher","unstructured":"Mirjalili S, Lewis A (2016) The Whale Optimization Algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"6140_CR21","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"key":"6140_CR22","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.asoc.2015.10.039","volume":"38","author":"MK Naik","year":"2016","unstructured":"Naik MK, Panda R (2016) A novel adaptive cuckoo search algorithm for intrinsic discriminant analysis based face recognition. Appl Soft Comput 38:661\u2013675. https:\/\/doi.org\/10.1016\/j.asoc.2015.10.039","journal-title":"Appl Soft Comput"},{"key":"6140_CR23","first-page":"1","volume-title":"Computational intelligence","author":"MK Naik","year":"2020","unstructured":"Naik MK, Wunnava A, Jena B, Panda R (2020) 1. Nature-inspired optimization algorithm and benchmark functions: a literature survey. In: Bisht DCS, Ram M (eds) Computational intelligence, 3rd edn. De Gruyter, Berlin, Boston, pp 1\u201326","edition":"3"},{"key":"6140_CR24","doi-asserted-by":"publisher","first-page":"15249","DOI":"10.1007\/s00500-020-04861-4","volume":"24","author":"S Qian","year":"2020","unstructured":"Qian S, Wu H, Xu G (2020) An improved particle swarm optimization with clone selection principle for dynamic economic emission dispatch. Soft Comput 24:15249\u201315271. https:\/\/doi.org\/10.1007\/s00500-020-04861-4","journal-title":"Soft Comput"},{"key":"6140_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2011.08.006","volume":"183","author":"RV Rao","year":"2012","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2012) Teaching\u2013learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci (ny) 183:1\u201315. https:\/\/doi.org\/10.1016\/j.ins.2011.08.006","journal-title":"Inf Sci (ny)"},{"key":"6140_CR26","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci (ny) 179:2232\u20132248. https:\/\/doi.org\/10.1016\/j.ins.2009.03.004","journal-title":"Inf Sci (ny)"},{"key":"6140_CR27","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.engappai.2019.01.001","volume":"80","author":"S Shadravan","year":"2019","unstructured":"Shadravan S, Naji HR, Bardsiri VK (2019) The sailfish optimizer: a novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems. Eng Appl Artif Intell 80:20\u201334. https:\/\/doi.org\/10.1016\/j.engappai.2019.01.001","journal-title":"Eng Appl Artif Intell"},{"key":"6140_CR500","unstructured":"Talbi E-G (2009) Metaheuristics. John Wiley & Sons, Inc., Hoboken, NJ, USA"},{"key":"6140_CR28","doi-asserted-by":"crossref","unstructured":"Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC\u201906). pp 695\u2013701","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"6140_CR29","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/s42235-021-0050-y","volume":"18","author":"J Tu","year":"2021","unstructured":"Tu J, Chen H, Wang M, Gandomi AH (2021) The colony predation algorithm. J Bionic Eng 18:674\u2013710. https:\/\/doi.org\/10.1007\/s42235-021-0050-y","journal-title":"J Bionic Eng"},{"key":"6140_CR30","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12293-016-0212-3","volume":"10","author":"G-G Wang","year":"2018","unstructured":"Wang G-G (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memetic Comput 10:151\u2013164. https:\/\/doi.org\/10.1007\/s12293-016-0212-3","journal-title":"Memetic Comput"},{"key":"6140_CR31","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1007\/s00521-015-1923-y","volume":"31","author":"G-G Wang","year":"2019","unstructured":"Wang G-G, Deb S, Cui Z (2019) Monarch Butterfly Optimization. Neural Comput Appl 31:1995\u20132014. https:\/\/doi.org\/10.1007\/s00521-015-1923-y","journal-title":"Neural Comput Appl"},{"key":"6140_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"key":"6140_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.05.001","author":"A Wunnava","year":"2020","unstructured":"Wunnava A, Kumar Naik M, Panda R et al (2020a) A differential evolutionary adaptive Harris hawks optimization for two dimensional practical Masi entropy-based multilevel image thresholding. J King Saud Univ - Comput Inf Sci. https:\/\/doi.org\/10.1016\/j.jksuci.2020.05.001","journal-title":"J King Saud Univ - Comput Inf Sci"},{"key":"6140_CR34","doi-asserted-by":"publisher","first-page":"106526","DOI":"10.1016\/j.asoc.2020.106526","volume":"95","author":"A Wunnava","year":"2020","unstructured":"Wunnava A, Naik MK, Panda R et al (2020b) An adaptive Harris hawks optimization technique for two dimensional grey gradient based multilevel image thresholding. Appl Soft Comput 95:106526. https:\/\/doi.org\/10.1016\/j.asoc.2020.106526","journal-title":"Appl Soft Comput"},{"key":"6140_CR35","doi-asserted-by":"publisher","first-page":"103836","DOI":"10.1016\/j.engappai.2020.103836","volume":"94","author":"A Wunnava","year":"2020","unstructured":"Wunnava A, Naik MK, Panda R et al (2020c) A novel interdependence based multilevel thresholding technique using adaptive equilibrium optimizer. Eng Appl Artif Intell 94:103836. https:\/\/doi.org\/10.1016\/j.engappai.2020.103836","journal-title":"Eng Appl Artif Intell"},{"key":"6140_CR36","doi-asserted-by":"publisher","first-page":"114864","DOI":"10.1016\/j.eswa.2021.114864","volume":"177","author":"Y Yang","year":"2021","unstructured":"Yang Y, Chen H, Heidari AA, Gandomi AH (2021) Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts. Expert Syst Appl 177:114864. https:\/\/doi.org\/10.1016\/j.eswa.2021.114864","journal-title":"Expert Syst Appl"},{"key":"6140_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-02141-6","volume-title":"Cuckoo search and firefly algorithm","author":"X-S Yang","year":"2014","unstructured":"Yang X-S (2014) Cuckoo search and firefly algorithm: overview and analysis. In: Yang X-S (ed) Cuckoo search and firefly algorithm. Springer, New York, pp 1\u201326"},{"key":"6140_CR38","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Yong L, Guangming L (1999) Evolutionary programming made faster. Evol Comput IEEE Trans 3:82\u2013102. https:\/\/doi.org\/10.1109\/4235.771163","journal-title":"Evol Comput IEEE Trans"},{"key":"6140_CR39","doi-asserted-by":"publisher","first-page":"115082","DOI":"10.1016\/j.eswa.2021.115082","volume":"181","author":"C Yu","year":"2021","unstructured":"Yu C, Heidari AA, Xue X et al (2021) Boosting quantum rotation gate embedded slime mould algorithm. Expert Syst Appl 181:115082. https:\/\/doi.org\/10.1016\/j.eswa.2021.115082","journal-title":"Expert Syst Appl"},{"key":"6140_CR40","doi-asserted-by":"publisher","first-page":"103300","DOI":"10.1016\/j.engappai.2019.103300","volume":"87","author":"W Zhao","year":"2020","unstructured":"Zhao W, Zhang Z, Wang L (2020) Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications. Eng Appl Artif Intell 87:103300. https:\/\/doi.org\/10.1016\/j.engappai.2019.103300","journal-title":"Eng Appl Artif Intell"},{"key":"6140_CR41","doi-asserted-by":"publisher","first-page":"104427","DOI":"10.1016\/j.compbiomed.2021.104427","volume":"134","author":"S Zhao","year":"2021","unstructured":"Zhao S, Wang P, Heidari AA et al (2021) Multilevel threshold image segmentation with diffusion association slime mould algorithm and Renyi\u2019s entropy for chronic obstructive pulmonary disease. Comput Biol Med 134:104427","journal-title":"Comput Biol Med"},{"key":"6140_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-05308-6","author":"F Zhu","year":"2020","unstructured":"Zhu F, Chen D, Zou F (2020) A novel hybrid dynamic fireworks algorithm with particle swarm optimization. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-020-05308-6","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06140-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06140-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06140-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T11:34:39Z","timestamp":1634902479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06140-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":43,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["6140"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06140-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,23]]},"assertion":[{"value":"9 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2021","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 declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}