The goal of this project is to find K independent tours, that each visits all the nodes of the graph. Each two tours are independent, which means that they don't share a single edge.
To solve this problem we use a framework called cplex, from IBM. For more information about the framework click here. For more information about the KITTSP problem click here.