Routing through all streets

[log-konz]

Hello PTV-Team,

We have one challenging request from one of our customers that we can't solve without your help (if it is possible anyways):

The customer wants to calculate a route that navigates through all existing streets of one city / region. For this purpose, he wants to get these streets by providing a postal code only.
So the first question: Is it possible to get all streets for a specific region?

Provided we got these streets, the following should now be done: Every single street should be driven on in every possible direction, but only once. If a street is an one-way, the routing must be in one direction only, of course.

We have no idea if there is a way to solve this request.

Thanks for your time and your support in advance.

[Joost]

Is it possible to get all streets for a specific region?

Not directly out of the xServers. We can deliver raw data (either directly our through our subsidiary DDS) that should be able to supply you with the information you need.

Every single street should be driven on in every possible direction, but only once

We can't handle this. Our optimization algorithm are aimed at solving the Vehicle routing problem (https://en.wikipedia.org/wiki/Vehicle_routing_problem). You case is an Arc routing problem (https://en.wikipedia.org/wiki/Arc_routing).

I do not know the exact issues with occur when you try to solve arc routing problem with a VRP algorithm, just that the result are bad quality.