se a modified version of the tsp python code
Budget: $10 – $30 USD
Use a modified version of the tsp python code ( tspMod.py ) that
attempts to find the shortest weighted route to all locations as
defined in the combined.pickle file. The value calculated is the
distance between any 2 cities times a weight. I have provided you with
the tspMod.py code and a set of weighted distance matrices that are
similar to proj02. 10 of these matrices are provided in the pickle
format.
attempts to find the shortest weighted route to all locations as
defined in the combined.pickle file. The value calculated is the
distance between any 2 cities times a weight. I have provided you with
the tspMod.py code and a set of weighted distance matrices that are
similar to proj02. 10 of these matrices are provided in the pickle
format.