or
https://github.com/DEAP/deap
Operations Research Algorithms
The genesis of this code is from an Operations Research course at the UC Davis MBA program with Dr.David L Woodruff:
http://faculty.gsm.ucdavis.edu/~dlw/
You can see a solution here: https://github.com/noahgift/or/blob/master/greedy-random-tsp.py
(.venv) codespace ➜ ~/workspace/or (master ✗) $ ./greedy-random-tsp.py 10
Running simulation 10 times
Shortest Distance: 129
Optimal Route: [(b'URS', b'WFC', 0), (b'WFC', b'GPS', 1), (b'GPS', b'PCG', 1), (b'PCG', b'MCK', 3), (b'MCK', b'SFO', 16), (b'SFO', b'ORCL', 20), (b'ORCL', b'HPQ', 12), (b'HPQ', b'GOOG', 6), (b'GOOG', b'AAPL', 11), (b'AAPL', b'INTC', 8), (b'INTC', b'CSCO', 6), (b'CSCO', b'EBAY', 0), (b'EBAY', b'SWY', 32), (b'SWY', b'CVX', 13)]
(.venv) codespace ➜ ~/workspace/or (master ✗) $ 