摘要
模拟退火算法在处理全局优化、离散变量优化等困难问题中,具有传统优化算法无可比拟的优势。这里描述模拟退火算法的原理及其基本框架结构,给出用模拟退火算法求解TSP问题的具体实现方法,并分析说明模拟退火算法的优缺点。
Simulated annealing algoritban has obvious comparative advantage in solving the difficult problems, such as global optimization and discrete variables optimization. Franlework and principle of simulated annealing algorithm were described, computational method to solve TSP problem was given, and the advantages and disadvantages of simulated annealing algorithm were also shown in this paper.
出处
《森林工程》
2008年第1期94-96,共3页
Forest Engineering
基金
黑龙江省自然科学基金(C0105)
关键词
模拟退火
组合优化
TSP问题
simulated annealing algorithm
combinatorial optimization
TSP problem
