Particle Swarm Optimization Algorithm for the Traveling Salesman Problem

  • G. Goldbarg E
  • C. M
  • de Souz G
N/ACitations
Citations of this article
55Readers
Mendeley users who have this article in their library.

Abstract

This chapter summarized the research done to develop PSO algorithms for the TSP. Many of the PSO algorithms presented previously for the investigated problem do not tackle large instances and present results far from the best known heuristic solutions obtained by effective algorithms. The chapter presented an approach to design effective PSO algorithms

Cite

CITATION STYLE

APA

G. Goldbarg, E. F., C., M., & de Souz, G. R. (2008). Particle Swarm Optimization Algorithm for the Traveling Salesman Problem. In Traveling Salesman Problem. InTech. https://doi.org/10.5772/5580

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free