Solution attractor of local search in travelling salesman problem (part 2): computational study

Abstract

This paper is the second part of our study. In the first part, we introduced the concept of solution attractor of local search system for the travelling salesman problem (TSP), described a procedure for constructing the solution attractor, and presented an attractor-based search system to solve the dynamic multi-objective TSP. In this paper, we report the results of our recent empirical study on some important properties of the solution attractor of local search system for the TSP. These properties include the nature of convergence of local search trajectories, the size of the constructed solution attractor, the relationship between the size of the problem and the size of the constructed solution attractor, the best tour in the solution attractor, and computational complexity in the attractor-based search system.