UF: Adding the traveling salesman problem (TSP) linear programming version #230
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Adding the traveling salesman problem class with its corresponding test.
https://en.wikipedia.org/wiki/Travelling_salesman_problem
Description
Adding the traveling salesman problem combinatorial optimization problem to the set of problems. This problem comes with the function 'classical_optimization' which uses the 'docplex' solver, plot_solution which plots the 'networkx' graph for a given solution, and a
get_distance
function to get the total distance traveled from a given solution.Additionally, I added a subfolder to organize the tests for the problems.
Checklist
Type of change
Please delete options that are not relevant.
How Has This Been Tested?
the test is inside './tests/test_problems/test_tsp.py'