TSP algorithm #7
Description
The hard part. Take into account all of the system data and solve TSP. Be careful to the node relationships and types: navigation, elevation, descent. The solution should traverse all floors of a store. Multiple implementations are encouranged. Depending on the input size, multiple types of algorithms can be created (backtracking, SA, NN, etc.).
- https://github.com/apache/commons-math/blob/master/commons-math-examples/examples-sofm/tsp/src/main/java/org/apache/commons/math4/examples/sofm/tsp/TravellingSalesmanSolver.java
- https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/graph/TravelingSalesman.java
If possible, we can document if there are any existing APIs that can solve TSP given our data. If those services are free, we can commit to only reshape our models to fit their request paramaters.