Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2807
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRajasekhar, A.-
dc.contributor.authorAbraham, A.-
dc.contributor.authorPant, M.-
dc.date.accessioned2025-01-18T10:58:46Z-
dc.date.available2025-01-18T10:58:46Z-
dc.date.issued2011-11-
dc.identifier.citation10.1109/ICSMC.2011.6083786en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2807-
dc.descriptionNITWen_US
dc.description.abstractThis paper proposes an improved version of Artificial Bee Colony (ABC) algorithm with mutation based on Levy Probability Distributions. The Levy distribution has a peculiar property of generating an offspring farther away from its parent which depends on internal parameter α compared to that of Gaussian mutations, this property enables in finding out most optimal solutions to the problems than that of conventional methods. The proposed algorithm is tested on 7 standard benchmark functions and on a set of non-traditional problems suggested in the special session of CEC'2008. Analysis and comparison of results with other state of art optimization algorithms like GA and PSO, shows the superiority of improved mutation, especially on high dimensional problems. This paper finally investigates the performance of proposed algorithm on the frequency-modulated sound wave synthesis problem, a real world problem in the field on communication engineering.en_US
dc.language.isoenen_US
dc.publisher2011 IEEE International Conference on Systems, Man, and Cyberneticsen_US
dc.subjectArtificial beesen_US
dc.subjectLevy probability distributionsen_US
dc.subjectGlobal optimizationen_US
dc.titleLevy mutated Artificial Bee Colony algorithm for global optimizationen_US
dc.typeArticleen_US
Appears in Collections:Electrical Engineering

Files in This Item:
File Description SizeFormat 
Levy_mutated_Artificial_Bee_Colony_algorithm_for_global_optimization.pdf479.42 kBAdobe PDFView/Open


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