engineering optimization problems
Recently Published Documents


TOTAL DOCUMENTS

127
(FIVE YEARS 43)

H-INDEX

21
(FIVE YEARS 7)

2021 ◽  
Vol 2021 ◽  
pp. 1-32
Author(s):  
Hadi Bayzidi ◽  
Siamak Talatahari ◽  
Meysam Saraee ◽  
Charles-Philippe Lamarche

In this paper, a new metaheuristic optimization algorithm, called social network search (SNS), is employed for solving mixed continuous/discrete engineering optimization problems. The SNS algorithm mimics the social network user’s efforts to gain more popularity by modeling the decision moods in expressing their opinions. Four decision moods, including imitation, conversation, disputation, and innovation, are real-world behaviors of users in social networks. These moods are used as optimization operators that model how users are affected and motivated to share their new views. The SNS algorithm was verified with 14 benchmark engineering optimization problems and one real application in the field of remote sensing. The performance of the proposed method is compared with various algorithms to show its effectiveness over other well-known optimizers in terms of computational cost and accuracy. In most cases, the optimal solutions achieved by the SNS are better than the best solution obtained by the existing methods.


Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1092
Author(s):  
Qing Duan ◽  
Lu Wang ◽  
Hongwei Kang ◽  
Yong Shen ◽  
Xingping Sun ◽  
...  

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.


Sign in / Sign up

Export Citation Format

Share Document