Traveling salesman problem and Tsallis statistics
- 1 January 1995
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 51 (1), R1-R3
- https://doi.org/10.1103/physreve.51.r1
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Fractal random walks from a variational formalism for Tsallis entropiesPhysical Review E, 1994
- Stellar polytropes and Tsallis' entropyPhysics Letters A, 1993
- Generalized statistical mechanics: connection with thermodynamicsJournal of Physics A: General Physics, 1991
- Possible generalization of Boltzmann-Gibbs statisticsJournal of Statistical Physics, 1988
- New optimization methods from physics and biologyNature, 1987
- Fast simulated annealingPhysics Letters A, 1987
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1984
- Optimization by Simulated AnnealingScience, 1983
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965