I'm totally new to QGIS but I really like it and would like to solve something more elaborated. I found a lot of threads and tutorials about how to solve the traveling salesman problem with QGIS but my 'problem' is a bit different.
I don't want to set a start and endpoint (at least no endpoint) but have multiple polygons and the goals is to 'visit' all of them. In fact the polygons are the districts of a city and I want to know which path to take to visit all of them while taking the shortest route. I also have a shapefile with the streets of course.
Maybe there are already solutions for this out there and I just didn't use the right wording in my search queries.