[RouterGeocoder] building different layer for routing.

[Stephen Woodbridge]

Roni,

Thank you for filling us in on what you have done so far.
If you and your colleague are both students it would be great if you 
want to apply under the Google SoC, but you need to get registered and 
get your initial proposal in quickly as time is running out. Regardless 
of SoC or not, I think you guys would be great addition to OpenRouter 
and we would be happy to see you contribute.

We are still somewhat unstructured here, but I would like to see this 
project of yours move forward under OpenRouter. Our goal is to build a 
commercial grade router that is released under an OpenSource license 
like MIT-style license similar to what is used by mapserver:
     http://mapserver.org/copyright.html#license
One of the reason for using this style license is that mapserver has 
been very successful at obtaining funding for various development 
activities from corporate sponsors that do not want to deal with the GPL 
licenses. We feel that we can potentially do the same thing here which 
will help us to build a more viable community around OpenRouter and 
eventually grow submit it for OSGeo incubation. I think the key to all 
this is getting some enthusiastic developers and users and get some 
working code that can demonstrate that we can build good working tools.

Best regards,
   -Steve

Ashraf Hossain wrote:
> Hi Steve,
> 
> Can you tell us a little more about your current efforts?
> Do you have code already?
> -->Before joining graduate school I worked more than 3 years for a GIS
> software development organization.
> I completed a mapserver with special customized requirements with
> routing support.
> So the code is not available to me though I have successfully
> completed this and this is being used professionally in South Africa.
> If you have interest you can check this(this is a Java script not done
> by me.. I done the server part.)
> http://maps.afrigis.co.za/
> 
> 
> 
> What language is it in?
> Does it have dependencies on other libraries? Which?
> -->It is in C++. No its not dependent on any library.
> It is an completely independent project from any open source or any
> professional library.
> 
> 
> Can it be downloaded? Where?
> --> No this library is not open.
> 
> What features does it have? Are there any docs or notes?
> -> It has routing, routing with POI(point of interest) notified
> driving direction,online navigation client support(for their own
> mobile client),
> 
> 
> Do you have a plan for what you want to do next?
> --> I have plan to work almost similar work for OSGeo with some
> extended features like restriction. Dynamic edge weight changing
> option ,Distributed graph and shortest path generation on them(long
> term) and at last hybrid routing like google does in transit. Beside
> this the all kind of shortest path generation algorithm
> implementation(TSP,A* search,Chienese postman.).
> 
> 
> I already done some experiment and research I think I can contribute.
> If you like me to apply for Google Summer of Code I will apply along
> one of my ex-colleague(research partner) and friend  but in three
> months we both work on 2 different parts so that it can be very usable
> to the opensource community.
> 
> Regards
> Roni
> 
> 
> 
> 
> On Wed, Apr 1, 2009 at 2:37 AM, Stephen Woodbridge
> <woodbri at swoodbridge.com> wrote:
>> As a follow up on my previous post and to address a different aspect of
>> layer. Many routing engines take a layered approach to routing, in that they
>> break the routing into three stages.
>>
>> Stage 1: search from the start point using Dijkstra algorithm with some kind
>> of distance cut-off looking for access to a major route network.
>> Stage 2: reverse search from the end point using Dijkstra algorithm with
>> some kind of distance cut-off looking for access from a major road network.
>> Stage 3: Check if there is a common node between Stage 1 and Stage 2, if so
>> then declare victory. Otherwise, do an A* search from best node in Stage 1
>> to best node in Stage 2.
>>
>> If road class (at least major vs minor) is maintained for arcs in the graph,
>> then the router can choose to follow any or just major roads depending on
>> the state it is in.
>>
>> Best regards,
>>  -Steve
>>
>> Ashraf Hossain wrote:
>>> Hi Steve,
>>> I must want to work with Nestor if I  have the opportunity.
>>> I have also a research group with one of my close friend.
>>> We both are interested and we will be honoured if we can contribute.
>>>
>>> We already started our study about the performance for huge number of
>>> vertices.
>>> I think soon we can send some updates in this group, though we do not
>>> have huge big layer like USA and CANADA.
>>> If you have some suggestion about this please let me know.
>>> And another issue I have to know that if any operator updated their
>>> graph with USA and CANADA but if he want to add mexico(as a different
>>> layer) what should be our plan.
>>> Because if we make it as different graph then we have to start our
>>> plan in different way.
>>>
>>>
>>> And another one research about hybrid routing which is being used in
>>> google transit.
>>> If a user want to minimize bus route + taxi + walking in a single
>>> routing path generation,
>>> I already started thinking about this but the main problem is that how
>>> can we have the data?
>>>
>>> If anyone have some suggestions please let me know.
>>>
>>> With Regards
>>> Roni
>>> _______________________________________________
>>> Routergeocoder mailing list
>>> Routergeocoder at lists.osgeo.org
>>> http://lists.osgeo.org/mailman/listinfo/routergeocoder
>>