Solution attractor of local search in travelling salesman problem: concept, construction and application
by Weiqi Li; Mingyuan Feng
International Journal of Metaheuristics (IJMHEUR), Vol. 2, No. 3, 2013

Abstract: The travelling salesman problem (TSP) is one of the most intensely investigated problems in optimisation applications. This paper introduces the concept of solution attractor in local search process for TSP. A solution attractor drives the local search trajectories to converge into a small region in the solution space, which contains the most promising solutions to the problem. This paper presents a method for constructing the solution attractor of local search in TSP, and then demonstrates how to apply the attractor concept to design a search strategy to tackle a complex TSP - dynamic multi-objective TSP (DMOTSP).

Online publication date: Sat, 05-Jul-2014

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