Traveling Salesman Problem

27. června 2018

Traveling Salesman Problem

Problém obchodního cestujícího

OptiMap - Fastest Roundtrip Solver

Traveling Salesman Problem - mathworld.wolfram.com

Q: How can I enter destinations by GPS coordinates?

Find Shortest Tour

Find Shortest Tour - Map - routexl.com

BEST MAP S

Speedy Route calculates the best route when visiting multiple locations and then returning back to the start. It is ideal for delivery drivers, sales people on the road, or anyone who needs to make multiple stops ...
www.speedyroute.com

https://twitter.com/speedyroute

With BatchGeo Pro you can create maps even faster and take advantage of more features than our free version ...
https://batchgeo.com

This site saves you time and money by optimizing complex driving routes involving up to twenty-five different addresses
www.drivingrouteplanner.com

www.mapzen.com/blog/optimized-route/

www.mapzen.com/blog/introducing-mapzen-mobility/

https://valhalla.readthedocs.io

There are several key features that we hope can differentiate the Valhalla project from other routing and network analysis engines...
...Multi-modal and time-based routes. Should allow for mixing auto, pedestrian, bike and public transportation in the same route or setting a time by which one must arrive at a location...

Problém obchodního cestujícího nad Google Maps

traveling salesman problem code
traveling salesman problem python
traveling salesman problem dynamic programming

Traveling Salesman Problem - Google - developers optimization routing tsp

NP-hardness

Evolution of a salesman: A complete genetic algorithm tutorial for Python

Illustration of a potential solution to the TSP (By Xypron [Public domain],
from Wikimedia Commons)

Speeding Up The Traveling Salesman Using Dynamic Programming

Resources

The traveling salesman problem has been written about, researched, and taught extensively. As it turns out, there are many different approaches when it comes to attempting to solve it, and the Held-Karp algorithm is just one of them. If you want to dig deeper into this particular topic, here are some good places to start.