This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
An Improved Particle Swarm Optimization Algorithm and Its Application for Solving Traveling Salesman Problem
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
An improved particle swarm optimization (IPSO) algorithm was proposed. In the basic particle swarm optimization (PSO) algorithm, the tentative behavior of individuals and the mutation of velocity have been introduced, according to the law of evolutionary process. Using the single node adjustment algorithm, each particle searches the neighbor area by itself at every generation after general steps. In the evolution, the particles can escape from the local optimum with the mutation of velocity. This kind of enhanced study behavior accords with the biological natural law even more, and helps to find the global optimum solution with great chance. For solving traveling salesman problem, numerical simulation results for the benchmark TSP problems shows the effectiveness and efficiency of the proposed method.
Index Terms:
PSO, IPSO, TSP
Citation:
Jiang-wei Zhang, Wei Xiong, "An Improved Particle Swarm Optimization Algorithm and Its Application for Solving Traveling Salesman Problem," csie, vol. 4, pp.612-616, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.