Solution attractor of local search in travelling salesman problem (part 2): computational study
by Weiqi Li; Xue Li
International Journal of Metaheuristics (IJMHEUR), Vol. 7, No. 2, 2019

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.

Online publication date: Thu, 07-Mar-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com