摘要
提出了一种 TSP问题的进化计算方法。此方法结合边自适应和边重组的进化过程处理方法 ,在本质上符合 TSP问题的求解的需要。本文给出了边适应性函数的数学模型 ,并且构造了一种易于实现的路径重组算法。对于
In this paper we proposed an adaptive evolutionary algorithm for TSP.This approach has essential advantage in solving TSP since it combines the procedures of the edge adaptation and edges recombination.We put forward a recursive function of edge adaptability,and construct an edge recombination procedure,which is easy to implement.It is a new exploration to solution method of TSP.
出处
《计算技术与自动化》
2002年第1期19-22,共4页
Computing Technology and Automation
关键词
边重组
TSP问题
自适应进化算法
组合优化问题
Traveling Salesman Problem(TSP),evolutionary computation,adaptability,edge recombination
