DocumentCode
2220733
Title
A mixed discrete particle swarm optimization for TSP
Author
Liu, Zhong ; Huang, Lei
Author_Institution
Chengdu Inst. of Comput. Applic., Chinese Acad. of Sci., Chengdu, China
Volume
2
fYear
2010
fDate
20-22 Aug. 2010
Abstract
Particle swarm optimization (PSO) is a new evolution computing technology, its applications in discrete problem is a hot and valued field. Basing on the present algorithm of particle swarm optimization, this paper construct a special mixed discrete particle swarm optimization (MDPSO), and get a new formula of the velocity, via presenting the crossover and mutation of the genetic algorithm (GA). As applications, we propose it to traveling salesman problem (TSP) with 17 nodes and 14 nodes. Experimental results show that the proposed algorithm would greatly improve the efficiency of DPSO, especially, the convergence rate.
Keywords
genetic algorithms; particle swarm optimisation; travelling salesman problems; MDPSO; TSP; discrete problem; evolution computing technology; genetic algorithm; mixed discrete particle swarm optimization; traveling salesman problem; Optimization; genetic algorithm; particle swarm optimization; traveling salesman problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on
Conference_Location
Chengdu
ISSN
2154-7491
Print_ISBN
978-1-4244-6539-2
Type
conf
DOI
10.1109/ICACTE.2010.5579238
Filename
5579238
Link To Document