Tag Info

New answers tagged

1

since the parameter you mentioned is only available via the asynchronous service documentation you've linked to, your best bet would be to make your call to it via a generic Geoprocessor Task. this approach allows you finer grain control both in defining execution type and specifying parameters by name.


0

There could be many approaches for any problem. The above mentioned solutions are really helpful yet I am giving you an other solution/advice. Before applying pgrouting to your data, you have to turn your data into Network. By network I mean topological network where all rules are taken care of and there is no violation of the network rules. I am sure you ...


0

You could use the open source GraphHopper routing library. Very easy to setup and query via HTTP. (Note: I'm the author) We also offer a commercial Matrix API based on Gramaking such queries very fast but 1-2 would be only possible for something like 50 locations. More will take longer. Also we offer up to 1000 locations, but only for custom packages.


0

The findBestSequence parameter on the RouteParameters class should re-order the stops in the most efficient order (depending on whether you want shortest or fastest route), from the API help : Find Best Sequence Gets or sets a value indicating whether the analysis should reorder stops to find the optimized route. The default is false. Note using ...


2

You can use the pgRouting function pgr_nodeNetwork, which will create nodes at intersections of linestrings. So in your case it will split the linestring into two geometries. But there is a danger that intersections, that should not be connected (ie. over- or under-passes), will also get broken into two segments.



Top 50 recent answers are included