遗传算法和Hopfield模型求解货郎担问题的比较和分析  

Comparison and Analyse between Genetic Algorithm and Hopfield Network to Resolve TSP

作　　者：刘宁钟[1] 杨静宇[1] 

机构地区：[1]南京理工大学计算机系,南京210094

出　　处：《计算机工程与应用》2003年第4期95-95,共1页Computer Engineering and Applications

摘　　要：文章简要介绍了运用遗传算法和Hopfield网络求解货郎担问题的模型,讨论了两种算法中有代表性的实现途径,并给出了两种方法的具体算法。文中根据实验数据,着重对两种算法的性能进行了比较和分析。In this paper,two models of resolving TSP with Genetic Algorithm and Nerual Network are described concisely,and the typical approaches of two models are analyzed.The algorithm is also given in the paper.At last,according to the experiment ,it compares and analyzes two kinds of the algorithm.

关 键 词：遗传算法 HOPFIELD模型 货郎担问题 组合数学 NP完全问题 

分 类 号：O22[理学—运筹学与控制论]