IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v212y2023icp195-223.html
   My bibliography  Save this article

A novel improved chef-based optimization algorithm with Gaussian random walk-based diffusion process for global optimization and engineering problems

Author

Listed:
  • Kutlu Onay, Funda

Abstract

The chef-based optimization algorithm (CBOA) is a human-based method inspired by the relationship between culinary students and chef instructors. The original CBOA does not have a process that separately controls population generation and updating. For this reason, in this study, a novel improved CBOA with diffusion process (DP) algorithm with the Gaussian walk (CBOADP) is proposed. In this way, it is aimed to transfer promising members to the next iteration. In the original CBOA algorithm, the selection of the chefs is performed randomly. The oppositional-based learning (OBL) approach aims to find the current best chef by updating the chef from the chef candidates selected from opposite regions. Because the selection of the chef plays an important role in the selection of students. To develop the method with optimal parameters, parameter analysis is performed as the DP’s walk and maximum diffusion parameters. The new method’s performance is evaluated through the CEC2019 and CEC2022 test suites and traditional and advanced methods. Results for real design problems are also reported. All results are supported by the Wilcoxon sign and Friedman rank statistical tests. As a result, in general, the best convergence has been achieved with CBOADP in about 75% of the benchmark test data, and statistically, it has first rank among other methods on average. In addition, CBOADP reached the best fitness value in five of the six compared engineering problems. Accordingly, it is seen that DP and OBL approaches contribute positively to the performance of CBOA and show a successful convergence trend among other compared methods.

