期刊名称:International Journal on Computer Science and Engineering
印刷版ISSN:2229-5631
电子版ISSN:0975-3397
出版年度:2012
卷号:4
期号:01
页码:72-78
出版社:Engg Journals Publications
摘要:Optimization problems are considered to be one kind of NP hard problems. Usually heuristic approaches are found to provide solutions for NP hard problems. There are a plenty of heuristic algorithms available to solve optimization problems namely: Ant Colony Optimization, Particle Swarm Optimization, Bee Colony Optimization, etc. The basic Bee Colony algorithm, a population based search algorithm, is analyzed to be a novel tool for complex optimization problems. The algorithm mimics the food foraging behavior of swarms of honey bees. This paper deals with a modified fitness function of Bee Colony algorithm. The effect of problem dimensionality on the performance of the algorithms will be investigated. This enhanced Bee Colony Optimization will be evaluated based on the well-known benchmark problems. The testing functions like Rastrigin, Rosenbrock, Ackley, Griewank and Sphere are used to evaluavate the performance of the enhanced Bee Colony algorithm. The simulation will be developed on MATLAB.