Hi Jay,<div><br></div><div>In my opinion time dependent routing is a nice idea and a feature you can hardly find in existing routing libraries. I haven't seen any open source implementation yet. Someone else knows one?</div>
<div><br></div><div>Currently pgRouting takes into account the network loaded when running the query. But it could happen, that network conditions change while travelling in the network, right? For example one could reach a road that is closed on certain times. </div>
<div><br></div><div>It could be a very cool feature, if pgRouting could support even changes during travel time. So personally I would prefer such a project idea over one to speed up shortest path computation.</div><div>
<br>
</div><div>Daniel</div><div><br></div><div><br></div><div><br></div><div><br><br><div class="gmail_quote">2011/3/28 Jay Mahadeokar <span dir="ltr"><<a href="mailto:jai.mahadeokar@gmail.com">jai.mahadeokar@gmail.com</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Hi,<br><br>I was looking at GSoc 2011 ideas page and Adding support for time constraints seems to be one of the ideas. I read two papers on the topic which are an extension to (two of the current best) techniques for speeding up shortest path algos. <br>
<br><a href="http://algo2.iti.kit.edu/english/1222.php" target="_blank">1. Time Dependent Contraction Hierarchies</a> - an extension to contraction hierarchies problem that we have somewhat discussed in the Network layering Support thread, and we have not reached to any specific conclusion there.<br>
<br><a href="http://portal.acm.org/citation.cfm?id=1431038" target="_blank">2. Time Dependent SHARC Routing</a> - which is an extension to SHARC technique.<br><br>I guess, if we implement one of the above preprocessing technique, the extension will be a relatively simple task. Do you have any other approach towards implementing the time constraints? As we have already found, the implementation of the Contraction hierarchies will take significant brainstorming and effort.<br clear="all">
<br>-- <br>Regards,<br><font color="#888888">-Jay Mahadeokar<br><br>
</font><br>_______________________________________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org">pgrouting-dev@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/mailman/listinfo/pgrouting-dev</a><br>
<br></blockquote></div><br><br clear="all"><br>-- <br><span style="font-family:arial, sans-serif;font-size:13px;border-collapse:collapse">Georepublic UG & Georepublic Japan<br>eMail: <a href="mailto:daniel.kastl@georepublic.de" style="color:rgb(66, 99, 171)" target="_blank">daniel.kastl@georepublic.de</a><br>
Web: <a href="http://georepublic.de/" style="color:rgb(66, 99, 171)" target="_blank">http://georepublic.de</a></span><br>
</div>