Paper Info
Title
Tournament Selection Based Probability Scheme in Spider Monkey Optimization Algorithm
Abstract
In this paper, a modified version of Spider Monkey Optimization (SMO) algorithm is proposed. This modified version is named as Tournament selection based Spider Monkey Optimization (TS-SMO). TS-SMO replaces the fitness proportionate probability scheme of SMO with tournament selection based probability scheme with an objective to improve the exploration ability of SMO by avoiding premature convergence. The performance of the proposed variant is tested over a large benchmark set of 46 unconstrained benchmark problems of varying complexities broadly classified into two categories: scalable and non-scalable problems. The performance of TS-SO is compared with that of SMO. Results for scalable and non-scalable problems have been analysed separately. A statistical test is employed to access the significance of improvement in results. Numerical and statistical results show that the proposed modification has a positive impact on the performance of original SMO in terms of reliability, efficiency and accuracy.
Year
DOI
Venue
2015
10.1007/978-3-662-47926-1_23
HARMONY SEARCH ALGORITHM
Keywords
Field
DocType
Spider monkey optimization,Tournament selection,Unconstrained optimization,Swarm intelligent techniques
Mathematical optimization,Premature convergence,Algorithm,Spider monkey optimization,Tournament selection,Statistical hypothesis testing,Mathematics,Scalability
Conference
Volume
ISSN
Citations 
382
2194-5357
4
PageRank 
References 
Authors
0.39
2
2
Name
Order
Citations
PageRank
kavita gupta140.39
Kusum Deep287682.14