The goal of routing is usually finding the route with minimum cost. That cost can be distance, time, calories or some other value but still our desire is to find the route that costs least.
But what if I want to find a route with desired cost? Not the fastest route but the route that will take around an hour (let's assume I have an hour to walk from point A to B and I want to see as much on my way there as I can). Or that I want a route that will be around 2 kilometres long.
Using a standard routing algorithm and rejecting the proposed routes until one with desired cost is found will probably lead to something like "Head straight from A to B and then circle around B a few times".
Is there any previous work on this? Does anyone have any ideas?