A hybrid particle swarm optimization model for the traveling salesman problem

@inproceedings{Machado2004AHP,
  title={A hybrid particle swarm optimization model for the traveling salesman problem},
  author={T. R. Machado and Heitor Silv{\'e}rio Lopes},
  year={2004}
}
This work presents a new hybrid model, based on Particle Swarm Optimization, Genetic Algorithms and Fast Local Search, for the blind traveling salesman problem. A detailed description of the model is provided. The implemented system was tested with instances from 76 to 2103 cities. For instances up to 299 cities, results are less than 1% in excess of the known optima. In the average, for all instances, results are 3.8317 % in excess. These excellent results encourage further research and… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

Citations

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

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Particle swarm optimization for traveling salesman problem

  • K. P. Wang, L. Huang, C. G. Zhou, W. Pang
  • Proc. 2 IEEE Int. Conf. on Machine Learning and…
  • 2003
2 Excerpts

Particle swarm optimization

  • R. C. Eberhart, J. Kennedy
  • Proc. IEEE Int. Conf. on Neural Networks,
  • 1995
2 Excerpts

Similar Papers

Loading similar papers…