Performance comparison of constrained artificial bee colony algorithm
This study is aimed to evaluate, analyze and compare the performances of available constrained Artificial Bee Colony (ABC) algorithms in the literature. In recent decades, many different variants of the ABC algorithms have been suggested to solve Constrained Optimization Problems (COPs). However, to...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Maxwell Science Publications
2015
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/58781/1/RohaninAhmad2015_PerformanceComparisonofConstrainedArtificialBee.pdf http://eprints.utm.my/id/eprint/58781/ http://dx.doi.org/10.19026/rjaset.10.2461 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This study is aimed to evaluate, analyze and compare the performances of available constrained Artificial Bee Colony (ABC) algorithms in the literature. In recent decades, many different variants of the ABC algorithms have been suggested to solve Constrained Optimization Problems (COPs). However, to the best of the authors' knowledge, there rarely are comparative studies on the numerical performance of those algorithms. This study is considering a set of well-known benchmark problems from test problems of Congress of Evolutionary Computation 2006 (CEC2006). |
---|