Use in non-routing problem
hanslovsky opened this issue · 0 comments
hanslovsky commented
Thank you for your great work contributing a TSP solver to the Java open source community!
I used TSP for sorting images based on some similarity criterion. At the time, I used the concord solver but
- I have to write the distance matrix to a file for consumption by concord in a separate process
- concorde requires commercial CPlex solver
I just came across jsprit and would like to explore it as a replacement for the concorde solver. jsprit is centered around vehicle routing but I truly only need a TSP solver for a distance matrix that I provide. Do you have an example for such a use case? In summary, I would like to:
- Populate a matrix with distances (
VehicleRoutingTransportCostsMatrix
looks like a promising candidate) that are not tied to any 2D or 3D location. - Build and solve TSP with these distances. Number of vehicles, capacity etc are not relevant for my problem.
What is the biggest TSP that you were able to solve?