Enhanced Bee Colony Algorithm for Complex Optimization Problems
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 1
Abstract
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.
Authors and Affiliations
S. Suriya , R. Deepalakshmi , S. Suresh kannan , Dr. S. P. Shantharajah
Keywords
Related Articles
- EP ID EP145390
- DOI -
- Views 94
- Downloads 0
Quantum computation and Biological stress: A Hypothesis
We propose that biological systems may behave as quantum computers.We have earlier hypothesized that patterns of quantum computation may be altered in stress and this leads to the change in the consciousness vector of bi...
CONTROLLING BURST LOSS RATIO IN OBS USING FEEDBACK CONTROL AND DYNAMIC TECHNIQUES
Optical Burst Switching(OBS) is a switching technique used in optical network where data is sent as bursts. In this switching technique single burst loss can influence loss of multiple data. Hence Burst Loss Ratio (BLR)...
A Novel Document Clustering Algorithm Using Squared Distance Optimization Through Genetic Algorithms
K-Means Algorithm is most widely used algorithms in document clustering. However, it still suffer some shortcomings like random initialization, solution converges to local minima, and empty cluster formation. Genetic alg...
IMPLEMENTATION OF REPUTATION EXCHANGE PROTOCOL IN PEER-TO-PEER SYSTEM
The motivation behind basing applications on peer-to-peer architectures derives to a large extent from their ability to function, scale and self-organize in the presence of a highly transient population of nodes, network...
VoIP over WMN: Effect of packet aggregation
VoIP services are getting more and more popular day by day. In order to meet the users demand for such services irrespective of users location requires wide area wireless coverage .To this extent, wireless mesh networks...