Advancement of the search process of salp swarm algorithm for global optimization problems

2021 ◽  
pp. 115292
Author(s):  
Emre Çelik ◽  
Nihat Öztürk ◽  
Yogendra Arya
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Search Process ◽  
Salp Swarm Algorithm ◽  
Swarm Algorithm

Salp swarm algorithm with crossover scheme and Lévy flight for global optimization

2021 ◽  
pp. 1-12
Author(s):  
Heming Jia ◽  
Chunbo Lang
Keyword(s):  
Global Optimization ◽  
Heuristic Algorithm ◽  
Experimental Results ◽  
High Dimensional ◽  
Lévy Flight ◽  
Test Functions ◽  
Levy Flight ◽  
Salp Swarm Algorithm ◽  
Swarm Algorithm ◽  
Accuracy And Stability

Salp swarm algorithm (SSA) is a meta-heuristic algorithm proposed in recent years, which shows certain advantages in solving some optimization tasks. However, with the increasing difficulty of solving the problem (e.g. multi-modal, high-dimensional), the convergence accuracy and stability of SSA algorithm decrease. In order to overcome the drawbacks, salp swarm algorithm with crossover scheme and Lévy flight (SSACL) is proposed. The crossover scheme and Lévy flight strategy are used to improve the movement patterns of salp leader and followers, respectively. Experiments have been conducted on various test functions, including unimodal, multimodal, and composite functions. The experimental results indicate that the proposed SSACL algorithm outperforms other advanced algorithms in terms of precision, stability, and efficiency. Furthermore, the Wilcoxon’s rank sum test illustrates the advantages of proposed method in a statistical and meaningful way.

scholarly journals Improved Salp Swarm Algorithm with Simulated Annealing for Solving Engineering Optimization Problems

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1092
Author(s):  
Qing Duan ◽  
Lu Wang ◽  
Hongwei Kang ◽  
Yong Shen ◽  
Xingping Sun ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Optimization Problems ◽  
Chaotic Sequence ◽  
Engineering Optimization ◽  
Exploration And Exploitation ◽  
Salp Swarm Algorithm ◽  
Symmetric Perturbation ◽  
Swarm Algorithm ◽  
Search Capability ◽  
Engineering Optimization Problems

Swarm-based algorithm can successfully avoid the local optimal constraints, thus achieving a smooth balance between exploration and exploitation. Salp swarm algorithm(SSA), as a swarm-based algorithm on account of the predation behavior of the salp, can solve complex daily life optimization problems in nature. SSA also has the problems of local stagnation and slow convergence rate. This paper introduces an improved salp swarm algorithm, which improve the SSA by using the chaotic sequence initialization strategy and symmetric adaptive population division. Moreover, a simulated annealing mechanism based on symmetric perturbation is introduced to enhance the local jumping ability of the algorithm. The improved algorithm is referred to SASSA. The CEC standard benchmark functions are used to evaluate the efficiency of the SASSA and the results demonstrate that the SASSA has better global search capability. SASSA is also applied to solve engineering optimization problems. The experimental results demonstrate that the exploratory and exploitative proclivities of the proposed algorithm and its convergence patterns are vividly improved.

scholarly journals A Modified Salp Swarm Algorithm Based on the Perturbation Weight for Global Optimization Problems

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Yuqi Fan ◽  
Junpeng Shao ◽  
Guitao Sun ◽  
Xuan Shao
Keyword(s):  
Large Scale ◽  
Optimization Problems ◽  
Iteration Process ◽  
Function Optimization ◽  
Search Performance ◽  
Global Function ◽  
Salp Swarm Algorithm ◽  
Search Speed ◽  
Swarm Algorithm ◽  
Feasible Solutions

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.

Comparison of the arithmetic optimization algorithm, the slime mold optimization algorithm, the marine predators algorithm, the salp swarm algorithm for real-world engineering applications

2021 ◽  
Vol 63 (5) ◽  
pp. 448-452
Author(s):  
Dildar Gürses ◽  
Sujin Bureerat ◽  
Sadiq M. Sait ◽  
Ali Rıza Yıldız
Keyword(s):  
Shape Optimization ◽  
Optimization Algorithm ◽  
Simulated Annealing Algorithm ◽  
Optimization Problems ◽  
Slime Mold ◽  
Salp Swarm Algorithm ◽  
Marine Predators ◽  
Metaheuristic Methods ◽  
Engineering Design Problems ◽  
Swarm Algorithm

Abstract This paper focuses on a comparision of recent algorithms such as the arithmetic optimization algorithm, the slime mold optimization algorithm, the marine predators algorithm, and the salp swarm algorithm. The slime mold algorithm (SMA) is a recent optimization algorithm. In order to strengthen its exploitation and exploration abilities, in this paper, a new hybrid slime mold algorithm-simulated annealing algorithm (HSMA-SA) has been applied to structural engineering design problems. As a result of the rules and practices that have become mandatory for fuel emissions by international organizations and governments, there is increasing interest in the design of vehicles with minimized fuel emissions. Many scientific studies have been conducted on the use of metaheuristic methods for the optimum design of vehicle components, especially for reducing vehicle weight. With the inspiration obtained from the above-mentioned methods, the HSMA-SA has been studied to solve the shape optimization of a design case to prove how the HSMA-SA can be used to solve shape optimization problems. The HSMA-SA provides better results as an arithmetic optimization algorithm than the slime mold optimization algorithm, the marine predators algorithm, and the salp swarm algorithm.

Sign in / Sign up

Export Citation Format

Share Document