autorouting in c#

D

David

Hi all,

I am at the feasibility stage of a project at the moment.

The core of the project is an autorouting system, along the lines of MS
Autoroute, though substantially different.

In the same way that I enter a start point and an end point, I need to
calculate a route between them. Also as in autorouting, I will need to
somehow add a weighting to a potential path or waypoint.

This will be developed in ASP.NET, .NET 2.0 or 3.5 (not sure which yet, but
probably 3.5 so that I get experience) and in C#.

Any links on theory or sample code would be very much appreciated.

Best regards,
Dave Colliver.
http://www.AshfieldFOCUS.com
~~
http://www.FOCUSPortals.com - Local franchises available
 
F

Family Tree Mike

Peter Morris said:
Maybe this will help?

http://en.wikipedia.org/wiki/Shortest_path_problem



--
Pete
====
http://mrpmorris.blogspot.com
http://www.capableobjects.com - Think domain, not database
Click to expand...

That is the shortest path, however the more common goal is minimizing time.
For this you need more data at the nodes to determine the weight of a given
path. You also need the expected speed along each road sement.

For example, think about driving arround and coming to a stop light. Your
route may have a longer time added to it if you are waiting to turn left at
the light. Right turns are easy and add very little (usually), while
straight adds some non-zero amount, due to occasionally hitting a light.

Of course all of this depends greatly on the underlying data and whether it
supports all of this.

Mike
 
F

Fred Mellender

A while back I wrote some graph algorithms in C# . You can download the
book (in PDF) and the library for free at
http://www.lulu.com/content/1995848. Various techniques (including A*, Beam
Search, Simulated Annealing) are discussed which might be of use to you. I
am now working to adapt these to parallel search for use on systems with
multiple cores.
 
D

David

My app is not too concerned about time, just to ensure the waypoints will be
met. There will be some timings involved, but not really a case of how long
it will take to get to a node.

I am in the UK, so we have to stop at a stop light. (OT: I do quite like the
US idea of being able to turn with traffic... would relieve a lot of the
congestion here.)

I think each node will have a dynamic weighting based on location from the
final destination. The closer to the destination, the higher the weight.
Now, I am waffling on here with this, but this is how I imagine it
eventually working.

Best regards,
Dave Colliver.
http://www.AshfieldFOCUS.com
~~
http://www.FOCUSPortals.com - Local franchises available
 
F

Family Tree Mike

David said:
I am in the UK, so we have to stop at a stop light. (OT: I do quite like the
US idea of being able to turn with traffic... would relieve a lot of the
congestion here.)
Click to expand...

Ah yes, but all of you are driving on the wrong side of the roads, which
can't help the situation.... :)
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Similar Threads

System.Diagnostics.Process to run DIR 2
Linq 3
Selecting a variable value with Linq 5
Problem compiling a simple library 1
Looping through Linq fields 5
SMTP Server 1
Linq to SQL Grouping 2
How do I do this in Linq 3

Top