traveling-salesman

I have a list of addresses and need to find the best route that reaches every address and goes back to the start With Google Maps API it is possible to calculate this with 8 waypoints I think but 8 isn't enough for my purposes. Is there someone out there who offers route optimization with more than 8 waypoints? I mean there must be, right? This is a problem that many organisations need a solution to. It is no problem at all if it costs a lot of money, the calculations are very heavy so I wouldn't expect any free service. Does maybe google have a paid service for that (for SMEs)? I'll take any

I'm working on a project for a math class at school, and I chose to do mine on the Traveling Salesman Problem, something I've always wanted to investigate more. However, I'm having problems with my brute force solving algorithm. * Please go to the update at the bottom to view the most recent version of the code SKIP THIS PARAGRAPH IF YOU KNOW WHAT THE TRAVELING SALESMAN PROBLEM IS: To summarize as much as possible, the TSP goes like this: You are a salesman who wants to visit each city in a region (a city is essentially a point on a map). There are 'n' cities in the bounded x and y region, and

Is there a way using the Google Maps API to get back an "optimized" route given a set of waypoints (in other words, a "good-enough" solution to the traveling salesman problem), or does it always return the route with the points in the specified order? There is an option in Google Maps API DirectionsRequest called optimizeWaypoints, which should do what you want. This can only handle up to 8 waypoints, though. Alternatively, there is an open source (MIT license) library that you can use with the Google Maps API to get an optimal (up to 15 locations) or pretty close to optimal (up to 100

I am looking for the name of the following problem: traveling salesman problem (visit each city exactly once) but without returning to the start city and with visiting a given city at the end. In other words, I would like to specify the start and end cities, and I don't want to go back to the start city. Thanks!!! I doubt this has its own name, as it's trivially isomorphic to the normal TSP. From standard TSP to this: Given a directed weighted graph for TSP, with a start/end node, split the start/end node into a start node and an end node, with all the outgoing edges on the start node and all

What is a practical solution to the Travelling Salesman problem, using Google Maps / geolocation / route finding? I don't need the best solution, within 5% would be fine. For example, I have 20 locations in the UK to visit, in any order. This may need to scale to hundreds of locations. What sort of algorithm can I use, given that I can lookup distances (but don't want to lookup hundreds of distances)? I you are looking for a polynomial approximation for the Euclidean TSP, several algorithms have been suggested. Have a look here . There is this TSP project implemented in JS http://code.google

I'm looking to implement the simulated annealing algorithm in Java to find an optimal route for the Travelling Salesman Problem , so far I have implemented brute force and am looking to modify that code in order to use simulated annealing. Obviously brute-force and simulated annealing are very different and use very different functions. I understand simulated annealing uses a variable known as the temperature which then cools as the algorithm runs; with the temperature starting high and it gradually cooling throughout. Whilst the temperature is high the algorithm is more likely to choose