Particle Swarm for the Traveling Salesman Problem

@inproceedings{Goldbarg2006ParticleSF,
  title={Particle Swarm for the Traveling Salesman Problem},
  author={Elizabeth Ferreira Gouvea Goldbarg and Givanaldo R. de Souza and Marco C{\'e}sar Goldbarg},
  booktitle={EvoCOP},
  year={2006}
}
This paper presents a competitive Particle Swarm Optimization algorithm for the Traveling Salesman Problem, where the velocity operator is based upon local search and path-relinking procedures. The paper proposes two versions of the algorithm, each of them utilizing a distinct local search method. The proposed heuristics are compared with other Particle Swarm Optimization algorithms presented previously for the same problem. The results are also compared with three effective algorithms for the… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS
17 Citations
25 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Optimal Path for Automated Drilling Operations by a New Heuristic Approach Using Particle Swarm Optimization

  • G. C. Onwubulu, M. Clerc
  • International Journal of Production Research Vol…
  • 2004
Highly Influential
3 Excerpts

Particle Swarm Optimization, Proceedings of the IEEE International Conference on Neural Networks Vol

  • J. Kennedy, R. Eberhart
  • 4
  • 1995
Highly Influential
3 Excerpts

Particle Swarm Optimization for Traveling Salesman Problem

  • Wang, K.-P., L. Huang, Zhou, C.-G., W. Pang
  • Proceedings of the Second International…
  • 2003
3 Excerpts

Experimental Analysis of Heuristics for the STSP

  • D. S. Johnson, L. A. McGeoh
  • Guttin, G., Punnen, A.P. (eds.): Traveling…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…