Optimize TSP using Ant Colony System using Java

Authors

  • Shatha Habeeb University of Technology, Computer Sciences, Baghdad, Iraq.
  • Zainab Sadiq Al-Mustansiriya University, Baghdad, Iraq.

Keywords:

TSP, Ant Colony System.

Abstract

The travelling salesman problem (TSP) probably is the most prominent problem in combinatorial optimization. It is simple definition along with its notorious difficulty has stimulated many efforts to find an efficient algorithm. In this research use Ant Colony System to solving TSP and generating good solutions to both. The work has been extended to calculate the correlation coefficient between the number of nodes and number of iterations.

References

Downloads

Published

2013-06-30

Issue

Vol. 5 No. 1 (2013)

Section

Articles

How to Cite

[1]
“Optimize TSP using Ant Colony System using Java ”, JMAU, vol. 5, no. 1, pp. 117–124, Jun. 2013, Accessed: Feb. 22, 2026. [Online]. Available: https://journal.mauc.edu.iq/index.php/JMAUC/article/view/219