Answers are grounded in this paper and cite their sources.
A generalization of the stochastic method of simulated annealing algorithm based on Tsallis statistics is proposed. This algorithm is considerably faster than the traditional ones in solving the traveling salesman problem. Acceptable solutions are found in fewer steps and higher temperatures than both the classical and the fast simulated annealings. Recent developments in solving NP-complete problems can be incorporated and improve the performance even more.
No takes yet. Share an insight, caveat, or question.
T. J. P. Penna (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: