Skip to main content
Springer Nature Link
Log in

Chaotic opposition-based plant propagation algorithm for engineering problem

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The Plant Propagation Algorithm (PPA), often exemplified by the Strawberry Algorithm, has demonstrated its effectiveness in solving lower-dimensional optimization problems as a neighborhood search algorithm. While multiple enhancements have been introduced to boost its performance, PPA remains a population-based metaheuristic algorithm. A key element of PPA involves balancing exploration and exploitation, akin to a strawberry plant seeking the best survival strategy. This paper delves into the integration of chaotic numbers and opposition theory in PPA, focusing on how these additions impact its efficiency. The primary research questions revolve around enhancing PPA’s performance and reducing its search space to expedite the algorithm, ultimately leading to faster overall results. Experiments were carried out on three challenging engineering problems: the Pressure Vessel Optimization, the Spring Design Optimization, and the Welded Beam Problem, to fully assess the effectiveness of the improved PPA. The effectiveness of the original PPA, the Chaotic Opposition-Based PPA (COPPA), and several other metaheuristic algorithms were examined in each of these problems. In terms of efficiency and solution quality, the findings consistently demonstrate that COPPA performs better than the traditional PPA and other algorithms. The results indicate that using chaotic-based oppositional processes decreases the search space and enhances performance, resulting in faster and more resource-efficient optimization. The investigation reveals that incorporating chaotic-based oppositional PPA yields improved results while conserving resources and accelerating execution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data Availability

The manuscript has no associated data.

