ACO archivos : baobab soluciones

Photo by Andy Beales on Unsplash

Three different methods to solve the travelling salesman problem

Post author:baobab
Post published:1 Oct, 2020
Post category:Algorithm

The travelling salesman problem (TSP) consists on finding the shortest single path that, given a list of cities and distances between them, visits all the cities only once and returns to the origin city.

Photo by Poranimm Athithawatthee from Pexels;

Ant Colony Optimisation Algorithm

Post author:baobab
Post published:4 Dec, 2019
Post category:Algorithm

In the discipline of Operations Research, the Ant Colony Optimization algorithm (ACO) is a technique to solve complex combinatorial problems inspired by the behaviour shown by ants in nature, swarm intelligence.