arXiv Analytics

Sign in

arXiv:cond-mat/0603237AbstractReferencesReviewsResources

Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution

Yong Chen, Pan Zhang

Published 2006-03-09, updated 2006-09-24Version 3

We report a new statistical general property in traveling salesman problem, that the $n$th-nearest-neighbor distribution of optimal tours verifies with very high accuracy an exponential decay as a function of the order of neighbor $n$. With defining the energy function as the deviation $\lambda$ from this exponential decay, which is different to the tour length $d$ in normal annealing processes, we propose a distinct highly optimized annealing scheme which is performed in $\lambda$-space and $d$-space by turns. The simulation results of some standard traveling salesman problems in TSPLIB95 are presented. It is shown that our annealing recipe is superior to the canonical simulated annealing.

Related articles: Most relevant | Search more
arXiv:0810.1664 [cond-mat.stat-mech] (Published 2008-10-09, updated 2008-12-20)
Scattering a pulse from a chaotic cavity: Transitioning from algebraic to exponential decay
Packets of Diffusing Particles Exhibit Universal Exponential Tails
Large deviations for continuous time random walks