A New Metaheuristic Approach to Solving Benchmark Problems: Hybrid Salp Swarm Jaya Algorithm

Improved salp swarm algorithm combined with chaos

This paper introduces the enhanced semisteady‐state Jaya (ESJaya) algorithm, an improved version of the semisteady‐state Jaya (SJaya) algorithm. The ESJaya algorithm uses a control coefficient to regulate the influence of the best solution, achieving a better balance between exploration and exploitation. It also features a self‐adaptive multipopulation strategy and removes absolute value operators in its update equation for improved performance. Using 20 benchmark functions, the ESJaya algorithm is compared with the traditional Jaya, SJaya, and elitism‐based self‐adaptive multipopulation Jaya (SAMPEJaya) algorithms. The ESJaya algorithm ranks first in obtaining optimum values, mean accuracy, and stability, showing better overall performance than the others. The ESJaya algorithm ranks first with an average overall rank of 1.750, followed by Jaya, SAMPEJaya, and SJaya with average overall ranks of 2.650, 2.700, and 2.900, respectively. The Wilcoxon signed‐rank test confirms the statistical significance of the overall rankings. When compared with the Snow Geese Algorithm (SGA), Big Bang–Big Crunch Algorithm (BBBCA), firefly algorithm (FA), bat algorithm (BA), cuckoo search algorithm (CSA), and flower pollination algorithm (FPA), the ESJaya algorithm gives competitive results in terms of obtaining optimum values, mean accuracy, and stability. Using four real‐world engineering problems, the ESJaya algorithm is compared with the recently proposed piranha predation optimization algorithm (PPOA) and four state‐of‐the‐art algorithms, namely, the COLSHADE algorithm, the sCMAgES algorithm, the SASS algorithm, and the EnMODE algorithm. The ESJaya algorithm finds optimum solutions with good accuracy, consistency, and stability. Overall, it has a slower convergence and longer run time due to its multipopulation strategy and its search for the best solution after each solution update. However, it consistently finds more optimal solutions than other improved algorithms.

Metaheuristic algorithms are easy, flexible and nature-inspired algorithms used to optimize functions. To make metaheuristic algorithms better, multiple algorithms are combined and hybridized. In this context, a hybrid algorithm (HSSAOA) was developed by adapting the exploration phase of the arithmetic optimization algorithm (AOA) to the position update part of the salp swarm algorithm (SSA) of the leader salps/salps. And also, there have also been a few new additions to the SSA. The proposed HSSAOA was tested in three different groups using 22 benchmark functions and compared with 7 well-known algorithms. HSSAOA optimized the best results in a total of 16 benchmark functions in each group. In addition, a statistically significant difference was obtained compared to other algorithms.

Reasonable optimal operation policy for complex multiple reservoir systems is very important for the safe and efficient utilization of water resources. The operation policy of multiple hydropower reservoirs should be optimized to maximize total hydropower generation, while ensuring flood control safety by effective and efficient storage and release policy of multiple reservoirs. To achieve this goal, a new meta-heuristic algorithm, salp swarm algorithm (SSA), is used to optimize the joint operation of multiple hydropower reservoirs for the first time. SSA is a competitive bio-inspired optimizer, which has received substantial attention from researchers in a wide variety of applications in finance, engineering, and science because of its little controlling parameters and adaptive exploratory behavior. However, it still faces few drawbacks such as lack of exploitation and local optima stagnation, leading to a slow convergence rate. In order to tackle these problems, multiple strategies combining sine cosine operator, opposition-based learning mechanism, and elitism strategy are applied to the original SSA. The sine cosine operator is applied to balance the exploration and exploitation over the course of iteration; the opposition-based learning mechanism is used to enhance the diversity of the swarm; and the elitism strategy is adopted to find global optima. Then, the improved SSA (ISSA) is compared with six well-known meta-heuristic algorithms on 23 classical benchmark functions. The results obtained demonstrate that ISSA outperforms most of the well-known algorithms. Then, ISSA is applied to optimal operation of multiple hydropower reservoirs in the real world. A multiple reservoir system, namely Xiluodu Reservoir and Xiangjiaba Rservoir, in the upper Yangtze River of China are selected as a case study. The results obtained show that the ISSA is able to solve a real-world optimization problem with complex constraints. In addition, for the typical flood with a 100 return period in 1954, the maximum hydropower generation of multiple hydropower reservoirs is about 6671 GWh in the case of completing the flood control task, increasing by 1.18% and 1.77% than SSA and Particle Swarm Optimization (PSO), respectively. Thus, ISSA can be used as an alternative effective and efficient tool for the complex optimization of multiple hydropower reservoirs. The water resources in the river basin can be further utilized by the proposed method to cope with the increasingly serious climate change.

