This is a great Data Structures and Algorithms project for beginners. It highlights the contrast between Brute-Force and Ant Colony Optimization (ACO) for the Travelling Salesman Problem (TSP).
This project is for academic purposes only. It is not a developers project and draws inspiration from several sources.