Title: Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem

Authors: Changying Wang; Min Lin; Yiwen Zhong; Hui Zhang

Addresses: College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou 350002, China ' College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou 350002, China ' College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou 350002, China ' Computer Engineering & Computer Science Department, University of Louisville, KY 40208, USA

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.

Keywords: swarm intelligence; simulated annealing; travelling salesman problem; TSP; knowledge-based sampling; ant colony optimisation; ACO.

DOI: 10.1504/IJISTA.2016.076100

International Journal of Intelligent Systems Technologies and Applications, 2016 Vol.15 No.1, pp.74 - 94

Received: 05 Jun 2015
Accepted: 01 Sep 2015

Published online: 24 Apr 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article