[pgrouting-users] Shortest Path with varying costs.

[Stephen Woodbridge]

On 1/30/2012 4:04 PM, Stephen Woodbridge wrote:
> On 1/30/2012 3:48 PM, Roberto Oropeza Gamarra wrote:
>> Hello,
>>
>> I need to calculate the shortest path, taking into account that the cost
>> of traveling beetween edges varies according to the time of day. I have
>> a table of edges [my_edges(id, source, target, ...)] and other table for
>> cost and reverse_cost with columns especifying the time of day in which
>> that cost is applicable [my_costs(cost, reverse_cost, start_time,
>> end_time,...)], the cost is the number of minutes it takes to traverse
>> from source to target.
>>
>> Is there a way pgRouting can help me to calculate this special shortest
>> path?
>
> I have not tried to setup a problem and use the code for this problem,
> but we do have gsoc_tdsp branch in git that is supported to solve this
> time dependent shortest path problem. Jay Mahadeokar implemented this
> and I believe he monitors this list, so if you have some specific
> questions, check the wiki first and then post to the list and we will
> see if we can help.

If your routes are shorter and the costs do not vary from the start of 
the route to the end of the route, then you can just do a join as Jorge 
mentioned and use the regular solutions.

-Steve