References

  1. 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 ’11), Yogyakarta, Indonesia, pp 2–128

  2. Sulaiman M, Salhi A, Fraga ES, Mashwani WK, Rashidi MM (2015) A novel plant propagation algorithm: modifications and implementations. Sci Int 28(1)

  3. Sulaiman M, Salhi A, Selamoglu BI, Kirikchi OB (2014) A plant propagation algorithm for constrained engineering optimisation problems. Math Probl Eng 2014:627416–10. https://doi.org/10.1155/2014/627416

    Article  Google Scholar 

  4. Brahimi N, Salhi A, Ourbih-Tari M (2018) Convergence of the plant propagation algorithm for continuous global optimisation. RAIRO Oper Res 52:429–438

    Article  MathSciNet  MATH  Google Scholar 

  5. Selamoğlu Bİ, 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–61. https://doi.org/10.1007/978-3-319-30235-5_3

  6. 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–303

    Article  MATH  Google Scholar 

  7. 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–108

    Article  MATH  Google Scholar 

  8. Merrikh-Bayat F (2014) A numerical optimization algorithm inspired by the strawberry plant. ArXiv (Cornell University). https://doi.org/10.48550/arxiv.1407.7399

  9. 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

  10. Ray T (2003) Golinski’s speed reducer problem revisited. AIAA J 41(3):556–558

    Article  MATH  Google Scholar 

  11. Asvini MS, Amudha T (2016) An efficient methodology for reservoir release optimization using plant propagation algorithm. In: Procedia computer science, vol 93, pp 1061–1069

  12. Sulaiman M (2017) A nature-inspired metaheuristic: the plant propagation algorithm. PhD thesis, Department of Mathematical Sciences, University of Essex

  13. Selamoglu BI (2017) The plant propagation algorithm for discrete optimisation. Phd thesis, Department of Mathematical Sciences, University of Essex

  14. Nag S (2017) Adaptive plant propagation algorithm for solving economic load dispatch problem. ArXiv. https://doi.org/10.17605/OSF.IO/SH8P4

  15. 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–236

    MATH  Google Scholar 

  16. Knuth D (1997) The art of computer programming, vol 2: seminumerical algorithms, 3rd edn. Edison Wesley, Reading, Massachusetts. Chap. 3: Random Numbers

  17. Hilborn RC (2004) Chaos and nonlinear dynamics: an introduction for scientists and engineers, 2nd edn. Oxford Univ. Press, New York

    MATH  Google Scholar 

  18. Lorenz EN (1963) Deterministic nonperiodic flow. J Atmos Sci 20(2):130–141

    Article  MathSciNet  MATH  Google Scholar 

  19. Peitgen H, Jurgens H, Saupe D (1992) Chaos and fractals. Springer, Berlin, Germany

    Book  MATH  Google Scholar 

  20. Lu HJ, Zhang HM, Ma LH (2006) A new optimization algorithm based on chaos. J Zhejiang Univ Sci A 7(4):539–542

    Article  MATH  Google Scholar 

  21. Sheikholeslami R, Kaveh A (2013) A survey of chaos embedded meta-heuristic algorithms. Int J Optim Civil Eng 3(4):617–633

    MATH  Google Scholar 

  22. 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’2005, vol I. Vienna, Austria, pp 695–701

  23. 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–653

  24. Tizhoosh HR (2006) Opposition-based reinforcement learning. J Adv Comput Intell Intell Inform 10(5):578–585

    Article  MATH  Google Scholar 

  25. 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–12. https://doi.org/10.1016/j.engappai.2013.12.004

    Article  MATH  Google Scholar 

  26. Rahnamayan S, Tizhoosh HR, Salama MMA (2007) A novel population initialisation method for accelerating evolutionary algorithms. Comput Math Appl 53(10):1605–1614

    Article  MathSciNet  MATH  Google Scholar 

  27. Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition versus randomness in soft computing techniques. Appl Soft Comput 8(2):906–918

    Article  MATH  Google Scholar 

  28. Tavazoei MS, Haeri M (2007) Comparison of different one-dimensional maps as chaotic search pattern in chaos optimization algorithms. Appl Math Comput 187:1076–1085

    MathSciNet  MATH  Google Scholar 

  29. Coelho L, Mariani VC (2008) Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization. Expert Syst Appl 34:1905–1913

    Article  MATH  Google Scholar 

  30. Devaney R (2021). An introduction to chaotic dynamical systems. https://doi.org/10.1201/9780429280801

    Article  Google Scholar 

  31. 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

  32. Alatas B (2010) Chaotic harmony search algorithms. Appl Math Comput 216(9):2687–2699

    MATH  Google Scholar 

  33. Alatas B (2010) Chaotic bee colony algorithms for global numerical optimization. Expert Syst Appl 37(8):5682–5687

    Article  MATH  Google Scholar 

  34. Gandomi AH, Yun GJ, Yang XS, Talatahari S (2013) Chaos-enhanced accelerated particle swarm optimization. Commun Nonlinear Sci Numer Simul 18(2):327–340

    Article  MathSciNet  MATH  Google Scholar 

  35. Mingjun J, Huanwen T (2004) Application of chaos in simulated annealing. Chaos, Solitons & Fractals 21(4):933–941

    Article  MATH  Google Scholar 

  36. Siddique N, Adeli H (2017) Nature-inspired computing: physics and chemistry based algorithms. CRC Press, Boca Raton, London, New York

    Book  MATH  Google Scholar 

  37. Erramilli A, Singh RP, Pruthi P (1994) Modeling packet traffic with chaotic maps. In: Royal institute of technology, Stockholm-Kista, Sweden

  38. 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–330 . https://doi.org/10.1109/ICCSA.2008.7

  39. Li Y, Deng S, Xiao D (2011) A novel hash algorithm construction based on chaotic neural network. Neural Comput Appl 20:133–141

  40. 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–192

    MATH  Google Scholar 

  41. Yücel M, Nigdeli SM, Bekdaş 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

  42. 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–97. https://doi.org/10.1016/j.pnsc.2008.06.007

Download references

Funding

No funding was received.

Author information

Author notes

  1. Alfe Suny, Maimuna Akter Liza, Ahmed Wasif Reza, and Nazmul Siddique contributed equally to this work.

Authors and Affiliations

  1. Department of Computer Science and Engineering, East West University, Dhaka, 1212, Bangladesh

    Alfe Suny, Maimuna Akter Liza, Md. Fahim & Ahmed Wasif Reza

  2. School of Computing, Engineering and Intelligent Systems, Ulster University, Coleraine, UK

    Nazmul Siddique

Authors
  1. Alfe Suny
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Maimuna Akter Liza
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Md. Fahim
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Ahmed Wasif Reza
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Nazmul Siddique
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

All authors contributed equally in terms of Visualization, Validation, Software, Methodology, Investigation, Formal analysis, Conceptualization, Data Curation, Writing - original draft, Writing - review & editing.

Corresponding author

Correspondence to Ahmed Wasif Reza.

Ethics declarations

Competing Interests

We declare that the authors have no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Suny, A., Liza, M.A., Fahim, M. et al. Chaotic opposition-based plant propagation algorithm for engineering problem. Appl Intell 55, 404 (2025). https://doi.org/10.1007/s10489-025-06320-9

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10489-025-06320-9

Keywords