Travelling salesman problem using ant colony optimization
Answers
Answered by
0
Ant colony optimization methodology is presented for symmetric cities of travelling salesmen problem in this paper. However in the iteration 5, all the ants are converged to the minimum distance. The pheromone (τ) distribution for iteration, 2, 3, 4 and 5 are updated for each iteration.
Answered by
0
Explanation:
Ant colony optimization methodology is presented for symmetric cities oftravelling salesmen problem in this paper. ... However in the iteration 5, all the ants are converged to the minimum distance. The pheromone (τ) distribution for iteration, 2, 3, 4 and 5 are updated for each iteration.
Similar questions