Neural network approach to solving the Traveling Salesman Problem
Ralph Reilly, Plamen Tchimev · Journal of computing sciences in colleges · 2003
The Traveling Salesman Problem involves mapping a route for a salesman to visit each city, without stopping in the same city twice, in the shortest route possible. A map of Germany is used as the test data for the study in this report.