By Topic

Improved particle swarm optimization for multi-object Traveling Salesman Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jin-rong Su ; Dept. of Inf., Shan Xi Univ., Taiyuan, China

An improved particle swarm optimization algorithm is proposed in this paper. The algorithm draws on the thinking of the greedy algorithm to initialize the particle swarm. Two swarms are used to optimize synchronously, and crossover and mutation operators in genetic algorithm are introduced into the new algorithm. The algorithm is used to solve multi-object Traveling Salesman Problem. We also use this algorithm to solve multi-object TSP of ten scattered attractions in Shan Xi Province. The results show that the algorithm has high convergence speed and convergence ratio. More Pareto optimal are found with this algorithm.

Published in:

Natural Computation (ICNC), 2011 Seventh International Conference on  (Volume:2 )

Date of Conference:

26-28 July 2011