OpenRouter 2009 SOC Ideas - Revision history

Wiki-Fpenarru: /* Mentor Candidates */

2009-04-06T15:53:15Z

Mentor Candidates

Dkastl: added Steve's ideas

2009-03-30T02:44:24Z

added Steve's ideas

Dkastl at 09:45, 27 March 2009

2009-03-27T09:45:37Z

Dkastl: initial version

2009-03-27T09:44:52Z

initial version

New page

* Back to the main OSGeo [[Google Summer of Code 2009]] wiki page.
* Back to the main OSGeo [[Google Summer of Code 2009 Ideas]] wiki page.

= OpenRouter 2009 SOC Ideas =

Enter ideas for development projects here. Note these are just suggestions - students are welcome to propose projects based on their own interests that relate to OpenRouter. Our current efforts are based on the pgRouting project. This routing library provides routing functionality to PostGIS/PostgreSQL.

You can read more about it at the [http://pgrouting.postlbs.org/ pgRouting project page]. There you can find the source code, tutorials, the project mailing list and various other informations.

To give you an idea about some possible SoC projects, here are some suggestions:

== Implement a bi-directional shortest path algorithm ==

So far pgRouting doesn't provide a bi-directional shortest path search implementation.

== Traveling Salesperson solver enhancement==

The current pgRouting Traveling Salesperson implementation doesn't allow to return to the start point.

== OpenStreetMap data import tool improvement==

The recently contributed OpenStreetMap data import tool has a couple of limitations, such as supported attributes, memory management, cross-platform support, etc..

== Add support for time constraints ==

Real-time shortest path searches are not implemented yet in pgRouting. What if network conditions change during a trip? An example could be train or bus schedules or time restrictions in road networks. Currently pgRouting algorithms don't take into account network these changes.

== Network layering support ==

This idea is a quite a challenging task. Network layering would allow the routing algorithm to change from more to less dense networks to enable long-distance routing.

= Mentor Candidates =

The following individuals are potentially willing to serve as OpenRouter/pgRouting mentors or co-mentors.

* Daniel Kastl
* Anton Patrushev

[[Category:Google Summer of Code]]

@@ Line 62: / Line 62: @@
 * Daniel Kastl
 * Anton Patrushev
+* Francisco José Peñarrubia
 [[Category:Google Summer of Code]]

@@ Line 11: / Line 11: @@
 == Implement a bi-directional shortest path algorithm ==
 So far pgRouting doesn't provide a bi-directional shortest path search implementation.
-== Traveling Salesperson solver enhancement==
+=== Network layering support ===
-The current pgRouting Traveling Salesperson implementation doesn't allow to return to the start point.
+This idea is a quite a challenging task. Network layering would allow the routing algorithm to change from more to less dense networks to enable long-distance routing.
-The recently contributed OpenStreetMap data import tool has a couple of limitations, such as supported attributes, memory management, cross-platform support, etc..
+== Open Router related ideas ==
-== Add support for time constraints ==
+Improved support for Navteq data loading. Import tool for TeleAtlas data or other network data sources.
-Real-time shortest path searches are not implemented yet in pgRouting. What if network conditions change during a trip? An example could be train or bus schedules or time restrictions in road networks. Currently pgRouting algorithms don't take into account network these changes.
+=== General purpose Routing library ===