摘要
对解旅行商问题的模拟退火算法作了改进,增加了产生新解的函数,修改了原算法计算旅行回路总长度的代价函数,并用混沌随机序列替代不适宜的随机函数.从而用TurboC实现了改进算法.实验表明,改进算法对于解旅行商问题是实用的.
This paper improves the simulated annealing algorithm for solving traveling salesman problem(TSP). We add a different method for producing new solutions of TSP, and revise the corresponding function for computing the length. Using Turbo C, we complete the program for solving TSP. Running the program indicates the improved algorithm is useful.
出处
《中国计量学院学报》
2005年第1期66-71,共6页
Journal of China Jiliang University
