Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem
by Changying Wang; Min Lin; Yiwen Zhong; Hui Zhang
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 15, No. 1, 2016

Abstract: Simulated annealing (SA) algorithm is a popular intelligent optimisation algorithm, but its efficiency is unsatisfactory. To improve its efficiency, this paper presents a swarm SA (SSA) algorithm by exploiting the learned knowledge from searching history. In SSA, a swarm of individuals run SA algorithm collaboratively. Inspired by ant colony optimisation (ACO) algorithm, SSA stores knowledge in construction graph and uses the solution component selection scheme of ACO algorithm to generate candidate solutions. Candidate list with bounded length is used to speed up SSA. The effect of knowledge-based sampling is verified on benchmark travelling salesman problems. Comparison studies show that SSA algorithm has promising performance in terms of convergence speed and solution accuracy.

Online publication date: Mon, 25-Apr-2016

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 Intelligent Systems Technologies and Applications (IJISTA):
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