A Hybrid Mutation-based Artificial Bee Colony for Traveling Salesman Problem
2013-06-03 16:00:03   来源:   评论:0 点击:

Abstract—Travelling Salesman Problem (TSP) belongs to the class of NP-Complete problems. It has been proved that evolutionary algorithms are effective and efficient, with respect to the traditional methods for solving NP-Complete problems like TSP, with avoidance trapping in local minima areas. Artificial Bee Colony (ABC) is a new swarm-based optimization algorithm, which inspired by the foraging behavior of honey bees. In ABC, the neighborhood search strategy is employed in order to find better solutions around the previous ones. In this paper, a hybrid mutation based mechanism is proposed to perform the neighborhood searching for the bees for the TSP. The introduced approach leads to efficiently reduce the complexity and running time of the ABC algorithm. Experimental results were carried out on the benchmarks from TSPLIB for validation. The findings imply that the proposed approach is able to achieve optimal tours very quickly. 

Index Terms—traveling salesman problem (TSP), artificial bee colony (ABC), mutation

Cite: Shima Sabet, Fardad Farokhi, and Mohammad Shokouhifar, "A Hybrid Mutation-based Artificial Bee Colony for Traveling Salesman Problem," Lecture Notes on Information Theory, Vol.1, No.3, pp. 99-103, Sept. 2013. doi: 10.12720/lnit.1.3.99-103


上一篇:A Comparative Analysis for WLMS Algorithm in System Identification
下一篇:A Device Management and Credit Evaluation System in Home Network Domain

分享到: 收藏