This paper proposes a weighted spider monkey algorithm (WSMO). In order to further improve the performance of the spider-monkey algorithm (SMO)
a linear decreasing inertia weight is introduced into the spider monkey individuals home position in the local leaders and local leaders decision-making stages. This algorithm can increase the diversity of the population in the early iteration and increase the local search capabilities in the later iteration. The experimental results of six benchmark functions show that the improved algorithm is better than the original spider monkey algorithm in terms of convergence speed
optimization accuracy and robustness
especially in the optimization of multimodal function optimization problems.
关键词
Keywords
references
Al Azza A A, Al Jodah A A, Harackiewicz F J. Spider monkey optimization: a novel technique for antenna optimization[J]. IEEE Antennas and Wireless Propagation Letters, 2016(15): 1016-1019. DOI: 1016
Agrawal A, Farswan P, Agrawal V, et al. On the hybridization of spider monkey optimization and genetic algorithms[C]// Proceedings of Sixth International Conference on Soft Computing for Problem Solving. Singapore, Springer, 2017: 185-196.
Singh U, Salgotra R. Optimal synthesis of linear antenna arrays using modified spider monkey optimization[J]. Arabian Journal for Science and Engineering, 2016, 41(8): 2957-2973. DOI: 2957
Kumari R, Sharma V K. Fitness based position update in spider monkey optimization algorithm[J]. Procedia Computer Science, 2015(62): 442-449. DOI: 442
Kumar S, Kumari R.Modified position update in spider monkey optimization algorithm [C]//Proceedings of International Journal of Emerging Technologies in Computational and Applied Sciences IJETCAS. [s.l.] 2014.
Bansal J C, Sharma H, Jadon S S, et al.Spider monkey optimization algorithm for numerical optimization[J]. Memetic computing, 2014, 6(1): 31-47. DOI: 31
Sharma A, Panigrahi B K. Ageist spider monkey optimization algorithm [J].Swarm and Evolutionary Computation, 2016(28): 58-77. DOI: 58
Berlin, Heidelberg Gupta K, Deep K. Tournament selection based probability schemein spider monkey optimization algorithm[M].Berlin, Heidelberg:Springer Press, 2016.
Agarwal N, Jain S C. Fast convergent spider mnkey optimization algorithm[C]// Proceedings of Sixth International Conference on Soft Computing for Problem Solving. Springer, Singapore, 2017: 42-51.