Nature-inspired approach: An enhanced moth swarm algorithm for global optimization

2019 ◽  
Vol 159 ◽  
pp. 57-92 ◽  
Author(s):  
Qifang Luo ◽  
Xiao Yang ◽  
Yongquan Zhou
2021 ◽  
pp. 1-12
Author(s):  
Heming Jia ◽  
Chunbo Lang

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.


2004 ◽  
Vol 61 (13) ◽  
pp. 2296-2315 ◽  
Author(s):  
J. F. Schutte ◽  
J. A. Reinbolt ◽  
B. J. Fregly ◽  
R. T. Haftka ◽  
A. D. George

2012 ◽  
Vol 602-604 ◽  
pp. 1782-1786
Author(s):  
Shi Da Yang ◽  
Ya Lin Yi ◽  
Zhi Yong Shan

A novel Chaotic Improved Cat Swarm Algorithm (CCSA) is presented for global optimization. The CSA is a new meta-heuristic optimization developed based on imitating the natural behavior of cats and composed of two sub-models: tracing mode and seeking mode, which model upon the behaviors of cats. Here different chaotic maps are utilized to improve the seeking mode step of the algorithm. Seven different chaotic maps are investigated and the Logistic and Sinusoidal maps are found as the best choices. Comparing the new algorithm with the CSA method demonstrates the superiority of the CCSA for the benchmark functions.


2012 ◽  
Vol 602-604 ◽  
pp. 1793-1797 ◽  
Author(s):  
Shi Da Yang ◽  
Ya Lin Yi ◽  
Yan Ping Lu

Based on the concepts of homotopy, a novel cat swarm algorithm, called a homotopy-inspired cat swarm algorithm (HCSA),is proposed to deal with the problem of global optimization. Proceeding from dependent variables of optimized function,it traces a path from the solution of an easy problem to the solution of the given one by use of a homotopy--|a continuous transformation from the easy problem to the given one.This novel strategy enables the cat swarm algorithm (CSA) to improve the search efficiency. Theoretical analysis proves that HCSA converges to the global optimum. Experimenting with a wide range of benchmark functions, we show that the proposed new version of CSA, with the continuous transformation, performs better, or at least comparably, to classic CSA.


Sign in / Sign up

Export Citation Format

Share Document