Global optimization through randomized group search in contracting regions

Author(s):  
Chao Yu ◽  
Dipti Srinivasan ◽  
Qing-Guo Wang
2021 ◽  
Author(s):  
Atefeh Amindoust ◽  
Amin Ahwazian ◽  
Reza Tavakkoli-Moghaddam ◽  
Mehrdad Nikbakhta

Abstract The present research proposes a new particle swarm optimization-based metaheuristic algorithm entitled “search in forest (SIF) optimizer” to solve the global optimization problems. The algorithm is designed based on the organized behavior of search teams looking for missing persons in a forest. According to SIF optimizer, a number of teams each including several experts in the search field spread out across the forest and gradually move in the same direction by finding clues from the target until they find the missing person. This search structure was designed in a mathematical structure in the form of intra-group search operators and transferring the expert member to the top team. In addition, the efficiency of the algorithm was assessed by comparing the results to the standard representations and a problem with the genetic, grey wolf, salp swarm, and ant lion optimizers. According to the results, the proposed algorithm was efficient for solving many numerical representations, compared to the other algorithms.


2016 ◽  
Vol 16 (2) ◽  
pp. 219-230 ◽  
Author(s):  
Jia-Jia Chen ◽  
Tianyao Ji ◽  
Peter Wu ◽  
Mengshi Li

Author(s):  
Reiner Horst ◽  
Hoang Tuy
Keyword(s):  

Informatica ◽  
2016 ◽  
Vol 27 (2) ◽  
pp. 323-334 ◽  
Author(s):  
James M. Calvin

2011 ◽  
Vol 31 (3) ◽  
pp. 657-659 ◽  
Author(s):  
Zhen-guo FANG ◽  
De-bao CHEN

Sign in / Sign up

Export Citation Format

Share Document