Search

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. [ABSTRACT FROM AUTHOR]

The Competitive Swarm Optimizer (CSO) has emerged as a prominent technique for solving intricate optimization problems by updating only half of the population in each iteration. Despite its effectiveness, the CSO algorithm often exhibits a slow convergence rate and a tendency to become trapped in local optimal solutions, as is common among metaheuristic algorithms. To address these challenges, this paper proposes a hybrid approach combining the CSO with the Salp Swarm algorithm (SSA), CL-SSA, to increase the convergence rate and enhance search space exploration. The proposed approach involves a two-step process. In the first step, a pairwise competition mechanism is introduced to segregate the solutions into winners and losers. The winning population is updated through strong exploitation using the SSA algorithm. In the second step, non-winning solutions learn from the winners, achieving a balance between exploration and exploitation. The performance of the CL-SSA is evaluated on various benchmark functions, including the CEC2017 benchmark with dimensions 50 and 100, the CEC2008lsgo benchmark with dimensions 200, 500 and 1000, as well as a set of seven well-known constrained design challenges in various engineering domains defined in the CEC2020 conference. The CL-SSA is compared to other metaheuristics and advanced algorithms, and its results are analyzed through statistical tests such as the Friedman and Wilcoxon rank-sum tests. The statistical analysis demonstrates that the CL-SSA algorithm exhibits improved exploitation, exploration, and convergence patterns compared to other algorithms, including SSA and CSO, as well as popular algorithms. Furthermore, the proposed hybrid approach performs better in solving most test functions. [ABSTRACT FROM AUTHOR]

The artificial Gorilla Troop Optimization (GTO) algorithm (GTO) is a metaheuristic optimization algorithm that simulates the social life of gorillas. This paper proposes three innovative strategies considering the GTO algorithm's insufficient convergence accuracy and low convergence speed. First, a shrinkage control factor fusion strategy is proposed to expand the search space and reduce search blindness by strengthening the communication between silverback gorillas and other gorillas to improve global optimization performance. Second, a sine cosine interaction fusion strategy based on closeness is proposed to stabilize the performance of silverback gorillas and other gorilla individuals and improve the convergence ability and speed of the algorithm. Finally, a gorilla individual difference identification strategy is proposed to reduce the difference between gorilla and silverback gorillas to improve the quality of the optimal solution. In order to verify the optimization effect of the modified artificial gorilla troop optimization (MGTO) algorithm, we used 23 classic benchmark functions, 30 CEC2014 benchmark functions, and 10 CEC2020 benchmark functions to test the performance of the proposed MGTO algorithm. In this study, we used a total of 63 functions for algorithm comparison. At the same time, we carried out the exploitation and exploration balance experiment of 30 CEC2014 and 10 CEC2020 functions for the MGTO algorithm. In addition, the MGTO algorithm was also applied to test seven practical engineering problems, and it achieved good results. [ABSTRACT FROM AUTHOR]

The sand cat swarm optimization algorithm (SCSO) is a recently proposed metaheuristic optimization algorithm. It stimulates the hunting behavior of the sand cat, which attacks or searches for prey according to the sound frequency; each sand cat aims to catch better prey. Therefore, the sand cat will search for a better location to catch better prey. In the SCSO algorithm, each sand cat will gradually approach its prey, which makes the algorithm a strong exploitation ability. However, in the later stage of the SCSO algorithm, each sand cat is prone to fall into the local optimum, making it unable to find a better position. In order to improve the mobility of the sand cat and the exploration ability of the algorithm. In this paper, a modified sand cat swarm optimization (MSCSO) algorithm is proposed. The MSCSO algorithm adds a wandering strategy. When attacking or searching for prey, the sand cat will walk to find a better position. The MSCSO algorithm with a wandering strategy enhances the mobility of the sand cat and makes the algorithm have stronger global exploration ability. After that, the lens opposition-based learning strategy is added to enhance the global property of the algorithm so that the algorithm can converge faster. To evaluate the optimization effect of the MSCSO algorithm, we used 23 standard benchmark functions and CEC2014 benchmark functions to evaluate the optimization performance of the MSCSO algorithm. In the experiment, we analyzed the data statistics, convergence curve, Wilcoxon rank sum test, and box graph. Experiments show that the MSCSO algorithm with a walking strategy and a lens position-based learning strategy had a stronger exploration ability. Finally, the MSCSO algorithm was used to test seven engineering problems, which also verified the engineering practicability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Remora Optimization Algorithm (ROA) is a recent population-based algorithm that mimics the intelligent traveler behavior of Remora. However, the performance of ROA is barely satisfactory; it may be stuck in local optimal regions or has a slow convergence, especially in high dimensional complicated problems. To overcome these limitations, this paper develops an improved version of ROA called Enhanced ROA (EROA) using three different techniques: adaptive dynamic probability, SFO with Levy flight, and restart strategy. The performance of EROA is tested using two different benchmarks and seven real-world engineering problems. The statistical analysis and experimental results show the efficiency of EROA. [ABSTRACT FROM AUTHOR]

This paper proposes a new meta-heuristic called Jumping Spider Optimization Algorithm (JSOA), inspired by Arachnida Salticidae hunting habits. The proposed algorithm mimics the behavior of spiders in nature and mathematically models its hunting strategies: search, persecution, and jumping skills to get the prey. These strategies provide a fine balance between exploitation and exploration over the solution search space and solve global optimization problems. JSOA is tested with 20 well-known testbench mathematical problems taken from the literature. Further studies include the tuning of a Proportional-Integral-Derivative (PID) controller, the Selective harmonic elimination problem, and a few real-world single objective bound-constrained numerical optimization problems taken from CEC 2020. Additionally, the JSOA's performance is tested against several well-known bio-inspired algorithms taken from the literature. The statistical results show that the proposed algorithm outperforms recent literature algorithms and is capable to solve challenging real-world problems with unknown search space. [ABSTRACT FROM AUTHOR]

Firefly-Algorithm (FA) is an eminent nature-inspired swarm-based technique for solving numerous real world global optimization problems. This paper presents an overview of the constraint handling techniques. It also includes a hybrid algorithm, namely the Stochastic Ranking with Improved Firefly Algorithm (SRIFA) for solving constrained real-world engineering optimization problems. The stochastic ranking approach is broadly used to maintain balance between penalty and fitness functions. FA is extensively used due to its faster convergence than other metaheuristic algorithms. The basic FA is modified by incorporating opposite-based learning and random-scale factor to improve the diversity and performance. Furthermore, SRIFA uses feasibility based rules to maintain balance between penalty and objective functions. SRIFA is experimented to optimize 24 CEC 2006 standard functions and five well-known engineering constrained-optimization design problems from the literature to evaluate and analyze the effectiveness of SRIFA. It can be seen that the overall computational results of SRIFA are better than those of the basic FA. Statistical outcomes of the SRIFA are significantly superior compared to the other evolutionary algorithms and engineering design problems in its performance, quality and efficiency. [ABSTRACT FROM AUTHOR]