Metaheuristic algorithms are often applied to global function optimization problems. To overcome the poor real-time performance and low precision of the basic salp swarm algorithm, this paper introduces a novel hybrid algorithm inspired by the perturbation weight mechanism. The proposed perturbation weight salp swarm algorithm has the advantages of a broad search scope and a strong balance between exploration and exploitation and retains a relatively low computational complexity when dealing with numerous large-scale problems. A new coefficient factor is introduced to the basic salp swarm algorithm, and new update strategies for the leader position and the followers are introduced in the search phase. The new leader position updating strategy has a specific bounded scope and strong search performance, thus accelerating the iteration process. The new follower updating strategy maintains the diversity of feasible solutions while reducing the computational load. This paper describes the application of the proposed algorithm to low-dimension and variable-dimension functions. This paper also presents iteration curves, box-plot charts, and search-path graphics to verify the accuracy of the proposed algorithm. The experimental results demonstrate that the perturbation weight salp swarm algorithm offers a better search speed and search balance than the basic salp swarm algorithm in different environments.

Renewable energy is an attractive solution for water pumping systems particularly in isolated regions where the utility grid is unavailable. An attempt is made to improve the performance of solar photovoltaic water pumping system (SPVWPS) under partial shading condition. Under this condition, the power versus voltage curve has more than one maximum power point (MPP), which makes the tracking of global MPP not an easy task. Two MPP tracking (MPPT) strategies are proposed and compared for tracking MPP of SPVWPS under shading condition. The first method is based on the classical perturb and observe (P&O) and the other method is based on a Salp Swarm Algorithm (SSA). Based on extensive MATLAB simulation, it is found that the SSA method can provide higher photovoltaic (PV) generated power than the P&O method under shading condition. Consequently, the pump flowrate is increased. But, under normal distribution of solar radiation, both MPPT techniques can extract the maximum power but SSA is considered a time-consuming approach. Moreover, SSA is compared with particle swarm optimization (PSO) and genetic algorithm (GA). The obtained results ensure the superiority of SSA compared with PSO and GA. SSA has high successful rate of reaching true global MPP.

As a representative of lightweight virtualization, container technology has been widely used in cloud services and edge computing applications. However, in the resource pool scenario composed by multiple intelligent terminal devices, considering the limited resources and poor stability of these devices, it is necessary to split the overall service into multiple microservices and deploy the backups of them in respective containers. Traditional container scheduling policies tend to be less effective in solving such problems. Therefore, the article used a meta-heuristic algorithm to solve this kind of problems. Based on a newly proposed salp swarm algorithm (SSA), the paper presented a comprehensive improved SSA (CISSA). CISSA improved the performance of the original SSA by 4 steps. To verify the performance of CISSA in different kinds of test functions, the algorithm was compared with 7 commonly-used meta-heuristic algorithms in 29 benchmark functions provided by the author of SSA. In addition, the article constructed three container cluster models of different sizes, all these algorithms were used to solve these redundant container deployment problems, the experimental results indicate that the CISSA is superior to other algorithms in such problems of different dimensions.

