Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem

We propose a new construction procedure for ant colony optimization (ACO) algorithms working on the Euclidean traveling salesperson problem (TSP) that preserves the ordering on the convex hull of the points in the instance. The procedure is inspired by theoretical analyses for simple evolutionary algorithms that are provably more efficient on instances where the number of inner points of the instance is not too large. We integrate the construction procedure into the well-known Max-Min Ant System (MMAS) and empirically show that it leads to more efficient optimization on instances where the number of inner points is not too high.