In this article, Hennie de Harder discusses the implementation of Ant Colony Optimization (ACO) from scratch to solve the Traveling Salesman Problem (TSP) and the Quadratic Assignment Problem (QAP). The article explores the versatility of the ACO algorithm and provides tips for achieving improved solutions more rapidly. It also provides a problem definition for the TSP and code examples for creating a TSP instance. Overall, the article offers insights into the practical application of ACO in solving optimization problems.
