Phys. Rev. E 51, R1–R3 (1995)Traveling salesman problem and Tsallis statistics
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. © 1995 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevE.51.R1
DOI:
10.1103/PhysRevE.51.R1
PACS:
02.50.Ey, 02.60.Pn, 05.70.Ln, 02.70.-c
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.