For questions related to the ant colony optimization (ACO) algorithms, which are population-based and stochastic metaheuristics that can be used to find approximate solutions to difficult optimization problems, such as the TSP. In ACO, artificial ants (the agents) iteratively search for good solutions to a given optimization problem. To apply ACO, the optimization problem is transformed into the problem of finding the best path on a weighted graph.
For more info, have a look at http://iridia.ulb.ac.be/~mdorigo/ACO/ and https://en.wikipedia.org/wiki/Ant_colony_optimization_algorithms.
