文件名称:lvxing
介绍说明－－下载内容均来自于网络，请自行研究使用
旅行商问题是NP完全的组合优化问题。分析了邻域启发式算法的基本操作,提出
一种简单的启发式贪心法,仅利用城市间的距离信息求解旅行商问题-Traveling salesman problem is np-complete combinatorial optimization problem.The basic operation of neighborhood heuristic algorithm is analyzed and presented
A simple heuristic greedy method, only use information to solve the traveling salesman problem, the distance between cities
一种简单的启发式贪心法,仅利用城市间的距离信息求解旅行商问题-Traveling salesman problem is np-complete combinatorial optimization problem.The basic operation of neighborhood heuristic algorithm is analyzed and presented
A simple heuristic greedy method, only use information to solve the traveling salesman problem, the distance between cities
(系统自动生成,下载前可以参看下载内容)
下载文件列表
用启发式贪心法求解旅行商问题_潘立登.caj