A discrete artificial bee colony algorithm for TSP problem

  • Authors:
  • Li Li;Yurong Cheng;Lijing Tan;Ben Niu

  • Affiliations:
  • College of Management, Shenzhen University, Shenzhen, China;College of Management, Shenzhen University, Shenzhen, China;Management School, Jinan University, Guangzhou, China;College of Management, Shenzhen University, Shenzhen, China

  • Venue:
  • ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared with particle swarm optimization (PSO) algorithm to validate its performance. In the experimental study, we also analysis the important parameters in the artificial bee colony algorithm and their influence have been verified.