No abstract

No abstract

This paper presents an approach namely, ones assignment method, for solving the traveling salesman problem. We have previously used this method for the assignment problem. We have slightly modified the procedure to get a tour of the traveling salesman problem. First we define the distance matrix, then by using determinant representation we obtain a reduced matrix which has at least one 1 in each row and each column. Then by using the new method, we obtain an optimal solution for traveling salesman problem by assigning ones to each row and each column. The new method is based on creating some ones in the distance matrix and then try to find a complete solution to their ones. At the end, this method is illustrated with some numerical examples.

No abstract

No abstract