Cart (Loading....) | Create Account
Close category search window

Parameters Analysis Based on Experiments of Particle Swarm Optimization Algorithm for Solving Traveling Salesman Problem

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
$31 $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

2 Author(s)
Jiang-wei Zhang ; Sch. of Comput. Sci. & Technol., Xuchang Univ., Xuchang, China ; De-xi Zhang

An improved particle swarm optimization (IPSO) algorithm is proposed for solving traveling salesman problem (TSP) which is a well-known NP-complete problem. Based on the different experimental results, this paper analysis the parameters influences to the algorithm optimization ability. The IPSO algorithm can get a better global optimum in multiple TSP problems by setting the proper parameters. Numerical simulation results for the different scale benchmark TSP problems show the effectiveness and efficiency of the proposed method using the proper parameters.

Published in:

Natural Computation, 2009. ICNC '09. Fifth International Conference on  (Volume:3 )

Date of Conference:

14-16 Aug. 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.