A lexisearch algorithm for traveling salesman problem

A data-guided lexisearch algorithm for the traveling salesman problem (TSP) is presented along with an illustrative example. The algorithm is a modification of the lexisearch approach to TSP as proposed by S.N.N. Pandit (1962). By utilizing the information provided by appropriate statistics computed from the cost data of the TSP, the nodes of the network cities are renamed and an alphabet table is defined for the search algorithm developed for the TSP, It is shown that even this minor preprocessing of the data before a standard algorithm was applied improves the computational efficiency substantially.<
>