One of the most used artificial intelligence techniques for maximum power point tracking is artificial neural networks. In order to achieve successful results in maximum power point tracking, the training process of artificial neural networks is important. Metaheuristic algorithms are used extensively in the literature for neural network training. An important group of metaheuristic algorithms is swarm-intelligent-based optimization algorithms. In this study, feed-forward neural network training is carried out for maximum power point tracking by using 13 swarm-intelligent-based optimization algorithms. These algorithms are artificial bee colony, butterfly optimization, cuckoo search, chicken swarm optimization, dragonfly algorithm, firefly algorithm, grasshopper optimization algorithm, krill herd algorithm, particle swarm optimization, salp swarm algorithm, selfish herd optimizer, tunicate swarm algorithm, and tuna swarm optimization. Mean squared error is used as the error metric, and the performances of the algorithms in different network structures are evaluated. Considering the results, a success ranking score is obtained for each algorithm. The three most successful algorithms in both training and testing processes are the firefly algorithm, selfish herd optimizer, and grasshopper optimization algorithm, respectively. The training error values obtained with these algorithms are 4.5 × 10−4, 1.6 × 10−3, and 2.3 × 10−3, respectively. The test error values are 4.6 × 10−4, 1.6 × 10−3, and 2.4 × 10−3, respectively. With these algorithms, effective results have been achieved in a low number of evaluations. In addition to these three algorithms, other algorithms have also achieved mostly acceptable results. This shows that the related algorithms are generally successful ANFIS training algorithms for maximum power point tracking.

A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution

A newly hybrid nature-inspired algorithm called HSSGWOA is presented with the combination of the salp swarm algorithm (SSA) and grey wolf optimizer (GWO). The major idea is to combine the salp swarm algorithm's exploitation ability with the grey wolf optimizer's exploration ability to generate both variants' strength. The proposed algorithm uses to tune the parameters of the integral sliding mode controller (ISMC) that design to improve the dynamic performance of the two-link flexible joint manipulator. The efficiency and the capability of the proposed hybrid algorithm are evaluated based on the selected test functions. It is clear that when compared to other algorithms like SSA, GWO, differential evolution (DE), gravitational search algorithm (GSA), particles swarm optimization (PSO), and whale optimization algorithm (WOA). The ISMC parameters were tuned using the SSA, which was then compared to the HSSGWOA algorithm. The simulation results show the capabilities of the proposed algorithm, which gives an enhancement percentage of 57.46% compared to the standard algorithm for one of the links, and 55.86% for the other.

With the increasing demand for hospital services amidst the COVID-19 pandemic, allocation of limited public resources and management of healthcare services are of paramount importance. In the field of patient flow scheduling, previous research primarily focused on classical-based objective functions, while ignoring environmental-based objective functions. This study presents a flexible job shop scheduling problem to optimize patient flow and, thereby, minimize the total carbon footprint, as the sustainability-based objective function. Since flexible job shop scheduling is an NP-hard problem, a metaheuristic optimization algorithm, called Chaotic Salp Swarm Algorithm Enhanced with Opposition-Based Learning and Sine Cosine (CSSAOS), was developed. The proposed algorithm integrates the Salp Swarm Algorithm (SSA) with chaotic maps to update the position of followers, the sine cosine algorithm to update the leader position, and opposition-based learning for a better exploration of the search space. generating more accurate solutions. The proposed method was successfully applied in a real-world case study and demonstrated better performance than other well-known metaheuristic algorithms, including differential evolution, genetic algorithm, grasshopper optimization algorithm, SSA based on opposition-based learning, quantum evolutionary SSA, and whale optimization algorithm. In addition, it was found that the proposed method is scalable to different sizes and complexities.

This study proposes a salp swarm algorithm (SSA) tuned hybrid PID-LQG controller for load frequency control of an isolated microgrid. In the beginning, micro-grid considered here is a cluster of renewable energy sources such as photovoltaic (PV), wind turbine generator (WTG) and battery storage system which diverges from their optimal operating point due to change in its environment. The optimal value of the suggested PID-LQG controller is determined by the SSA method. The supremacy of the proposed controller is tested over the PI and PID controller. The results of SSA tuned hybrid PID-LQG are compared to the genetic algorithm (GA) and particle swarm optimization algorithm (PSO). It is noticed that of SSA tuned hybrid PID-LQG controller is more effective compared to some recently proposed approaches.

