Skip to content

Latest commit

 

History

History
4 lines (3 loc) · 514 Bytes

README.md

File metadata and controls

4 lines (3 loc) · 514 Bytes

Solving the Traveling Salesman Problem in Python and C++ using the ROOT framework

In this document we are going to show how to develop an Ant Colony Optimization algorithm for solving the TSP using the data analysis software package by CERN, ROOT. The interface is in python to keep things simple but the logic is in C++.

Please view the ipynb file in this repo or the relevant blog post.