Using PSO to update pheromone for the traveling salesman problem

Cheng Weiming、Tang Zhenmin、Zhao Chunxia、Chen Debao

Strategic Study of CAE ›› 2008, Vol. 10 ›› Issue (7) : 165-168.

PDF(612 KB)
PDF(612 KB)
Strategic Study of CAE ›› 2008, Vol. 10 ›› Issue (7) : 165-168.

Using PSO to update pheromone for the traveling salesman problem

  • Cheng Weiming、Tang Zhenmin、Zhao Chunxia、Chen Debao

Author information +
History +

Abstract

Using pheromone of ant coloney system as reference, a novel method of solving TSP problem is proposed. That is using particle swarm optimization ( PSO) . PSO is used because of its simple operation, easy implementation and faster speed. In order to improve the popularity of the particle swarm,make the particle swam not to homogeneous too fast and decrease the possibility of local constrain, the algorithm decides the number of degenerated particles based on a designated popularity function.Experiment results and comparison studies have demonstrated that our work is useful.

Keywords

pheromone / particle swarm algorithm / TSP

Cite this article

Download citation ▾
Cheng Weiming,Tang Zhenmin,Zhao Chunxia,Chen Debao. Using PSO to update pheromone for the traveling salesman problem. Strategic Study of CAE, 2008, 10(7): 165‒168
AI Summary AI Mindmap
PDF(612 KB)

Accesses

Citations

Detail

Sections
Recommended

/