Implementation of the Ant Colony Optimization (ACO) algorithm for solving both the classical Travelling Salesman Problem (TSP) and a variant thereof with additional non-mandatory nodes. Additionally, implementing a few variants of ACO and comparing the results.