IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i22p3464-d1515340.html
   My bibliography  Save this article

Mechanical and Civil Engineering Optimization with a Very Simple Hybrid Grey Wolf—JAYA Metaheuristic Optimizer

Author

Listed:
  • Chiara Furio

    (Department of Mechanics, Mathematics and Management, Polytechnic University of Bari, Via Edoardo Orabona, 4, 70125 Bari, Italy)

  • Luciano Lamberti

    (Department of Mechanics, Mathematics and Management, Polytechnic University of Bari, Via Edoardo Orabona, 4, 70125 Bari, Italy)

  • Catalin I. Pruncu

    (School of Engineering and the Built Environment, Buckinghamshire New University, 59 Walton Street, Aylesbury HP21 7OG, UK)

Abstract

Metaheuristic algorithms (MAs) now are the standard in engineering optimization. Progress in computing power has favored the development of new MAs and improved versions of existing methods and hybrid MAs. However, most MAs (especially hybrid algorithms) have very complicated formulations. The present study demonstrated that it is possible to build a very simple hybrid metaheuristic algorithm combining basic versions of classical MAs, and including very simple modifications in the optimization formulation to maximize computational efficiency. The very simple hybrid metaheuristic algorithm (SHGWJA) developed here combines two classical optimization methods, namely the grey wolf optimizer (GWO) and JAYA, that are widely used in engineering problems and continue to attract the attention of the scientific community. SHGWJA overcame the limitations of GWO and JAYA in the exploitation phase using simple elitist strategies. The proposed SHGWJA was tested very successfully in seven “real-world” engineering optimization problems taken from various fields, such as civil engineering, aeronautical engineering, mechanical engineering (included in the CEC 2020 test suite on real-world constrained optimization problems) and robotics; these problems include up to 14 optimization variables and 721 nonlinear constraints. Two representative mathematical optimization problems (i.e., Rosenbrock and Rastrigin functions) including up to 1000 variables were also solved. Remarkably, SHGWJA always outperformed or was very competitive with other state-of-the-art MAs, including CEC competition winners and high-performance methods in all test cases. In fact, SHGWJA always found the global optimum or a best cost at most 0.0121% larger than the target optimum. Furthermore, SHGWJA was very robust: (i) in most cases, SHGWJA obtained a 0 or near-0 standard deviation and all optimization runs practically converged to the target optimum solution; (ii) standard deviation on optimized cost was at most 0.0876% of the best design; (iii) the standard deviation on function evaluations was at most 35% of the average computational cost. Last, SHGWJA always ranked 1st or 2nd for average computational speed and its fastest optimization runs outperformed or were highly competitive with their counterpart recorded for the best MAs.

