An ACO Approach to Solve a Variant of TSP

Free registration required

Executive Summary

This paper is an investigation on the application of Ant Colony Optimization to a variant of TSP. This paper presents an Ant Colony Optimization (ACO) approach to solve a randomly generated TSP problem known as RTSP. TSP data sets, used in this research, are created randomly with coordinates in the range 0 to 100. The source code for the above has been developed in MATLAB 7. Ant Colony Optimization is applied on several randomly generated TSP data sets. The results obtained from the model has been collected and analyzed based on several criteria like convergence time, quality of solution, and length of the tour.

  • Format: PDF
  • Size: 339.84 KB