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.

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 GPU-Enabled Compact Genetic Algorithm for Very Large-Scale Optimization Problems

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 758
Author(s):  
Andrea Ferigo ◽  
Giovanni Iacca
Keyword(s):  
Genetic Algorithm ◽  
Large Scale ◽  
Optimization Problems ◽  
Search Space ◽  
Large Scale Problems ◽  
Processing Power ◽  
Compact Genetic Algorithm ◽  
Estimation Of Distribution ◽  
Feasible Solutions ◽  
Compact Optimization

The ever-increasing complexity of industrial and engineering problems poses nowadays a number of optimization problems characterized by thousands, if not millions, of variables. For instance, very large-scale problems can be found in chemical and material engineering, networked systems, logistics and scheduling. Recently, Deb and Myburgh proposed an evolutionary algorithm capable of handling a scheduling optimization problem with a staggering number of variables: one billion. However, one important limitation of this algorithm is its memory consumption, which is in the order of 120 GB. Here, we follow up on this research by applying to the same problem a GPU-enabled “compact” Genetic Algorithm, i.e., an Estimation of Distribution Algorithm that instead of using an actual population of candidate solutions only requires and adapts a probabilistic model of their distribution in the search space. We also introduce a smart initialization technique and custom operators to guide the search towards feasible solutions. Leveraging the compact optimization concept, we show how such an algorithm can optimize efficiently very large-scale problems with millions of variables, with limited memory and processing power. To complete our analysis, we report the results of the algorithm on very large-scale instances of the OneMax problem.

Archive of Useful Solutions for Directed Mating in Evolutionary Constrained Multiobjective Optimization

2014 ◽  
Vol 18 (2) ◽  
pp. 221-231 ◽  
Author(s):  
Minami Miyakawa ◽  
◽  
Keiki Takadama ◽  
Hiroyuki Sato
Keyword(s):  
Pareto Front ◽  
Optimization Problems ◽  
Selection Process ◽  
Benchmark Problems ◽  
Search Performance ◽  
Next Generation ◽  
Multi Objective ◽  
Objective Space ◽  
Feasible Solutions ◽  
Constrained Multiobjective Optimization

As an evolutionary approach to solve multi-objective optimization problems involving several constraints, recently a multi-objective evolutionary algorithm (MOEA) using two-stage non-dominated sorting and directed mating (TNSDM) has been proposed. In TNSDM, directed mating utilizes infeasible solutions dominating feasible solutions in the objective space to generate offspring. In our previous studies, significant contribution of directed mating to the improvement of the search performancewas verified on several benchmark problems. However, in the conventional TNSDM, infeasible solutions utilized in directed mating are discarded in the selection process of parents (elites) population and cannot be utilized in the next generation. TNSDM has potential to further improve the search performance by archiving useful solutions for directed mating to the next generation and repeatedly utilizing them in directed mating. To further improve effects of directed mating in TNSDM, in this work, we propose an archiving strategy of useful solutions for directed mating. We verify the search performance of TNSDM using the proposed archive by varying the size of archive, and compare its search performance with the conventional CNSGA-II and RTS onmobjectiveskknapsacks problems. As results, we show that the search performance of TNSDM is improved by introducing the proposed archive in aspects of diversity of the obtained solutions in the objective space and convergence of solutions toward the optimal Pareto front.

Research of Parallel Artificial Bee Colony Algorithm Based on MPI

2013 ◽  
Vol 380-384 ◽  
pp. 1430-1433 ◽  
Author(s):  
Ying Sen Hong ◽  
Zhen Zhou Ji ◽  
Chun Lei Liu
Keyword(s):  
Parallel Algorithm ◽  
Message Passing ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Complex Function ◽  
Function Optimization ◽  
Search Performance ◽  
Bee Colony ◽  
Long Time

Artificial bee colony algorithm is a smart optimization algorithm based on the bees acquisition model. A long time for the search of the artificial bee colony algorithm, in this paper we propose a parallel algorithm of artificial bee colony algorithm (MPI-ABC), with an application of a parallel programming environment MPI, using the programming mode of message passing rewriting the serial algorithm in parallel. Finally, this paper compare both serial and parallel algorithm with testing on complex function optimization problems. The experimental results show that the algorithm is effective to improve the search performance, especially for high-dimensional complex optimization problem.

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