New Discrete Particle Swarm Algorithm for Traveling Salesman Problem

Abstract:

Article Preview

In this paper, a novel algorithm called CIPSO for short based on particle optimization algorithm(PSO) and Chaos optimization Algorithm(COA) is presented to solve traveling salesman problem(TSP). We propose some new operators to solve the difficulties of implementing PSO into solving this discrete problem based on the special fitness landscape of TSP. Meanwhile embedded with chaos theory it can enhance particles’ global searching ability so as not to converge to the local optimal solution too quickly, and the introduction of information intercourse can enhance thire local searching ability. Comparing to SA, GA, ACS and so on, this new algorithm shows its validity and satisfactory effect on several benchmark test problems.

Info:

Periodical:

Advanced Materials Research (Volumes 148-149)

Edited by:

Xianghua Liu, Zhengyi Jiang and Jingtao Han

Pages:

210-214

DOI:

10.4028/www.scientific.net/AMR.148-149.210

Citation:

J. Y. Li and J. Wang, "New Discrete Particle Swarm Algorithm for Traveling Salesman Problem", Advanced Materials Research, Vols. 148-149, pp. 210-214, 2011

Online since:

October 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.