An improved bean optimization algorithm for solving TSP

  • Authors:

  • Xiaoming Zhang;Kang Jiang;Hailei Wang;Wenbo Li;Bingyu Sun

  • Affiliations:

  • Institute of Intelligent Machines, Chinese Academy of Sciences, China;Hefei University of Technology, Hefei, Anhui, P.R. China;Institute of Intelligent Machines, Chinese Academy of Sciences, China;Institute of Intelligent Machines, Chinese Academy of Sciences, China;Institute of Intelligent Machines, Chinese Academy of Sciences, China

  • Venue:
  • ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inspired by the transmission of beans in nature, a novel swarm intelligence algorithm-Bean Optimization Algorithm (BOA) is proposed. In the area of continuous optimization problems solving, BOA has shown a good performance. In this paper, an improved BOA is presented for solving TSP, a typical discrete optimization problem. Two novel evolution mechanisms named population migration and priori information cross-sharing are proposed to improve the performance of BOA. The improved BOA algorithm maintains the basic idea of BOA and overcomes the shortcoming that BOA with continuous distribution function can not be applied to solve the discrete optimization problems. The experimental results of TSP show that the improved BOA algorithm is suit for solving discrete optimization problems with high efficiency.