Could you give us a minimal reproducible example and some visuals so we can see what exactly it is you need...

Also, in case you were not aware of it, the traveling salesman problem is NP hard and thus an optimal solution can not be guaranteed when you have many points. There are approximation algorithms like in the package, but they are not perfect (though can be very helpful)