Neural network approach to solving the Traveling Salesman Problem

  • Authors:
  • Ralph Reilly;Plamen Tchimev

  • Affiliations:
  • Barney School of Business, Management and Marketing, University of Hartford;Computer and Information Sciences, University of Massachusetts Dartmouth, North Dartmouth, MA

  • Venue:
  • Journal of Computing Sciences in Colleges
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.