Abstract
Some results for the traveling salesman problem (TSP) are known for a prime number of cities. In this paper we extend these results to an odd number of cities. For an odd integer n, we show that there is an algorithm that generates n – 1 cyclic permutations, called tours for the traveling salesman problem, which cover the distance matrix. The algorithm allows construction of a two-dimensional array of all tours for the TSP on an odd number of cities. The array has the following properties: (i) A tour on a vertical line in the array moves the salesman uniquely compared to all other tours on the vertical line. (ii) The sum of the lengths of all tours on a vertical line is equal to the sum of all non-diagonal elements in the distance matrix for the TSP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: WSEAS TRANSACTIONS ON INFORMATION SCIENCE AND APPLICATIONS
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
