ANALYSIS AND SYNTHESIS OF ENHANCED BEE COLONY OPTIMIZATION WITH THE TRADITIONAL BEE COLONY OPTIMIZATION TO SOLVE TRAVELLING SALES PERSON PROBLEM
Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.2, No. 2)Publication Date: 2013-01-01
Authors : Deepa Bhardwaj; Harjeet Kaur; Prateek Agrawal;
Page : 93-97
Keywords : Travelling Salesperson problem; Combinatorial Optimization; Bee Colony Algorithm; K-Means Clustering;
Abstract
Bee colony optimization is the recent swarm intelligence technique which has been applied to solve many combinatorial problems. In this paper we propose the enhanced bee algorithm based on Kmeans clustering to solve TSP. In the proposed algorithm parallel bee algorithm has been applied to each cluster and connection method has been suggested to combine the sub tour to global tour of the whole cities. It was found the enhanced bee algorithm give the better result and more optimal tour.
Other Latest Articles
- ANALYSIS AND SYNTHESIS OF ENHANCED ANT COLONY OPTIMIZATION WITH THE TRADITIONAL ANT COLONY OPTIMIZATION TO SOLVE TRAVELLING SALES PERSON PROBLEM
- Improvement inEnergy Efficiency of Wireless Sensor Network
- GOAL PROGRAMMING APPROACH TO CHANCE CONSTRAINED MULTI-OBJECTIVE LINEAR FRACTIONAL PROGRAMMING PROBLEM BASED ON TAYLOR’S SERIES APPROXIMATION
- New Aggregation Operator for Triangular Fuzzy Numbers based on the Geometric Means of the Slopes of the L- and R- Membership Functions
- FOCUSED CRAWLING TECHNIQUES
Last modified: 2016-06-30 14:23:34