Sample Runs

Let's now look at a couple of sample runs of the ant algorithm for TSP.

The first run provides a solution for a 30-city TSP (see Figure 4.7). The parameters for this problem were ± = 1.0, ² = 5.0, = 0.5, and Q = 100.

Figure 4.7: Sample solution for the 30-city TSP.

The second run presents a 50-city TSP solution (see Figure 4.8). The parameters used for this solution were identical to the 30-city TSP.

Figure 4.8: Sample solution for the 50-city TSP.

Each of these solutions was found in less than five tours . The number of ants in each run was equal to the number of cities.