Travelling salesman problem with 3opt move and 2opt perturbation
-
Updated
Jan 7, 2019 - Python
Travelling salesman problem with 3opt move and 2opt perturbation
Python implementation of different algorithms for solving basic TSP.
A case study exploring capacity expansion options for a fulfillment style distribution system.
Navigation System on USC Campus
This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are 6 different combinations and each can be run individually or in suite as part of a benchmark test.
To associate your repository with the 3opt topic, visit your repo's landing page and select "manage topics."