Suggested Citation

  • Kutlu Onay, Funda, 2023. "A novel improved chef-based optimization algorithm with Gaussian random walk-based diffusion process for global optimization and engineering problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 212(C), pages 195-223.
    • Handle: RePEc:eee:matcom:v:212:y:2023:i:c:p:195-223
    DOI: 10.1016/j.matcom.2023.04.027
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475423001957
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2023.04.027?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pan, Jeng-Shyang & Zhang, Li-Gang & Wang, Ruo-Bin & Snášel, Václav & Chu, Shu-Chuan, 2022. "Gannet optimization algorithm : A new metaheuristic algorithm for solving engineering optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 202(C), pages 343-373.
    2. Hashim, Fatma A. & Houssein, Essam H. & Hussain, Kashif & Mabrouk, Mai S. & Al-Atabany, Walid, 2022. "Honey Badger Algorithm: New metaheuristic algorithm for solving optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 192(C), pages 84-110.
    3. Farid Saberi-Movahed & Mohammad Najafzadeh & Adel Mehrpooya, 2020. "Receiving More Accurate Predictions for Longitudinal Dispersion Coefficients in Water Pipelines: Training Group Method of Data Handling Using Extreme Learning Machine Conceptions," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 34(2), pages 529-561, January.
    4. Kutlu Onay, Funda & Aydemı̇r, Salih Berkan, 2022. "Chaotic hunger games search optimization algorithm for global optimization and engineering problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 192(C), pages 514-536.
    5. 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.
    6. Lina Zhang & Liqiang Liu & Xin-She Yang & Yuntao Dai, 2016. "A Novel Hybrid Firefly Algorithm for Global Optimization," PLOS ONE, Public Library of Science, vol. 11(9), pages 1-17, September.
    7. Örnek, Bülent Nafi & Aydemir, Salih Berkan & Düzenli, Timur & Özak, Bilal, 2022. "A novel version of slime mould algorithm for global optimization and real world engineering problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 198(C), pages 253-288.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xing, Aosheng & Chen, Yong & Suo, Jinyi & Zhang, Jie, 2024. "Improving teaching-learning-based optimization algorithm with golden-sine and multi-population for global optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 221(C), pages 94-134.
    2. Pan, Jeng-Shyang & Zhang, Zhen & Chu, Shu-Chuan & Zhang, Si-Qi & Wu, Jimmy Ming-Tai, 2024. "A parallel compact Marine Predators Algorithm applied in time series prediction of Backpropagation neural network (BNN) and engineering optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 220(C), pages 65-88.

    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. Kaveh, Mehrdad & Mesgari, Mohammad Saadi & Saeidian, Bahram, 2023. "Orchard Algorithm (OA): A new meta-heuristic algorithm for solving discrete and continuous optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 208(C), pages 95-135.
    2. Pan, Jeng-Shyang & Zhang, Zhen & Chu, Shu-Chuan & Zhang, Si-Qi & Wu, Jimmy Ming-Tai, 2024. "A parallel compact Marine Predators Algorithm applied in time series prediction of Backpropagation neural network (BNN) and engineering optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 220(C), pages 65-88.
    3. Essam H. Houssein & Awny Sayed, 2023. "Dynamic Candidate Solution Boosted Beluga Whale Optimization Algorithm for Biomedical Classification," Mathematics, MDPI, vol. 11(3), pages 1-27, January.
    4. Zhang, Ziyuan & Wang, Jianzhou & Wei, Danxiang & Luo, Tianrui & Xia, Yurui, 2023. "A novel ensemble system for short-term wind speed forecasting based on Two-stage Attention-Based Recurrent Neural Network," Renewable Energy, Elsevier, vol. 204(C), pages 11-23.
    5. Jian Zhao & Bochen Zhang & Xiwang Guo & Liang Qi & Zhiwu Li, 2022. "Self-Adapting Spherical Search Algorithm with Differential Evolution for Global Optimization," Mathematics, MDPI, vol. 10(23), pages 1-31, November.
    6. Boudy Bilal & Kaan Yetilmezsoy & Mohammed Ouassaid, 2024. "Benchmarking of Various Flexible Soft-Computing Strategies for the Accurate Estimation of Wind Turbine Output Power," Energies, MDPI, vol. 17(3), pages 1-36, February.
    7. Hegazy Rezk & A. G. Olabi & Mohammad Ali Abdelkareem & Abdul Hai Alami & Enas Taha Sayed, 2023. "Optimal Parameter Determination of Membrane Bioreactor to Boost Biohydrogen Production-Based Integration of ANFIS Modeling and Honey Badger Algorithm," Sustainability, MDPI, vol. 15(2), pages 1-13, January.
    8. 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.
    9. Fatmah Y. Assiri & Mahmoud Ragab, 2023. "Optimal Deep-Learning-Based Cyberattack Detection in a Blockchain-Assisted IoT Environment," Mathematics, MDPI, vol. 11(19), pages 1-16, September.
    10. Ivona Brajević & Jelena Ignjatović, 2019. "An upgraded firefly algorithm with feasibility-based rules for constrained engineering optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2545-2574, August.
    11. Mohamed Abdel-Basset & Reda Mohamed & Karam M. Sallam & Ripon K. Chakrabortty, 2022. "Light Spectrum Optimizer: A Novel Physics-Inspired Metaheuristic Optimization Algorithm," Mathematics, MDPI, vol. 10(19), pages 1-63, September.
    12. Eslami, N. & Yazdani, S. & Mirzaei, M. & Hadavandi, E., 2022. "Aphid–Ant Mutualism: A novel nature-inspired​ metaheuristic algorithm for solving optimization problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 201(C), pages 362-395.
    13. Márton Gosztonyi & Csákné Filep Judit, 2022. "Profiling (Non-)Nascent Entrepreneurs in Hungary Based on Machine Learning Approaches," Sustainability, MDPI, vol. 14(6), pages 1-20, March.
    14. Mahamed G. H. Omran & Maurice Clerc & Fatme Ghaddar & Ahmad Aldabagh & Omar Tawfik, 2022. "Permutation Tests for Metaheuristic Algorithms," Mathematics, MDPI, vol. 10(13), pages 1-15, June.
    15. Muhyaddin Rawa & Abdullah Abusorrah & Yusuf Al-Turki & Martin Calasan & Mihailo Micev & Ziad M. Ali & Saad Mekhilef & Hussain Bassi & Hatem Sindi & Shady H. E. Abdel Aleem, 2022. "Estimation of Parameters of Different Equivalent Circuit Models of Solar Cells and Various Photovoltaic Modules Using Hybrid Variants of Honey Badger Algorithm and Artificial Gorilla Troops Optimizer," Mathematics, MDPI, vol. 10(7), pages 1-31, March.
    16. Ousmane Diao & P.-A. Absil & Mouhamadou Diallo, 2023. "Generalized Linear Models to Forecast Malaria Incidence in Three Endemic Regions of Senegal," IJERPH, MDPI, vol. 20(13), pages 1-27, July.
    17. Muhammad Haris Khan & Abasin Ulasyar & Abraiz Khattak & Haris Sheh Zad & Mohammad Alsharef & Ahmad Aziz Alahmadi & Nasim Ullah, 2022. "Optimal Sizing and Allocation of Distributed Generation in the Radial Power Distribution System Using Honey Badger Algorithm," Energies, MDPI, vol. 15(16), pages 1-18, August.
    18. Jeng-Shyang Pan & Li-Fa Liu & Shu-Chuan Chu & Pei-Cheng Song & Geng-Geng Liu, 2023. "A New Gaining-Sharing Knowledge Based Algorithm with Parallel Opposition-Based Learning for Internet of Vehicles," Mathematics, MDPI, vol. 11(13), pages 1-25, July.
    19. Chenyang Gao & Teng Li & Yuelin Gao & Ziyu Zhang, 2024. "A Comprehensive Multi-Strategy Enhanced Biogeography-Based Optimization Algorithm for High-Dimensional Optimization and Engineering Design Problems," Mathematics, MDPI, vol. 12(3), pages 1-35, January.
    20. Chao Zhou & Bing Gao & Haiyue Yang & Xudong Zhang & Jiaqi Liu & Lingling Li, 2022. "Junction Temperature Prediction of Insulated-Gate Bipolar Transistors in Wind Power Systems Based on an Improved Honey Badger Algorithm," Energies, MDPI, vol. 15(19), pages 1-19, October.

    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:eee:matcom:v:212:y:2023:i:c:p:195-223. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.