Instance | Algorithm | Average solution | Average (s) | Allowed (s) |
|---|
d198 | TA | 15781.2 | 125.4 | 300 |
| | DGAA | 15780.3 | 117.0 | |
lin318 | TA | 42029.7 | 176.6 | 500 |
| | DGAA | 42029.3 | 135.4 | |
pcb442 | TA | 50789.9 | 418.2 | 800 |
| | DGAA | 50782.2 | 399.2 | |
att532 | TA | 27686.8 | 524.8 | 1000 |
| | DGAA | 27686.4 | 482.5 | |
- The optimal combination of parameters get from lots of test issues is: ρ = 0.4, Q = 5, α = 1 and β = 1. Meanwhile, the number of the ants equals the amounts of the cities, and perform 25 trials (1500 iterations in each trial) on each problem. The experimental results are shown in Table 1, Table 2 and Table 3, where traditional algorithm stands for the MMAS algorithm, average is the average time required to find the best solution in a trial, allowed is the longest time allowed to be executed in each trial, and number means the number of trials to obtain the best solution. The numbers included in the name of the problems denote the numbers of cities for its corresponding problem. For the sake of convenient illustration, Traditional Algorithm [10] was noted as TA.
