搜索资源列表
tsp
- 多旅行商问题，最小生成树优化。 提供新思路-Multi-traveling salesman problem, minimum spanning tree optimization. To provide new ideas
gatree
- 遗传算法解决最小生成树问题,程序包含5个文件，直接运行start即可-This program use GA to solve the problem of minimum spanning tree
TSPPrim
- 用最小生成树解决旅行家问题 用到了prim算法 近似算法-Used in the prim algorithm approximation algorithm for minimum spanning tree to solve the problem of travelers
GA
- 1利用SOMF网络对二维空间中的点集进行分类2自然二进制码、格雷码与十进制码之间的相互转换3GA算法解决最小生成树问题-A two-dimensional space using the SOMF network to classify the set of points in two natural binary, Gray code with decimal code conversion between 3GA algorithm to solve the minimum spanning
AS_GA_PSO
- 遗传算法解决最小生成树问题，PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。-Genetic algorithm (ga) to solve minimum spanning tree problem, PURFER encoding.Particle swarm algorithm for unconstrained optimization problems.Ant colony algorithm to solve TSP problem.
ACSForTSP(parallelPcandidateLists)
- 蚁群系统算法求解旅行商问题，其中使用了基于领域、基于三角剖分和最小生成树的候选列表，并进行了比较。-Ant Colony System for solving traveling salesman problem, in which a field-based, based on triangulation and the minimum spanning tree of the candidate list, and compared.
xnkgc
- 用Kruskal算法构造最小生成树解决指派问题assignment problem 一家公司经理准备安排 名员工去完成()