2
votes
2answers
101 views

Finding a route with desired cost not minimum cost

The goal of routing is usually finding the route with minimum cost. That cost can be distance, time, calories or some other value but still our desire is to find the route that costs least. But what ...
0
votes
0answers
71 views

Route through water polygons

I have a water-polygon grid shape file as shown (Each grid is 1latx1long): I have created this in QGIS and files (coastal lines and land polygons) selected from http://openstreetmapdata.com/data ...
12
votes
8answers
325 views

Looking for pedestrian-specific routing engines

Most of the applications providing pedestrian routing I see are sufficient for many needs but not optimal: you cannot cross open spaces like town squares, routing is in the middle of the street etc. ...
4
votes
2answers
176 views

Join two lines in one line

I have an array of Lines and I am using it to draw vectors in my map. I want to replace two superposed Lines (or have short distance between them) with one Line. Here is a picture that helps you to ...
1
vote
1answer
143 views

How to integrate road networks into Vehicle Routing Problem with Time Windows (VRPTW) algorithms?

I'm trying to determine how routing software integrate road networks. Is there a best-practice (or standard) as to what part of the routing solution road networks are inserted specific to Vehicle ...
2
votes
2answers
502 views

Should I implement TSP or Dijkstra?

I was asked to create a shortest path algorithm in java to use with OSRM. I want to create a route between some points (normally more than 3). The first one, will be the starting point and also the ...
3
votes
1answer
201 views

Create an optimized point layer derived from a road layer so that the driving distance between each point is x

Consider a classic state-wide or country-wide roadway network. I want to create a point layer, where each point is on the roadway network. This point layer will have each point separated by its ...
10
votes
1answer
321 views

Are there any intelligent travelling salesmen?

Jokes aside, I have had a routing problem that is almost a travelling salesman problem (TSP): the starting point is defined the end point coincides with the starting point each node has to be ...
35
votes
3answers
6k views

Are there newer routing algorithms (than Dijkstra, A*) in GIS databases?

There are works like Reach for A* from Microsoft researchers and Highway Hierarchies by Sanders and Schtolz (if I spell the name correctly) from Karlsruhe Uni. Both of them reduce the calculations ...
6
votes
1answer
623 views

Best routing algorithm for this scenario

Trying to work out the most appropriate routing algorithm to use for this situation. Even better if it's available as part of pgrouting or similar.. Here's the requirements: Specified date/time for ...