What is the best way to calculate the most efficient way for a garbage truck to travel on a road network in such a way that it covers both sides of the road. So it needs to travel each road in both directions and cul-de-sacs just once (around). Is there an example of someone having done this? The standard way calculates from point a to b but doesn't take into account street sides.
Thanks