[pgrouting-users] problem with 2 edges with same endpoints

pgRouting pgrouting-users
1

I am having a problem with a route taking the long way around when two edges have the same nodes.

I have used dijkstra_sp_delta and astar_sp_delta and get the same results.

This is my first attempt to do routing and it works easily. I took my street db and added the routing stuff and went at it.

What could be causing the routing algorithm to take the long way when choosing between the two edges?

Thanks,

Worth Lutz

2

On Fri, Oct 14, 2011 at 12:32 AM, Worth Lutz <wal3@mindspring.com> wrote:

I am having a problem with a route taking the long way around when two edges have the same nodes.

I have used dijkstra_sp_delta and astar_sp_delta and get the same results.

This is my first attempt to do routing and it works easily. I took my street db and added the routing stuff and went at it.

What could be causing the routing algorithm to take the long way when choosing between the two edges?

Dijkstra and Astar algorithm route from node to node with a cost assigned.
They don’t check if there are more than one possibility and take just the first one.

You can either split “parallel” ways into two, or you can use Shooting Star, because it routes from road segment to road segment.

Daniel

–
Georepublic UG & Georepublic Japan
eMail: daniel.kastl@georepublic.de
Web: http://georepublic.de

3

Thanks for the explanation. I'll keep plugging at it.

Worth

  _____

From: pgrouting-users-bounces@lists.osgeo.org
[mailto:pgrouting-users-bounces@lists.osgeo.org] On Behalf Of Daniel Kastl
Sent: Thursday, October 13, 2011 12:00 PM
To: pgRouting users mailing list
Subject: Re: [pgrouting-users] problem with 2 edges with same endpoints

On Fri, Oct 14, 2011 at 12:32 AM, Worth Lutz <wal3@mindspring.com> wrote:

I am having a problem with a route taking the long way around when two edges
have the same nodes.

I have used dijkstra_sp_delta and astar_sp_delta and get the same results.

This is my first attempt to do routing and it works easily. I took my
street db and added the routing stuff and went at it.

What could be causing the routing algorithm to take the long way when
choosing between the two edges?

Dijkstra and Astar algorithm route from node to node with a cost assigned.

They don't check if there are more than one possibility and take just the
first one.

You can either split "parallel" ways into two, or you can use Shooting Star,
because it routes from road segment to road segment.

Daniel

--
Georepublic UG & Georepublic Japan
eMail: <mailto:daniel.kastl@georepublic.de> daniel.kastl@georepublic.de
Web: <http://georepublic.de/&gt; http://georepublic.de

  _____

No virus found in this message.
Checked by AVG - www.avg.com
Version: 2012.0.1831 / Virus Database: 2090/4549 - Release Date: 10/13/11