traveling salesman problem
GIS
This is a classic tour problem in which a hypothetical salesman must find the most efficient sequence of destinations in his territory, stopping only once at each.
- — GIS Glossary retrieved 2014-05-27
This is a classic tour problem in which a hypothetical salesman must find the most efficient sequence of destinations in his territory, stopping only once at each.