# Convert moving duration into routes

Which algorithm, that is based on open Street map takes the current GPS position, a duration and an average speed or way of transport(by foot, by bike or by car) and outputs possible routes, that start and end at the current GPS position and fulfill all criteria? That means, you start from a GPS position, you move around till the time has elapsed and when the time has elapsed, you should be at the same place where you started.

Usecase:

You are in a new country. You just arrived at your hotel. In one hour you are going to meet a friend of yours. The two of you agreed to meet at your hotel. You decide to get to know the close surrounding a little bit by walking. At the same time you want to be back in time. You would like to not see the same road again when you come back. So you grant GPS access in your mobile device, tell the amount of time that you have and that you don't want to see the same road again if possible. Then the program should output a series of routes that you can walk that fulfill those criteria.

• You need to be more specific. Please add an usecase/example at your post. Commented Sep 30, 2015 at 9:12
• @Mapper Done... Commented Sep 30, 2015 at 17:22
• Do you want something like a round tour implemented limited by a specific maximum time? There is a heuristical algorithm implemented in GraphHopper where you can have a look: github.com/graphhopper/graphhopper/pull/420 it tries to produce the maximum path forward and backward without visiting the same roads again Commented Oct 1, 2015 at 7:24
• @Karussell It can be round, it can be zig-zag. But it should avoid previously walked routes. Commented Oct 1, 2015 at 15:18