Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/9819
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharma, A.
dc.contributor.authorSharma, A.
dc.contributor.authorPanigrahi, B.K.
dc.contributor.authorKiran, D.
dc.contributor.authorKumar, R.
dc.date.accessioned2020-03-31T06:51:30Z-
dc.date.available2020-03-31T06:51:30Z-
dc.date.issued2016
dc.identifier.citationSwarm and Evolutionary Computation, 2016, Vol.28, , pp.58-77en_US
dc.identifier.uri10.1016/j.swevo.2016.01.002
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/9819-
dc.description.abstractSwarm Intelligence (SI) is quite popular in the field of numerical optimization and has enormous scope for research. A number of algorithms based on decentralized and self-organized swarm behavior of natural as well as artificial systems have been proposed and developed in last few years. Spider Monkey Optimization (SMO) algorithm, inspired by the intelligent behavior of spider monkeys, is one such recently proposed algorithm. The algorithm along with some of its variants has proved to be very successful and efficient. A spider monkey group consists of members from every age group. The agility and swiftness of the spider monkeys differ on the basis of their age groups. This paper proposes a new variant of SMO algorithm termed as Ageist Spider Monkey Optimization (ASMO) algorithm which seems more practical in biological terms and works on the basis of age difference present in spider monkey population. Experiments on different benchmark functions with different parameters and settings have been carried out and the variant with the best suited settings is proposed. This variant of SMO has enhanced the performance of its original version. Also, ASMO has performed better in comparison to some of the recent advanced algorithms. 2016en_US
dc.titleAgeist Spider Monkey Optimization algorithmen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.