AN ALGORITHM FOR TRAVELING SALESMAN PROBLEM BY 'N' SALESMEN AND 'M' CITIES USING NEURAL NETWORK

The traveling salesman problem (TSP) is defined as follows: a salesman visits M cities that he must travel to on his list without visiting any city twice, and he must start and end at a particular city. The goal is to choose the path of the cities he has to visit so that the total visited path length is minimized. The TSP is considered for one salesman. But in fact, a case of visiting M cities with division among some salesmen is usual. The authors have considered the above matter and applied Neural Network to the problem, defined as follows: The problem is TSP that visiting M cities with n salesmen without visiting any city twice, all salesmen must start and end at a same particular city, each city has to be visited by only one salesman.

Language

  • English

Media Info

  • Pagination: p. 363-371

Subject/Index Terms

Filing Info

  • Accession Number: 00726836
  • Record Type: Publication
  • Report/Paper Numbers: Volume 2
  • Files: TRIS
  • Created Date: Oct 11 1996 12:00AM