Tag Archives: salesperson
Tavelling Salesman Problem (TSP) in Google Maps
What is TSP? The travelling salesman problem (TSP) is a problem in discrete or combinatorial optimization. It is a prominent illustration of a class of problems in computational complexity theory which are classified as NP-hard. Imagine you are a salesperson … Continue reading
Posted in GIS
Tagged GIS, Google Maps, node, optimal route, salesperson, travelling salesman problem
Leave a comment
