WOA: Wombat Optimization Algorithm for Solving Supply Chain Optimization Problems

Author:

Benmamoun Zoubida1ORCID,Khlie Khaoula2,Dehghani Mohammad3ORCID,Gherabi Youness4ORCID

Affiliation:

1. Faculty of Engineering, Liwa College, Abu Dhabi 41009, United Arab Emirates

2. Faculty of Business, Liwa College, Abu Dhabi 41009, United Arab Emirates

3. Department of Power and Control Engineering, School of Electrical and Computer Engineering, Shiraz University, Shiraz 71557-13876, Iran

4. Research Laboratory in Economics, Management, and Business Management (LAREGMA), Faculty of Economics and Management, Hassan I University, Settat 26002, Morocco

Abstract

Supply Chain (SC) Optimization is a key activity in today’s industry with the goal of increasing operational efficiency, reducing costs, and improving customer satisfaction. Traditional optimization methods often struggle to effectively use resources while handling complex and dynamic Supply chain networks. This paper introduces a novel biomimetic metaheuristic algorithm called the Wombat Optimization Algorithm (WOA) for supply chain optimization. This algorithm replicates the natural behaviors observed in wombats living in the wild, particularly focusing on their foraging tactics and evasive maneuvers towards predators. The theory of WOA is described and then mathematically modeled in two phases: (i) exploration based on the simulation of wombat movements during foraging and trying to find food and (ii) exploitation based on simulating wombat movements when diving towards nearby tunnels to defend against its predators. The effectiveness of WOA in addressing optimization challenges is assessed by handling the CEC 2017 test suite across various problem dimensions, including 10, 30, 50, and 100. The findings of the optimization indicate that WOA demonstrates a strong ability to effectively manage exploration and exploitation, and maintains a balance between them throughout the search phase to deliver optimal solutions for optimization problems. A total of twelve well-known metaheuristic algorithms are called upon to test their performance against WOA in the optimization process. The outcomes of the simulations reveal that WOA outperforms the other algorithms, achieving superior results across most benchmark functions and securing the top ranking as the most efficient optimizer. Using a Wilcoxon rank sum test statistical analysis, it has been proven that WOA outperforms other algorithms significantly. WOA is put to the test with twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems to showcase its ability to solve real-world optimization problems. The results of the simulations demonstrate that WOA excels in real-world applications by delivering superior solutions and outperforming its competitors.

Publisher

MDPI AG

Reference107 articles.

1. Benmamoun, Z., Hachimi, H., and Amine, A. (2017, January 11–13). Inventory management optimization using lean six-sigma Case of Spare parts Moroccan company. Proceedings of the International Conference on Industrial Engineering and Operations Management, Rabat, Morocco.

2. Redesigning the hospital supply chain for enhanced performance using a lean methodology;Khlie;Int. J. Ind. Eng,2013

3. Jebbor, I., Benmamoun, Z., and Hachimi, H. (2023). Optimizing Manufacturing Cycles to Improve Production: Application in the Traditional Shipyard Industry. Processes, 11.

4. Identification of the patient requirements using lean six sigma and data mining;Khlie;Int. J. Eng.,2017

5. Sustainable-resilient-responsive supply chain with demand prediction: An interval type-2 robust programming approach;Mondal;Eng. Appl. Artif. Intell.,2024

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3