Swarm simulated annealing algorithm with knowledge-based sampling for travelling salesman problem
Changying Wang, Min Lin, Yiwen Zhong et al. · International Journal of Intelligent Systems Technologies and Applications · 2016
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.
Cited by 15 works. doi:10.1504/ijista.2016.076100
Authors
References
- Optimization by Simulated Annealing
- Equation of State Calculations by Fast Computing Machines
- Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
- Particle swarm optimization
- A new optimizer using particle swarm theory
- Ant system: optimization by a colony of cooperating agents
- A Method for Solving Traveling-Salesman Problems
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
- Distributed Optimization by Ant Colonies
- An Investigation of Some Properties of an Ant Algorithm