摘要
用模拟退火算法对求解旅行商组合优化问题作了一定的研究,提出了多种不同的随机抽样方式,并对其进行了分析计算。通过实验表明,在满足模拟退火算法全局收敛性的情况下,子排列反序并移位抽样方式对求解NP完全问题是非常有效的。
This paper studied the optimizing of the traveling salesman problem with the Simulated Annealing （SA）. Different random sampling forms were proposed and analyzed. It was experimentally proved that the sampling form for the sub-array reverse order and shift was a very effective way to solve the NP issue under the overall convergence for SA conditions.
出处
《微电子学与计算机》
CSCD
北大核心
2007年第5期193-196,共4页
Microelectronics & Computer
关键词
旅行商问题
模拟退火算法
NP
随机抽样
traveling salesman problem
simulated annealing
NP
random sampling
