摘要
结合Metropolis准则,对模拟退火算法进行了研究。阐述了模拟退火算法的基本原理及其实现过程,在Visual C++编译环境下实现了该算法。并将其运用到解决旅行商问题的优化之中。介绍了TSP的问题特征、一般形式及其数学描述,确定了其VC++环境下的模型实现步骤。实例仿真的结果表明了该方法能够对函数进行全局寻优,有效克服了基于导数的优化算法容易陷入局部最优的问题。该方法既可以增加对C++语言的掌握又可以加深对模拟退火过程的认识,并达到以此来设计智能系统的目的。
Simulated annealing algorithm is studied by combining with the Metropolis rule. The basic principle and realization about simulated annealing algorithm is presented. The algorithm is realized under visual C＋＋ environment, and applied into solving the traveling salesman problem （TSP）. The characters, general form and mathematics＇ description of TSP are explained. The simulation results demonstrated efficiency of the method and showed the global optimization is found out. This kind of method can not only help people to understand C＋＋ language but also deepen cognition to simulated annealing process. Furthermore, the intelligence system is designed by it.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第7期1514-1516,共3页
Computer Engineering and Design
关键词
模拟退火
优化
组合
旅行商
仿真
simulated annealing
optimization
combination
traveling salesmanproblem
simulation
