A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem

الملخص EN

A simple lexisearch algorithm that uses path representation method for the asymmetric traveling salesman problem (ATSP) is proposed, along with an illustrative example, to obtain exact optimal solution to the problem.

Then a data-guided lexisearch algorithm is presented.

First, the cost matrix of the problem is transposed depending on the variance of rows and columns, and then the simple lexisearch algorithm is applied.

It is shown that this minor preprocessing of the data before the simple lexisearch algorithm is applied improves the computational time substantially.

The efficiency of our algorithms to the problem against two existing algorithms has been examined for some TSPLIB and random instances of various sizes.

The results show remarkably better performance of our algorithms, especially our data-guided algorithm.