基于模拟退火算法的TSP问题研究  

Research of TSP Problem Based on Simulating Anneal Algorithm

作　　者：邓士杰[1] 支建庄[1] 于贵波[1] 栾军英[1] 

机构地区：[1]军械工程学院火炮工程系,石家庄050003

出　　处：《价值工程》2012年第28期290-291,共2页Value Engineering

摘　　要：针对遗传算法求解TSP问题过程中出现的早熟现象,本文将模拟退火算法应用到TSP问题求解中,并进行了仿真实验。结果表明,该算法与遗传算法相比,可以更好地在全局范围内进行搜索。In allusion to the earliness phenomena while the inherit algorithm solving the problem of TSP, the simulating anneal algorithm is applied on the solving problem of TSP, and emulated. It is result that the simulating anneal algorithm is better in searching in global domain than the inherit algorithm.

关 键 词：模拟退火算法 TSP问题 遗传算法 

分 类 号：E25[军事—军事理论]