Questions Tagged With shortesthttps://help.openstreetmap.org/tags/shortest/?type=rssquestions tagged <span class="tag">shortest</span>enSun, 19 Apr 2020 15:27:12 +0100How to find shortest path between two points using overpass-turbo query?https://help.openstreetmap.org/questions/74284/how-to-find-shortest-path-between-two-points-using-overpass-turbo-query<p>Hello, I'm using overpass-turbo to download GeoJSON files. I'm trying to find (shortest) way between two points, but I don't know anything about query and can't really find how to learn to use that query. So I'm having two points with their names, how do I download all lines that connect them, making the path shorter than certain distance? Two points are really far away from each other, so I can't download all the roads and then load them into QGIS... </p>iziliSun, 19 Apr 2020 15:27:12 +0100https://help.openstreetmap.org/questions/74284/how-to-find-shortest-path-between-two-points-using-overpass-turbo-querypathoverpass-turboshortestshortest routehttps://help.openstreetmap.org/questions/71861/shortest-route<p>How can I change route , if I khow, that there is shortest one</p>tania shibkoWed, 27 Nov 2019 09:31:44 +0000https://help.openstreetmap.org/questions/71861/shortest-routerouteshortestShortest routehttps://help.openstreetmap.org/questions/55887/shortest-route<p>Our administrators install OSRM v5.
I try build the shortest route. uri: /route/v1/driving/50.792940,61.659061;50.798636,61.665437;50.811901,61.669517;50.768080,61.730977
server return faster route (about 11,5 km) and i can`t find how build shortest route (aboute 10 km).</p>
<p>Can i do this by options in request string or need change config on server. Or it is not possible.</p>
<p>thank you in advance<img src="https://help.openstreetmap.org/upfiles/1_8XGezPK.png" alt="alt text"></p>Alex taxi21Wed, 26 Apr 2017 13:31:31 +0100https://help.openstreetmap.org/questions/55887/shortest-routeosrmshortestShortest path problem from A to B on routing engineshttps://help.openstreetmap.org/questions/49117/shortest-path-problem-from-a-to-b-on-routing-engines<p>I am in the process of creating a routing engine. I have encountered the following problem. Lets say the user gives a point A and point B and expects to get the A->B shortest path. I am using simple Dijkstra for now.</p>
<p>Let's say that I can somehow find the <code>(latitudeA, longitudeA)</code> and <code>(latitudeB, longitudeB)</code> coordinates, which are the closest coordinates to the A and B points that the user inputted. From those coordinates I could then also find the <code>nodeA_ID</code> and <code>nodeB_ID</code> on the graph. The problem is that for those nodes it is very likely that the A->B path doesn't exist at all. For example, if node A was only part of a one-way road that went to the opposite direction that the user wanted to go to.</p>
<p>However, a <strong>A'</strong> and <strong>B'</strong> must exist, <em>very close</em> to A and B respectively, so that the <strong>A'->B'</strong> path exists. So the routing engine should try and find that <strong>A'->B'</strong> path instead.</p>
<p>Also, that <strong>A'->B'</strong> path might not even be <strong>optimal</strong>. There could have been a <strong>A''->B''</strong> path, where A'' and B'' were only a couple of meters away from A and B. So the routing engine should find the <strong>A''->B''</strong> optimal path instead.</p>
<p>How do routing engines handle this situation ? </p>shiro900Fri, 08 Apr 2016 19:07:08 +0100https://help.openstreetmap.org/questions/49117/shortest-path-problem-from-a-to-b-on-routing-enginesenginepathdijkstraroutingshortestShortest path using A* with nodes and wayshttps://help.openstreetmap.org/questions/42363/shortest-path-using-a-with-nodes-and-ways<p>I'm trying to create a web application that given two points : S(lat,long) and D(lat,long), find the shortest path between them.</p>
<p>My problem is : I do not know how to use A* or other AI algorithm to find the shortest path given the nodes and ways from here : "http://overpass.osm.rambler.ru/cgi/interpreter?" and after that reconstruct the solution, building the path in the map. I'm using Overpass API to get the nodes and ways, using an approach by "rectangle" between the geo points(i know this is bad, because you can have a shortest path the is not in this rectangle, but i do not see a better solution with this API). This is a paper I must make to AI course in my university.</p>
<p>Short Version :</p>
<ol>
<li>Anyone knows how to make shortest path algorithm using A* with given nodes and ways? </li>
<li>Anyone knows which nodes and ways to get? I'm using the approach to get nodes and ways inside the rectangle between the Start and Destination points, but it does not work with points in the same line.</li>
</ol>
<p>Thank you.</p>MixxerWed, 15 Apr 2015 21:09:53 +0100https://help.openstreetmap.org/questions/42363/shortest-path-using-a-with-nodes-and-waysleafletjavascriptroutingshortestHow can I use the map data perform shortest path algorithm?https://help.openstreetmap.org/questions/16530/how-can-i-use-the-map-data-perform-shortest-path-algorithm<p>How can I use the map data perform shortest path algorithm (e.g Dijkstra's algorithm)?</p>cora123Sat, 29 Sep 2012 12:55:15 +0100https://help.openstreetmap.org/questions/16530/how-can-i-use-the-map-data-perform-shortest-path-algorithmpathdataalgorithmshortest