Skip to content

This is a demonstration of an implementation of the Ant Colony Optimization implemented using ROOT, Python and the main logic written in C++

Notifications You must be signed in to change notification settings

papapana/cpp_ant_colony_optimization

Repository files navigation

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.

About

This is a demonstration of an implementation of the Ant Colony Optimization implemented using ROOT, Python and the main logic written in C++

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published