Modified local search heuristics for the symmetric traveling salesman problem

Abstract

In this paper, we investigate some modified local search (LS) heuristics for the solution of symmetric traveling salesman problem (TSP). These modifications are mainly due to the use of extended neighborhood structures. In addition, we are concerned with several new sets of the moves (transitions of solutions) based on the extended configurations of edge exchanges. We are also examining the performance of these extensions being used in an iterated local search (ILS) paradigm. The results from the experiments with the benchmark TSP instances from the TSP library (TSPLIB) demonstrate that the introduced improvements enable to seek solutions of higher quality without substantially increasing computational complexity.