Artificial Bee Colony (ABC) Algorithm for Vehicle Routing Optimization Problem
Ashita S. Bhagade1, Parag. V. Puranik2
1Ashita Bhagade, Electronics Engineering, G.H. Raisoni College Of Engineering, Nagpur, India.
2P. V. Puranik, Electronics And Telecommunication, G. H. Raisoni College Of Engineering, Nagpur, India.
Manuscript received on April 11, 2012. | Revised Manuscript received on April 14, 2012. | Manuscript published on May 05, 2012. | PP: 329-333 | Volume-2 Issue-2, May 2012 . | Retrieval Number: B0652042212/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Artificial Bee Colony algorithm, Bee travel time. , Nearest neighbor method, Tour length, Travelling Salesman Problem