Suggested Citation

  • Chiara Furio & Luciano Lamberti & Catalin I. Pruncu, 2024. "Mechanical and Civil Engineering Optimization with a Very Simple Hybrid Grey Wolf—JAYA Metaheuristic Optimizer," Mathematics, MDPI, vol. 12(22), pages 1-68, November.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:22:p:3464-:d:1515340
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/22/3464/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/22/3464/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Y.C. Ho & D.L. Pepyne, 2002. "Simple Explanation of the No-Free-Lunch Theorem and Its Implications," Journal of Optimization Theory and Applications, Springer, vol. 115(3), pages 549-570, December.
    2. E. Bonabeau & M. Dorigo & G. Theraulaz, 2000. "Inspiration for optimization from social insect behaviour," Nature, Nature, vol. 406(6791), pages 39-42, July.
    3. Guo, Jihong & Liu, Chao & Cao, Jinfeng & Jiang, Dongxiang, 2021. "Damage identification of wind turbine blades with deep convolutional neural networks," Renewable Energy, Elsevier, vol. 174(C), pages 122-133.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xinbiao Wang & Yuxuan Du & Zhuozhuo Tu & Yong Luo & Xiao Yuan & Dacheng Tao, 2024. "Transition role of entangled data in quantum machine learning," Nature Communications, Nature, vol. 15(1), pages 1-8, December.
    2. Liying Xu & Jiadi Zhu & Bing Chen & Zhen Yang & Keqin Liu & Bingjie Dang & Teng Zhang & Yuchao Yang & Ru Huang, 2022. "A distributed nanocluster based multi-agent evolutionary network," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    3. Sun, Shilin & Wang, Tianyang & Chu, Fulei, 2022. "In-situ condition monitoring of wind turbine blades: A critical and systematic review of techniques, challenges, and futures," Renewable and Sustainable Energy Reviews, Elsevier, vol. 160(C).
    4. Xiaoqing Zhao & Qifa Yue & Jianchao Pei & Junwei Pu & Pei Huang & Qian Wang, 2021. "Ecological Security Pattern Construction in Karst Area Based on Ant Algorithm," IJERPH, MDPI, vol. 18(13), pages 1-21, June.
    5. Modiri-Delshad, Mostafa & Aghay Kaboli, S. Hr. & Taslimi-Renani, Ehsan & Rahim, Nasrudin Abd, 2016. "Backtracking search algorithm for solving economic dispatch problems with valve-point effects and multiple fuel options," Energy, Elsevier, vol. 116(P1), pages 637-649.
    6. Gao, Shangce & Wang, Yirui & Cheng, Jiujun & Inazumi, Yasuhiro & Tang, Zheng, 2016. "Ant colony optimization with clustering for solving the dynamic location routing problem," Applied Mathematics and Computation, Elsevier, vol. 285(C), pages 149-173.
    7. Scianna, Marco, 2024. "The AddACO: A bio-inspired modified version of the ant colony optimization algorithm to solve travel salesman problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 218(C), pages 357-382.
    8. Marcelo Becerra-Rozas & José Lemus-Romani & Felipe Cisternas-Caneo & Broderick Crawford & Ricardo Soto & Gino Astorga & Carlos Castro & José García, 2022. "Continuous Metaheuristics for Binary Optimization Problems: An Updated Systematic Literature Review," Mathematics, MDPI, vol. 11(1), pages 1-32, December.
    9. Carsten Gottschlich & Dominic Schuhmacher, 2014. "The Shortlist Method for Fast Computation of the Earth Mover's Distance and Finding Optimal Solutions to Transportation Problems," PLOS ONE, Public Library of Science, vol. 9(10), pages 1-10, October.
    10. R. Montemanni & L. M. Gambardella & A. E. Rizzoli & A. V. Donati, 2005. "Ant Colony System for a Dynamic Vehicle Routing Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 327-343, December.
    11. Hegazy Rezk & Abdul Ghani Olabi & Rania M. Ghoniem & Mohammad Ali Abdelkareem, 2023. "Optimized Fractional Maximum Power Point Tracking Using Bald Eagle Search for Thermoelectric Generation System," Energies, MDPI, vol. 16(10), pages 1-15, May.
    12. Deb, Sanchari & Gao, Xiao-Zhi & Tammi, Kari & Kalita, Karuna & Mahanta, Pinakeswar, 2021. "A novel chicken swarm and teaching learning based algorithm for electric vehicle charging station placement problem," Energy, Elsevier, vol. 220(C).
    13. Hernán Peraza-Vázquez & Adrián Peña-Delgado & Prakash Ranjan & Chetan Barde & Arvind Choubey & Ana Beatriz Morales-Cepeda, 2021. "A Bio-Inspired Method for Mathematical Optimization Inspired by Arachnida Salticidade," Mathematics, MDPI, vol. 10(1), pages 1-32, December.
    14. Luo, Hao & Du, Bing & Huang, George Q. & Chen, Huaping & Li, Xiaolin, 2013. "Hybrid flow shop scheduling considering machine electricity consumption cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 423-439.
    15. Zekharya Danin & Abhishek Sharma & Moshe Averbukh & Arabinda Meher, 2022. "Improved Moth Flame Optimization Approach for Parameter Estimation of Induction Motor," Energies, MDPI, vol. 15(23), pages 1-13, November.
    16. Felipe Cisternas-Caneo & Broderick Crawford & Ricardo Soto & Giovanni Giachetti & Álex Paz & Alvaro Peña Fritz, 2024. "Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics," Mathematics, MDPI, vol. 12(2), pages 1-39, January.
    17. Zengyi Zhang & Zhenru Shu, 2024. "Unmanned Aerial Vehicle (UAV)-Assisted Damage Detection of Wind Turbine Blades: A Review," Energies, MDPI, vol. 17(15), pages 1-31, July.
    18. Alaa A. K. Ismaeel & Essam H. Houssein & Doaa Sami Khafaga & Eman Abdullah Aldakheel & Ahmed S. AbdElrazek & Mokhtar Said, 2023. "Performance of Osprey Optimization Algorithm for Solving Economic Load Dispatch Problem," Mathematics, MDPI, vol. 11(19), pages 1-19, September.
    19. Kottath, Rahul & Singh, Priyanka, 2023. "Influencer buddy optimization: Algorithm and its application to electricity load and price forecasting problem," Energy, Elsevier, vol. 263(PC).
    20. Mokhtar Said & Ali M. El-Rifaie & Mohamed A. Tolba & Essam H. Houssein & Sanchari Deb, 2021. "An Efficient Chameleon Swarm Algorithm for Economic Load Dispatch Problem," Mathematics, MDPI, vol. 9(21), pages 1-14, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:22:p:3464-:d:1515340. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.