Research Article
Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem
Table 1
Parameters for the calculation.
| | (α,β) | ρ | N of agents | | |
| Strict ACO model | (1, 5) | 0.9 | N of cities | 4 | - | Tolerant ACO model | (1, 5) | 0.9 | N of cities | 4 | 2 or 3 | Ant System | (1, 5) | 0.9 | N of cities | 4 | - |
|
|