How to use google map in vb.net application
-
Is there anybody who knows how to use google map in vb.net application for route optimization? Thanks in advance
Google Directions API[^] Have a look at that it might help you. You end up get through HTTP a XML Data string and have to build up from there
As barmey as a sack of badgers Dude, if I knew what I was doing in life, I'd be rich, retired, dating a supermodel and laughing at the rest of you from the sidelines.
-
Is there anybody who knows how to use google map in vb.net application for route optimization? Thanks in advance
ejaz_pk wrote:
Is there anybody who knows how to use google map in vb.net application for route optimization?
As a sidenote, you might want to work through their terms;
5.2 Account Key. After supplying Google with your account information and the URL of your Maps API Implementation, and accepting the Terms, you will be issued an alphanumeric key assigned to you by Google that is uniquely associated with your Google Account and the URL of your Maps API Implementation. Your Maps API Implementation must import the Google Maps APIs using this key as described in the Maps APIs Documentation, and Google will block requests with an invalid key or invalid URL. You may only obtain and use a key in accordance with these Terms and the Maps APIs Documentation.
Point 9 and 10 could be important too, depending on the circumstances.
I are Troll :suss:
-
ejaz_pk wrote:
Is there anybody who knows how to use google map in vb.net application for route optimization?
As a sidenote, you might want to work through their terms;
5.2 Account Key. After supplying Google with your account information and the URL of your Maps API Implementation, and accepting the Terms, you will be issued an alphanumeric key assigned to you by Google that is uniquely associated with your Google Account and the URL of your Maps API Implementation. Your Maps API Implementation must import the Google Maps APIs using this key as described in the Maps APIs Documentation, and Google will block requests with an invalid key or invalid URL. You may only obtain and use a key in accordance with these Terms and the Maps APIs Documentation.
Point 9 and 10 could be important too, depending on the circumstances.
I are Troll :suss:
-
Thanks for your reply. Actually my next step is how to put marks on different location on the map? Thanks in advance Ejaz
-
-
Thanks for the reply. Is there a way to calculate the fastest route between multiple routes? Thanks in advance Regards, Ejaz
Yup, multiple. I took the simple approach, and let the computer calculate each distance for all possible routes - assuming that the shortest one would be the fastest. Worked quite reasonably. You can find more advanced solutions by Googling for "Travelling Salesman Problem". Good luck :)
I are Troll :suss:
-
Yup, multiple. I took the simple approach, and let the computer calculate each distance for all possible routes - assuming that the shortest one would be the fastest. Worked quite reasonably. You can find more advanced solutions by Googling for "Travelling Salesman Problem". Good luck :)
I are Troll :suss:
-
Can you please give me any sample code to get any idea to get the distance and fastest route? Thanks in advance
ejaz_pk wrote:
Can you please give me any sample code to get any idea to get the distance and fastest route?
I'm sorry, but the code is copyrighted and not mine to give. I'd have turned it into an article if it wasn't :) Would also have been too much to post as a copy&paste sample. Simplest solution is to measure all possible distances. That requires you to build a tree with all possible routes. The root would be your startingpoint, and if you can move to two new points from there, you'd add those as children - recursively. Once you have all possible routes, you'd have to measure how long it is, or request it's length over some third-party. If need be free, you can use the database from Geonames.org, and calculate the length of a straight line connecting each point. You'd have to account for the earth being a big round ball, but there are formulas[^] out there that return you a length of a line on a ball. Once you have written all lengths into the tree, you find the one that gives the shortest value. That's a simplistic algorithm that'll generate relatively satisfying results. A more complicated algorithm like Dijkstra's would be an improvement. You can also improve on this by getting "real" distances from Google for the distance between two points - but that's going to cost money if you're going to do it in bulk. Good luck :)
I are Troll :suss: