A general question about routing problem: I am working on waste collection problems and I am having some trouble with some routing problems (the truck has to pass by every bin). So far I have tried a few things:
• GRASS traveling Salesman solver (in QGIS and GRASS directly)
• GVSig traveling salesman but not with better results.
• GrassHopper (https://www.graphhopper.com/)
TSP in GRASS seems to work fine is you have few points and relatively large distances between points. But because I have a large (100-300 points in close proximity) the path created is not realistic, mostly due to U-Turn problems (the shortest path between 3 points might include the equivalent of U-Turn in the middle of the street which on in reality is not possible). Did anybody solve this kind of problem, preferably with opensource tools (I know that ArcGIS have this kind of capabilities and I am trying to see if I can get there with it, but I generally prefer opensource)
Since these results are not optimum I end up using the graph road plugin (by the way is there a way to export a newly created path to an already existing file to create a full route, like it is possible in road graph with the network tools in QGIS 3?) but it is really time consuming.