期刊名称：International Journal of Soft Computing & Engineering
电子版ISSN：2231-2307
出版年度：2012
卷号：2
期号：2
页码：329-333
出版社：International Journal of Soft Computing & Engineering
摘要：This paper involves Bee Colony Optimization for travelling salesman problem. The ABC optimization is a population-based search algorithm which applies the concept of social interaction to problem solving. This biological phenomenon when applied to the process of path planning problems for the vehicles, it is found to be excelling in solution quality as well as in computation time. Simulations have been used to evaluate the fitness of paths found by ABC Optimization. The effectiveness of the paths has been evaluated with the parameters such as tour length, bee travel time by Artificial Bee Colony Algorithm. In this article, the travelling salesman problem for VRP is optimized by using nearest neighbor method; evaluation results are presented which are then compared by the artificial bee colony algorithm. The pursued approach gives the best results for finding the shortest path in a shortest time for moving towards the goal. Thus the optimal distance with the tour length is obtained in a more effective way.
关键词：Artificial Bee Colony algorithm; Bee travel;time. ; Nearest neighbor method; Tour length; Travelling;Salesman Problem
