Tag Info

Hot answers tagged

6

I think that the type of software you are looking for is called a chart plotter software. There are several solutions used in navigation, where using a laptop is more and more common. I will not list here the solutions using dedicated hardware (AIS/navigation systems for example). Amongst paying options you have the "best seller" called MaxSea ...


5

We are working on a multimodal routing for Austria (also for pedestrians). What I can say till now: You need the data: It took at least 4 years and even longer to collect all the necessary walkways, barriers, steps, opening times, streets, railways, bikeways, ferrys, and, and and...and its still going on You need a router which can interprete theses graphs ...


4

The link given by MappaGnosis is the first attempt to implement Graph theory algorithms in Python (by Guido van Rossum, the creator of Python). Since, many modules were developed: Graph theory network routing network One of the most comprehensive is NetworkX, mentioned before in GS it can read or write shapefiles natively (thanks to bwreilly in ...


3

No need for expensive proprietary solutions, this is called the Traveling Sales Person (TSP) problem and luckily for you this PostGIS extension PG Routing already has this cracked. Better yet it's free and opensource! Just vanilla web app stuff to write some back end code to that you can run those queries over HTTP. Happy mapping!


3

With a bit of comparison you can: detect the point clicked find the feature closest to this point use the selectFeatureControl to programatically select this feature see: http://jsfiddle.net/XfEmn/ (note, I use underscore.js _.min function, you could of course do this with a foor loop etc, the clue is to loop the features and get the one with the ...


3

I have succeded in creating a WayTagResolver that parses the duration and puts it into the osm_meta column. I therefore share the solution here, for others to use this or deveelop futher on it. Download osm2po In the plugins folder, extract osm2po-plugins-4.7.7-src.zip Enter the extracted folder, and STAY there :) Create a java file for storing the ...


3

The FerryDurationResolver is absolutely correct. Good work! But you can make things easier. I assume you are using Eclipse. Then just create a new project. Add osm2po.jar as library and create a new Run-Config. Develop the FerryDurationResolver as usual. Debugging is possible. When everything works as expected, just create a jar-file using Eclipse's ...


3

I think you need to build another table that defines all the routes in is as combinations of other routes. Then you query this table and join to the actual routes to get the geometry. If the query is for 'from station' to 'to station' and each section has a 'from station and 'to station'. But you want to include routes that take in multiple sections, you ...


3

We are working on a very similar problem at the moment and have been using a different approach. We loaded all of our data into a PostgisS enabled PostgresQL database and used the data to construct a node/vertice network which is then snapped to the road network. We then installed pgRouting and used the pgr_tsp function to create our recommended route. The ...


3

OSRM has an routing API that can do that. You can find the documentation for the API here. But you have to put them in the order of appearance beforehand. To route via certain coordinates list them in the query string in the order of appearance (currently limited to 25 max points and to vehicle routing only): ...


2

The Difference Tool should do what you want as @Baltok has suggested. Just set the streets layer as the input layer and the flood layer as the difference layer. This should result in a new streets layer but with the flooded area removed. You might want to check this tutorial for more details.


2

Google Maps has an option to do pedestrian routing. I tested it for the San Antonio riverwalk, and it seems to work (this path cannot be driven). I'm sure less popular walkways are missing from their network. I'm not sure if their algorithm handles large open spaces. I suspect they are using a graph based approach. Finding the best path across a large ...


2

'Yes' is the short answer. However, you will need to implement the A* algorithm. This link may be helpful for your implementation. To read the shapefile you will probably want to use the GDAL/OGR python libraries (and if you are on Windows I strongly recommend the 'gisinternals' link).


2

I have recently implemented a similar thing. You need a routable road graph. Have a look at underdark's tutorial on using PGRouting on OSM data. It will tell you how to set up a routable graph. Once you have the routable graph you will have a set of nodes and a set of roads. The nodes correspond to the start and end points of the road lines. As your ...


2

Assuming a route is a single polyline and you can have multiple points along it for any given time then one method is: Use spatial Join geo-processing tool with closest relationship and "one to many" set. Run summary stats tool grouping by route ID and summing the count field. Join the summary stats table back to the route layer by route ID.


2

