Browse Articles

Ant Colony Optimization Algorithms with Multiple Simulated Colonies Offer Potential Advantages for Solving the Traveling Salesman Problem and, by Extension, Other Optimization Problems

Wildenhain et al. | May 22, 2015

Ant Colony Optimization Algorithms with Multiple Simulated Colonies Offer Potential Advantages for Solving the Traveling Salesman Problem and, by Extension, Other Optimization Problems

Ant colony optimization algorithms simulate ants moving from point to point on a graph and coordinate their actions, similar to ants laying down pheromones to strengthen a path as it is used more frequently. These ACO algorithms can be applied to the classic traveling salesman problem, which aims to determine the lowest-cost path through a given set of points on a graph. In this study, a novel multiple-colony system was developed that uses multiple simulated ant colonies to generate improved solutions to the traveling salesman problem.

Read More...