A novel discrete particle swarm optimization to solve traveling salesman problem

@article{Zhong2007AND,
  title={A novel discrete particle swarm optimization to solve traveling salesman problem},
  author={Wen-liang Zhong and Jun Zhang and Wei-neng Chen},
  journal={2007 IEEE Congress on Evolutionary Computation},
  year={2007},
  pages={3283-3287}
}
Particle swarm optimization (PSO), which simulates the unpredictable flight of a bird flock, is one of the intelligent computation algorithms. PSO is well-known to solve the continuous problems, yet by proper modification, it can also be applied to discrete problems, such as the classical test model: traveling salesman problem (TSP). In this paper, a novel discrete PSO call C3DPSO for TSP, with modified update formulas and a new parameter c3 (called mutation factor, to help to keep the balance… CONTINUE READING
Highly Cited
This paper has 86 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

87 Citations

01020'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…