Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/2932
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRajasekhar, A.-
dc.contributor.authorDas, S.-
dc.contributor.authorDas, S.-
dc.date.accessioned2025-01-24T09:46:44Z-
dc.date.available2025-01-24T09:46:44Z-
dc.date.issued2012-
dc.identifier.citation10.1145/2330784.2330951en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2932-
dc.descriptionNITWen_US
dc.description.abstractIn this paper, we propose a new variant of Artificial Bee Colony Algorithm termed as μABC: Micro Artificial Bee Colony algorithm, which evolves with a very small population compared to its traditional version. In this approach the bees are ranked via their fitness. Best bee is kept unaltered, whereas the other bees are reinitialized with help of some modifications based on the food source obtained by best bee. This type of raking system will always help bees (apart from best bee) to exploit areas in the vicinity of food source corresponding to best bee. μABC is validated over a benchmark suite of shifted functions suggested in CEC’2008 competition and compared with the methods like EPSPSO, CCPSO2, etc. Various comparisons with dimensions greater than 100 show the performance of μABC in solving higher dimensional problems with less computational effort.en_US
dc.language.isoenen_US
dc.publisherGECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation Companionen_US
dc.subjectμABCen_US
dc.subjectRechenberg’s ruleen_US
dc.titleμABC: A Micro Artificial Bee Colony Algorithm for Large Scale Global Optimizationen_US
dc.typeOtheren_US
Appears in Collections:Electrical Engineering

Files in This Item:
File Description SizeFormat 
2330784.2330951.pdf500.92 kBAdobe PDFView/Open


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