A multi-group ant colony system algorithm for TSP

@article{Ouyang2004AMA,
  title={A multi-group ant colony system algorithm for TSP},
  author={Jun Ouyang and Gui-Rong Yan},
  journal={Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826)},
  year={2004},
  volume={1},
  pages={117-121 vol.1}
}
As a new class of global searching algorithms, ant colony system algorithm could solve TSP (traveling salesman problem). These algorithms includes ACS, MAX-MIN ant system, et al. This work presents a new method named multi-group ant colony system algorithm. This algorithm avoids some defects of ACS and MAX-MIN ant system. These defects make algorithm not iterate when it has arrived at the stagnating state of the iteration or local optimum point. But for multi-group ant colony system, it creates… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

References

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

Gutjahr , “ ACO algorithms with guaranteed convergence to the optimal solution

  • J Walter
  • Information Processing Letters
  • 2002

An improved ant colony system based on adaptive adjusting pheromone ” , Information and Control , 2002 6 [ 51 E . - G . Talbi , 0 .

  • Marco Dorigo, Eric Bonabeau, Guy Theraulaz
  • Ant algorithms and stigmergy ” , Future…

Similar Papers

Loading similar papers…