Route inspection problem - How to ride all the rouds?

Discussion created by honzaproch on Mar 22, 2011
Hi everyone,

I solve the problem, how can I model the situation in Network analyst, to use the shortest rout (best rout) "car" visited all the rouds?

Simple example: I have a network of roads, and when I went through winter maintenance gritting vehicle visited all roads and cleared them.

Does anyone have any idea ?

Thank you, very much.