The fast development of electric vehicles (EVs) has resulted in several topics of research in this area, such as the development of a charging pricing strategy, charging control, location of the charging station, and the structure within the charging station. This paper proposes the optimal design of the structure of an EV fast-charging station (EVFCS) connected with a renewable energy source and battery energy storage systems (BESS) by using metaheuristic algorithms. The optimal design of this structure aims to find the number and power of chargers. Moreover, the renewable energy source and BESS can reduce the impact on the grid, so these energy sources are considered as ones of the optimally-designed structure of EVFCS in this work. Thus, it is necessary to determine the optimal sizing of the renewable energy source, BESS, and the grid power connected to EVFCS. This optimal structure can improve the profitability of the station. To solve the optimization problem, three metaheuristic algorithms, including particle swarm optimization (PSO), Salp swarm algorithm (SSA), and arithmetic optimization algorithm (AOA), are adopted. These algorithms aim to find the optimal structure which maximizes the profit of the EVFCS determined by its net present value (NPV), and the results obtained from these algorithms were compared. The results demonstrate that all considered algorithms could find the feasible solutions of the optimal design of the EVFCS structure where PSO provided the best NPV, followed by AOA and SSA.

Metaheuristic approaches receive a great interest in the area of optimization, especially when exact methods are missing, or the cost is extremely high. Besides the possibility to report good solutions in reasonable time, metaheuristic techniques are widely applicable. There are diverse categories of techniques that differ in number of search agents (or solutions), solution representation, and movement mechanism in search space. Just mentioned ingredients are determined according to the motivation or inspiration philosophy behind the technique. Nature-inspired optimization category is very popular and has proven high efficiency in many problems. It contains famous subclasses like evolutionary algorithms, swarm intelligence, and single-based techniques. Famous and classical examples of each subclass are genetic algorithm, particle swarm, and ant colony optimization, and simulated annealing, respectively. Nature-inspired optimization family grows so fast, and many members have joined it recently, for example, emperor penguin colony (2019), seagull optimization algorithm (2019), sailfish optimizer (2019), pity beetle algorithm (2018), emperor penguin optimizer (2018), multi-objective artificial sheep algorithm (2018), salp swarm algorithm (2017), electromagnetic field optimization (2016), sine cosine algorithm (2016), moth-flame optimization (2015), grey wolf optimizer (2014), flower pollination algorithm (2012), bat algorithm (2010), cuckoo search algorithm (2009), firefly algorithm (2008), and many others. There are many proposed hybridization and cooperation methods between techniques to produce improved versions of original ones. Nature-inspired techniques have been used in many application areas like theoretical computer science, engineering and control, forecasting, medical field, finance, management, operation research, and others. Also, new scientific disciplines like renewable energy, robotics, and navigation are feasible areas to make use of nature-inspired techniques. This chapter sheds light on six so recently new techniques that belong to nature-inspired optimization class.

In this paper, optimal load dispatch problem under competitive electric market (OLDCEM) is solved by the combination of cuckoo search algorithm (CSA) and a new constraint handling approach, called modified cuckoo search algorithm (MCSA). In addition, we also employ the constraint handling method for salp swarm algorithm (SSA) and particle swarm optimization algorithm (PSO) to form modified SSA (MSSA) and modified PSO (MPSO). The three methods have been tested on 3-unit system and 10-unit system under the consideration of payment model for power reserve allocated, and constraints of system and generators. Result comparisons among MCSA and CSA indicate that the proposed constraint handling method is very useful for metaheuristic algorithms when solving OLDCEM problem. As compared to MSSA, MPSO as well as other previous methods, MCSA is more effective by finding higher total benefit for the two systems with faster manner and lower oscillations. Consequently, MCSA method is a very effective technique for OLDCEM problem in power systems.