Try routeXL I'm not sure how many nodes you can max out on though. Here's an example of a 12 city output To add destinations, find them in the search bar and press enter. click on the Address drop down to change/modify the addresses you just added Click on find route for it to compute it HEre's a screenshot of a run I did:


2

Yes, you are right. If you want to use a web service, that would require you having at least a little programming knowledge. If you decide to take on some programming, it would be really helpful if you had stored your trip pairs in PostGIS for example, because that way you could simply use PHP language for instance to fetch your trip pair data and load it to ...


2

The following code is part of a Python toolbox for 10.1. The Scale parameter is used to set the scale for panning and the Scale Factor parameter can be used to slightly zoom out (or in, though that's not really useful) so that some of the surrounding area is captured. from os.path import join shpin,field,pan,scale,factor,folder = ...


2

If you want to use ESRI Technology you'll need network data set at your data base. The second important component is server and a application for this You'll need ArcGIS Server to publish it to the internet. and a website.


2

I've had a lot of success with the Mapsforge library. They have writer that is a plugin to osmosis. They have a Compact file format for fast on-device rendering of OpenStreetMap data. There is an aligned project for routing, Graphhopper, which I've found to be quite user friendly.


2

You have not specified any mobile platform so i am answering here for the most popular android platform. If you want to render the map in android device you can then use mapsforge library. There is a plugin for osmosis called mapwriter that will help you convert the .osm data into .map data which can be rendered using the mapsforge library. .map is a binary ...


2

Yes. osm2po provides two Router-Families. The DefaultRouter belongs to the first one, which is only able to route from link to link (Vertex-IDs). All Routers with an "Ovl" in their names are not restricted to it. They all base on a second virtual OverlayGraph which extends the static network. In order to find a virtual point (source and target) on the ...


2

You might want to look at OpenTripPlanner. There's an instance set up here that includes the MTA GTFS feeds. It was built with the transit index included, which can be queried via its API to find the nearest stops. The API can also be queried to plan trips. An example query, to find stops near a point: ...


2

I assume that you did a copy parallel equally on the left and the right of your original roads. So, in order to clean up a bit, you could create a buffer polygon of the same size and dissolve all the boundaries. Because you have advanced licence, you can set up flat ends, it will be nicer in your case) Use "feature to line" with your lines in order to ...


1

Ended up finding what I was doing wrong, my input stops were: 38.868047,-9.106938;38.630616,-8.915192 after changing to -9.106938,38.868047;-8.915192,38.630616 it works as expected, but still I don't understand why they are reversed in ArcGIS, Google Maps expects them in the way I was inputting them before.


1

From the osm2po perspective there is no difference between ferries and normal roads. Have a look into the config: wtr.tag.route.ferry = 2, 1, 10, ferry wtr.tag.route.shuttle_train = 2, 2, 50, rail|car wtr.tag.railway.rail = 3, 3, 50, rail wtr.allow.motor[car|_vehicle].[yes|destination] = car There might be a few reasons why ...


1

I think GeoMajas is a good choice. For routing purposes I want to introduce you Graphhopper. It's still a young project, but it's java, it's incredibly fast and there are ready to use applications to route either on a web server or on the mobile device itself based on openstreetmap data. So if you have no problems to use openstreetmap and want to route on a ...


1

I'm not convinced that Calibrate Routes is the right tool for what you are trying to do but, in any event, Error 000443 is documented here where it says: Description This error occurs when one or more features are rejected by the Create Routes process. A text file is created in the temporary file path to store information about those features. ...


1

In ArcGIS Network Analyst, during the add locations procedure (for any kind of locations, like stops or barriers), you can set: The search tolerance, that limits the distance from the location point to network lines for network analyst to consider them valid; And the Snap to position along line, that will move you point to the nearest network element. I ...


1

Mostly an AStar is faster than a Dijkstra. But it's a superstition that it is always faster. Imagine an area shaped like a circle. Routing from the center to a border point lets expand a Dijkstra to the worst case whereby an AStar shows its optimal behavior. Driving the reverse route an AStar will expand to almost the same worst case. But in addition, an ...



Only top voted, non community-wiki answers of a minimum length are eligible