[pgrouting-users] Some ideas for upcoming GSoC

Stephen Woodbridge woodbri at swoodbridge.com
Sat Feb 25 17:30:27 EST 2012 

On 2/25/2012 5:18 PM, Dave Potts wrote:
> On 24/02/12 02:18, Stephen Woodbridge wrote:
>
> you might want to careful as to which language you use, part of the dd
> stuff is written in C++ not C and that has all sorts of problems when
> being interface to C.
> Dave.

Right! If you look at the TRSP branch you will see that I have one 
wrapper in C the calls the postgres api for collecting data from the 
database and stuffing it into structs. That in turn calls a very simple 
C++ function the creates a C++ object and passes the C structs to that.

You have to plan on an API to pass data cleanly from C to C++ without 
additional copying of data about, but it can be done with a little 
thought and planning.

-Steve

>> We are also interested in repackaging the pgrouting code so that it is
>> usable outside of the postgres database, much the way Max has
>> integrated it into Spatialite. The idea is very simple to develop core
>> algorithm modules and then wrap them into pgrouting but to also keep
>> in mind that the core could be wrapped into an open API that could be
>> used elsewhere.
>>
>> I would love to see this as a GSoC project.
>>
>> Taking this approach, things like the "contraction hierarchies"
>> algorithm fit better into the over packaging. All great ideas boil
>> down to somebody has to do something and as I have mentioned in other
>> emails, we are trying to get a new developer to work with the project
>> and to get him trained.
>>
>> -Steve
>>
>> On 2/23/2012 8:00 PM, Daniel Kastl wrote:
>>> Hi Max,
>>>
>>> Yes, we thought about it already and it's on the GSoC ideas list of
>>> 2010.
>>> We even had a student in 2010 from Karlsruhe University, who picked that
>>> topic, but then left GSoC very early unfortunately due to lack of time.
>>> Other years candidates who picked that topic were not selected, because
>>> their proposals were not good enough.
>>>
>>> I thought the "contraction hierarchies" algorithm does a lot of
>>> pre-processing. That's why it's fast.
>>> Do you think this pre-processing is suitable for pgRouting and doesn't
>>> constrain it's flexibility to select data by attributes, geometries,
>>> etc.?
>>>
>>> But if we have a GSoC candidate with a strong and feasible proposal for
>>> "contraction hierarchies" (and at least two mentors, who will support),
>>> such a candidate's proposal would be probably ranked high.
>>>
>>> Daniel
>>>
>>>
>>> On Fri, Feb 24, 2012 at 8:57 AM, Max Weninger<max.weninger at gmail.com
>>> <mailto:max.weninger at gmail.com>>  wrote:
>>>
>>>      Hi
>>>
>>>      Has the "pgrouting team" ever thought about implementing
>>>      a routing solution based on "contraction hierarchies"
>>>
>>>      Details about the concepts can be found here
>>>      http://algo2.iti.kit.edu/routeplanning.php
>>>      http://code.google.com/p/monav/wiki/ContractionHierarchies
>>>
>>>      Example implementaions e.g. here
>>>      http://project-osrm.org/
>>>      http://code.google.com/p/monav/
>>>
>>>      Routing with such engines is extremely fast (milisecs)
>>>      even for really large networks
>>>
>>>      Regards
>>>
>>>      max
>>>
>>>      On Thu, 16 Feb 2012 14:52:46 +0900
>>>      Venkatesh Raghavan<raghavan at media.osaka-cu.ac.jp
>>>      <mailto:raghavan at media.osaka-cu.ac.jp>>  wrote:
>>>
>>>       >  Dear All,
>>>       >
>>>       >  As most of you must be aware, the
>>>       >
>>>       >  Google Summer of Code 2012 has been announced [1,2]
>>>       >
>>>       >  Some ideas that comes to my mind are
>>>       >
>>>       >  1) Implementing of map-matching algorithms as of the pgRouting
>>>       >  function. Python code for the algorithms that we implemented
>>> in 2010
>>>       >  (See http://cs-test.ias.ac.in/cs/Downloads/article_45523.pdf)
>>>      could be
>>>       >  made available and the main work would be to integrate/improve
>>>       >  them for implementation as pgRouting and/or SORouting (see item 2
>>>       >  below)
>>>       >
>>>       >  2) Implementing routing as a service. a) Use Web Feature Service
>>>       >  (WFS) as input b) implement routing functions as Web Processing
>>>       >  Service (WPS) c) Publish
>>>       >  routing result as WFS. That would be SORouting (Service Oriented
>>>       >  Routing instead
>>>       >  of pgRouting. Since I am also a ZOO-Project (www.zoo-project.org
>>>      <http://www.zoo-project.org>) PSC
>>>       >  member which is a OGC compliant open-source WPS implementation, I
>>>       >  would take this opportunity to promote the use of ZOO for
>>>       >  implementing SORouting.
>>>       >
>>>       >  3) Route selection based on multi-criteria decision model to
>>> enable
>>>       >  alternative
>>>       >  route selection based on conditions at the destination. For
>>> example,
>>>       >  route to
>>>       >  the nearest hospital depending not only upon road conditions
>>> but also
>>>       >  conditions at several destination hospitals (bed availability,
>>>       >  availability of
>>>       >  medicare specialists, availability of ICU etc). The condition of
>>>       >  destination could be implemented using the OGC SOS standard.
>>>       >  Regarding multi-criteria decision using AHP (analytical hierarchy
>>>       >  process). There are several literature available [3],[4]. My
>>> student
>>>       >  Sittichai (who writes
>>>       >  on the pgRouting users list) has already started some work and
>>> could
>>>       >  perhaps take up the work if he finds a mentor.
>>>       >
>>>       >  Best
>>>       >  Venka
>>>       >
>>>       >  P.S. Also Cc to ZOO-PSC since there may be some mentors there
>>> to help
>>>       >  with the WPS implementation for SORouting
>>>       >  ------
>>>       >  Prof. Venkatesh Raghavan
>>>       >  Osaka City University
>>>       >  Japan
>>>       >
>>>       >  [1]http://www.google-melange.com/gsoc/homepage/google/gsoc2012
>>>       >  [2]
>>>       >
>>>
>>> http://google-opensource.blogspot.com/2012/02/google-summer-of-code-2012-is-on.html
>>>       >  [3]
>>> http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5567840
>>>       >  [4]
>>>       >
>>> http://www.tandfonline.com/doi/abs/10.1080/13658810601135692#preview
>>>       >
>>>       >
>>>       >  _______________________________________________
>>>       >  Pgrouting-users mailing list
>>>       >  Pgrouting-users at lists.osgeo.org
>>>      <mailto:Pgrouting-users at lists.osgeo.org>
>>>       >  http://lists.osgeo.org/mailman/listinfo/pgrouting-users
>>>
>>>      _______________________________________________
>>>      Pgrouting-users mailing list
>>>      Pgrouting-users at lists.osgeo.org
>>> <mailto:Pgrouting-users at lists.osgeo.org>
>>>      http://lists.osgeo.org/mailman/listinfo/pgrouting-users
>>>
>>>
>>>
>>>
>>> --
>>> Georepublic UG&  Georepublic Japan
>>> eMail: daniel.kastl at georepublic.de<mailto:daniel.kastl at georepublic.de>
>>> Web: http://georepublic.de<http://georepublic.de/>
>>>
>>>
>>> _______________________________________________
>>> Pgrouting-users mailing list
>>> Pgrouting-users at lists.osgeo.org
>>> http://lists.osgeo.org/mailman/listinfo/pgrouting-users
>>
>> _______________________________________________
>> Pgrouting-users mailing list
>> Pgrouting-users at lists.osgeo.org
>> http://lists.osgeo.org/mailman/listinfo/pgrouting-users
>
> _______________________________________________
> Pgrouting-users mailing list
> Pgrouting-users at lists.osgeo.org
> http://lists.osgeo.org/mailman/listinfo/pgrouting-users

More information about the Pgrouting-users mailing list