TRAVELING SALESMAN PROBLEM: “a person must find the shortest route by which to visit a given number of cities, each exactly once … For just 15 cities, there are billions of route possibilities.”
https://scholar.google.es/scholar?q=swarm+cognition+in+insects+and+pheromones&btnG=&hl=en&as_sdt=0,5