Hi Stefan, Please look at pgRouting library. We implemented Shooting* algorithm, which is edge-based algorithm with turn restrictions. I guess it is what you need. It was edge cost and edge-to-edge passage cost, which depends on the path you came from to the current edge.
The description is here - http://pgrouting.postlbs.org/wiki/ShootingStar And there is pretty nice tutorial - http://www.davidgis.fr/blog/index.php?2008/07/24/349-shooting-star-usage-example-with-turn-restriction Anton. On 9/20/08, Stefan Pflumm <[EMAIL PROTECTED]> wrote: > Hello, > > I'm searching for an routing algorithm who can handle this two properties: > > 1. the edge weight function c(E) of the edge E depends on the costs of > the predecessor edges. A* for example, can't handle this, because it > connects existings paths without updating the successors. If the path > previous to an edge changes and the edge is already expanded the costs > of the edge and all successors will also change. > > 2. the edge weight function c(E) of the node N depends on the successor > edge. For example: E_1 and E_2 are neighbour edges of E. c(E) to E_1 > must be not equal to c(E) to E_2 > > I hope somebody can give me an advice, thanks > > Stefan > > > > > > _______________________________________________ > Routing mailing list > [email protected] > http://lists.openstreetmap.org/listinfo/routing > _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
