{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T16:53:51Z","timestamp":1769187231249,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T00:00:00Z","timestamp":1738627200000},"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":["Appl Intell"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10489-025-06320-9","type":"journal-article","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T03:08:15Z","timestamp":1738638495000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Chaotic opposition-based plant propagation algorithm for engineering problem"],"prefix":"10.1007","volume":"55","author":[{"given":"Alfe","family":"Suny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maimuna Akter","family":"Liza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md.","family":"Fahim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4321-5880","authenticated-orcid":false,"given":"Ahmed Wasif","family":"Reza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nazmul","family":"Siddique","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,4]]},"reference":[{"key":"6320_CR1","unstructured":"Salhi A, Fraga E (2011) Nature-inspired optimisation approaches and the new plant propagation algorithm. In: Proceedings of the international conference on numerical analysis and optimization (ICeMATH \u201911), Yogyakarta, Indonesia, pp 2\u2013128"},{"key":"6320_CR2","doi-asserted-by":"crossref","unstructured":"Sulaiman M, Salhi A, Fraga ES, Mashwani WK, Rashidi MM (2015) A novel plant propagation algorithm: modifications and implementations. Sci Int 28(1)","DOI":"10.1155\/2015\/904364"},{"key":"6320_CR3","doi-asserted-by":"publisher","first-page":"627416","DOI":"10.1155\/2014\/627416","volume":"2014","author":"M Sulaiman","year":"2014","unstructured":"Sulaiman M, Salhi A, Selamoglu BI, Kirikchi OB (2014) A plant propagation algorithm for constrained engineering optimisation problems. Math Probl Eng 2014:627416\u201310. https:\/\/doi.org\/10.1155\/2014\/627416","journal-title":"Math Probl Eng"},{"key":"6320_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1051\/ro\/2017037","volume":"52","author":"N Brahimi","year":"2018","unstructured":"Brahimi N, Salhi A, Ourbih-Tari M (2018) Convergence of the plant propagation algorithm for continuous global optimisation. RAIRO Oper Res 52:429\u2013438","journal-title":"RAIRO Oper Res"},{"key":"6320_CR5","doi-asserted-by":"publisher","unstructured":"Selamo\u011flu B\u0130, Salhi A (2016) In: Yang X-S (ed) The plant propagation algorithm for discrete optimisation: the case of the travelling salesman problem. Springer, Cham, pp 43\u201361. https:\/\/doi.org\/10.1007\/978-3-319-30235-5_3","DOI":"10.1007\/978-3-319-30235-5_3"},{"key":"6320_CR6","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.asoc.2015.04.048","volume":"33","author":"F Merrikh-Bayat","year":"2015","unstructured":"Merrikh-Bayat F (2015) The runner-root algorithm: a metaheuristic for solving unimodal and multimodal optimization problems inspired by runners and roots of plants in nature. Appl Soft Comput 33:292\u2013303","journal-title":"Appl Soft Comput"},{"key":"6320_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.asoc.2016.12.018","volume":"52","author":"TT Nguyen","year":"2017","unstructured":"Nguyen TT, Nguyen TT, Truong AV, Nguyen QT, Phung TA (2017) Multi-objective electric distribution network reconfiguration solution using runner-root algorithm. Appl Soft Comput 52:93\u2013108","journal-title":"Appl Soft Comput"},{"key":"6320_CR8","doi-asserted-by":"publisher","unstructured":"Merrikh-Bayat F (2014) A numerical optimization algorithm inspired by the strawberry plant. ArXiv (Cornell University). https:\/\/doi.org\/10.48550\/arxiv.1407.7399","DOI":"10.48550\/arxiv.1407.7399"},{"key":"6320_CR9","doi-asserted-by":"crossref","unstructured":"Sulaiman M, Salhi A, Fraga ES (2014) The plant propagation algorithm: Modifications and implementation. Optimization and Control. https:\/\/doi.org\/10.48550\/arXiv.1412.4290","DOI":"10.1155\/2014\/627416"},{"issue":"3","key":"6320_CR10","doi-asserted-by":"publisher","first-page":"556","DOI":"10.2514\/2.1984","volume":"41","author":"T Ray","year":"2003","unstructured":"Ray T (2003) Golinski\u2019s speed reducer problem revisited. AIAA J 41(3):556\u2013558","journal-title":"AIAA J"},{"key":"6320_CR11","doi-asserted-by":"crossref","unstructured":"Asvini MS, Amudha T (2016) An efficient methodology for reservoir release optimization using plant propagation algorithm. In: Procedia computer science, vol 93, pp 1061\u20131069","DOI":"10.1016\/j.procs.2016.07.310"},{"key":"6320_CR12","unstructured":"Sulaiman M (2017) A nature-inspired metaheuristic: the plant propagation algorithm. PhD thesis, Department of Mathematical Sciences, University of Essex"},{"key":"6320_CR13","unstructured":"Selamoglu BI (2017) The plant propagation algorithm for discrete optimisation. Phd thesis, Department of Mathematical Sciences, University of Essex"},{"key":"6320_CR14","doi-asserted-by":"publisher","unstructured":"Nag S (2017) Adaptive plant propagation algorithm for solving economic load dispatch problem. ArXiv. https:\/\/doi.org\/10.17605\/OSF.IO\/SH8P4","DOI":"10.17605\/OSF.IO\/SH8P4"},{"issue":"2","key":"6320_CR15","first-page":"223","volume":"39","author":"M Sulaiman","year":"2020","unstructured":"Sulaiman M, Hamdi A, Hussain Z (2020) The plant propagation algorithm for the optimal operation of directional over-current relays in electrical engineering. Electr Eng 39(2):223\u2013236","journal-title":"Electr Eng"},{"key":"6320_CR16","unstructured":"Knuth D (1997) The art of computer programming, vol 2: seminumerical algorithms, 3rd edn. Edison Wesley, Reading, Massachusetts. Chap. 3: Random Numbers"},{"key":"6320_CR17","volume-title":"Chaos and nonlinear dynamics: an introduction for scientists and engineers","author":"RC Hilborn","year":"2004","unstructured":"Hilborn RC (2004) Chaos and nonlinear dynamics: an introduction for scientists and engineers, 2nd edn. Oxford Univ. Press, New York","edition":"2"},{"issue":"2","key":"6320_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1175\/1520-0469(1963)020<0130:DNF>2.0.CO;2","volume":"20","author":"EN Lorenz","year":"1963","unstructured":"Lorenz EN (1963) Deterministic nonperiodic flow. J Atmos Sci 20(2):130\u2013141","journal-title":"J Atmos Sci"},{"key":"6320_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4740-9","volume-title":"Chaos and fractals","author":"H Peitgen","year":"1992","unstructured":"Peitgen H, Jurgens H, Saupe D (1992) Chaos and fractals. Springer, Berlin, Germany"},{"issue":"4","key":"6320_CR20","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1631\/jzus.2006.A0539","volume":"7","author":"HJ Lu","year":"2006","unstructured":"Lu HJ, Zhang HM, Ma LH (2006) A new optimization algorithm based on chaos. J Zhejiang Univ Sci A 7(4):539\u2013542","journal-title":"J Zhejiang Univ Sci A"},{"issue":"4","key":"6320_CR21","first-page":"617","volume":"3","author":"R Sheikholeslami","year":"2013","unstructured":"Sheikholeslami R, Kaveh A (2013) A survey of chaos embedded meta-heuristic algorithms. Int J Optim Civil Eng 3(4):617\u2013633","journal-title":"Int J Optim Civil Eng"},{"key":"6320_CR22","doi-asserted-by":"crossref","unstructured":"Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Proceedings of international conference on computational intelligence for modelling control and automation, CIMCA\u20192005, vol I. Vienna, Austria, pp 695\u2013701","DOI":"10.1109\/CIMCA.2005.1631345"},{"key":"6320_CR23","unstructured":"Shokri M, Tizhoosh HR, Kamel M (2006) Opposition-based q($$\\lambda $$) algorithm. In: Proceedings of IEEE international joint conference on neural networks part of IEEE world congress on computational intelligence, Vancouver, Canada pp. 646\u2013653"},{"issue":"5","key":"6320_CR24","doi-asserted-by":"publisher","first-page":"578","DOI":"10.20965\/jaciii.2006.p0578","volume":"10","author":"HR Tizhoosh","year":"2006","unstructured":"Tizhoosh HR (2006) Opposition-based reinforcement learning. J Adv Comput Intell Intell Inform 10(5):578\u2013585","journal-title":"J Adv Comput Intell Intell Inform"},{"key":"6320_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2013.12.004","volume":"29","author":"Q Xu","year":"2014","unstructured":"Xu Q, Wang L, Wang N, Hei X, Zhao L (2014) A review of opposition-based learning from 2005 to 2012. Eng Appl Artif Intell 29:1\u201312. https:\/\/doi.org\/10.1016\/j.engappai.2013.12.004","journal-title":"Eng Appl Artif Intell"},{"issue":"10","key":"6320_CR26","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1016\/j.camwa.2006.07.013","volume":"53","author":"S Rahnamayan","year":"2007","unstructured":"Rahnamayan S, Tizhoosh HR, Salama MMA (2007) A novel population initialisation method for accelerating evolutionary algorithms. Comput Math Appl 53(10):1605\u20131614","journal-title":"Comput Math Appl"},{"issue":"2","key":"6320_CR27","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1016\/j.asoc.2007.07.010","volume":"8","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition versus randomness in soft computing techniques. Appl Soft Comput 8(2):906\u2013918","journal-title":"Appl Soft Comput"},{"key":"6320_CR28","first-page":"1076","volume":"187","author":"MS Tavazoei","year":"2007","unstructured":"Tavazoei MS, Haeri M (2007) Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithms. Appl Math Comput 187:1076\u20131085","journal-title":"Appl Math Comput"},{"key":"6320_CR29","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1016\/j.eswa.2007.02.002","volume":"34","author":"L Coelho","year":"2008","unstructured":"Coelho L, Mariani VC (2008) Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization. Expert Syst Appl 34:1905\u20131913","journal-title":"Expert Syst Appl"},{"key":"6320_CR30","doi-asserted-by":"publisher","DOI":"10.1201\/9780429280801","author":"R Devaney","year":"2021","unstructured":"Devaney R (2021). An introduction to chaotic dynamical systems. https:\/\/doi.org\/10.1201\/9780429280801","journal-title":"An introduction to chaotic dynamical systems"},{"key":"6320_CR31","doi-asserted-by":"publisher","unstructured":"Elaydi SN (2007) Discrete chaos: with applications in science and engineering, 2nd edn. Chapman and Hall\/CRC, Boca Raton, FL, USA. https:\/\/doi.org\/10.1201\/9781420011043","DOI":"10.1201\/9781420011043"},{"issue":"9","key":"6320_CR32","first-page":"2687","volume":"216","author":"B Alatas","year":"2010","unstructured":"Alatas B (2010) Chaotic harmony search algorithms. Appl Math Comput 216(9):2687\u20132699","journal-title":"Appl Math Comput"},{"issue":"8","key":"6320_CR33","doi-asserted-by":"publisher","first-page":"5682","DOI":"10.1016\/j.eswa.2010.02.042","volume":"37","author":"B Alatas","year":"2010","unstructured":"Alatas B (2010) Chaotic bee colony algorithms for global numerical optimization. Expert Syst Appl 37(8):5682\u20135687","journal-title":"Expert Syst Appl"},{"issue":"2","key":"6320_CR34","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.cnsns.2012.07.017","volume":"18","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yun GJ, Yang XS, Talatahari S (2013) Chaos-enhanced accelerated particle swarm optimization. Commun Nonlinear Sci Numer Simul 18(2):327\u2013340","journal-title":"Commun Nonlinear Sci Numer Simul"},{"issue":"4","key":"6320_CR35","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.chaos.2003.12.032","volume":"21","author":"J Mingjun","year":"2004","unstructured":"Mingjun J, Huanwen T (2004) Application of chaos in simulated annealing. Chaos, Solitons & Fractals 21(4):933\u2013941","journal-title":"Chaos, Solitons & Fractals"},{"key":"6320_CR36","doi-asserted-by":"publisher","DOI":"10.1201\/9781315118628","volume-title":"Nature-inspired computing: physics and chemistry based algorithms","author":"N Siddique","year":"2017","unstructured":"Siddique N, Adeli H (2017) Nature-inspired computing: physics and chemistry based algorithms. CRC Press, Boca Raton, London, New York"},{"key":"6320_CR37","unstructured":"Erramilli A, Singh RP, Pruthi P (1994) Modeling packet traffic with chaotic maps. In: Royal institute of technology, Stockholm-Kista, Sweden"},{"key":"6320_CR38","doi-asserted-by":"publisher","unstructured":"Tomida AG (2008) Matlab toolbox and gui for analyzing one-dimensional chaotic maps. In: 2008 International conference on computational sciences and its applications, pp 321\u2013330 . https:\/\/doi.org\/10.1109\/ICCSA.2008.7","DOI":"10.1109\/ICCSA.2008.7"},{"key":"6320_CR39","doi-asserted-by":"crossref","unstructured":"Li Y, Deng S, Xiao D (2011) A novel hash algorithm construction based on chaotic neural network. Neural Comput Appl 20:133\u2013141","DOI":"10.1007\/s00521-010-0432-2"},{"key":"6320_CR40","first-page":"180","volume":"9","author":"D David","year":"2018","unstructured":"David D, Stephen SEA (2018) Cost minimization of welded beam design problem using nontraditional optimization through matlab and validation through ansys simulation. Int J Mech Eng Technol 9:180\u2013192","journal-title":"Int J Mech Eng Technol"},{"key":"6320_CR41","unstructured":"Y\u00fccel M, Nigdeli SM, Bekda\u015f G (2019) Estimation model for generation optimization of design variables for i-beam vertical deflection minimization. In: IV. Eurasian Conference on Civil and Environmental Engineering (ECOCEE), Istanbul, Turkey"},{"key":"6320_CR42","doi-asserted-by":"publisher","unstructured":"Shen H, Zhu Y, Niu B, Wu QH (2009) An improved group search optimizer for mechanical design optimization problems. Prog Nat Sci 19(1):91\u201397. https:\/\/doi.org\/10.1016\/j.pnsc.2008.06.007","DOI":"10.1016\/j.pnsc.2008.06.007"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06320-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06320-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06320-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T04:37:28Z","timestamp":1757133448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06320-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,4]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["6320"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06320-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,4]]},"assertion":[{"value":"28 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that the authors have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"404"}}