[pgrouting-users] Shortest Path with varying costs.
Roberto Oropeza Gamarra
oropezaroberto at gmail.com
Mon Jan 30 17:41:04 EST 2012
Yes, I'm already doing that, but the problem is: let's go from node A to
node C, assume the travel lasts three hours, if I use a join using my_cost
and my_edges with the time '10:00' it will travel from A to C as every path
is traversed at 10:00, it will ignore the fact that when you get midway A -
C it is 11:30 and the traverse costs (i.e. time used to travel the nodes)
has changed, so it will not be the shortest path, instead it will be the
shortest path assuming we are frozen in time...
Hard, isn't it? Some idea?
El 30 de enero de 2012 17:04, Jorge Eliécer Osorio Caro <
jorgeliecer.osorio at gmail.com> escribió:
> I think that you need to make a inner joint into my_cost according the
> time and pass the cost and reverse_cost, where match that time with and
> edge id.
> 2012/1/30 Roberto Oropeza Gamarra <oropezaroberto at gmail.com>
>> 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
>> Thanks, Roberto.
>> Pgrouting-users mailing list
>> Pgrouting-users at lists.osgeo.org
> Pgrouting-users mailing list
> Pgrouting-users at lists.osgeo.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Pgrouting-users