搜索资源列表
ants
- 用蚂蚁算法解决TSP的70点问题，没有密码，解压之后就能直接运行-ant algorithm used to solve the TSP 70 points, no password can be extracted directly after Operation
ACS
- 基本蚁群算法用于解决eil51 TSP问题代码，开发环境是VC-basic ant colony algorithm is used to solve eil51 TSP code development environment is VC
200711912175433168
- tsp蚂蚁算法的最优化的方法matlab语言-tsp ant algorithm optimization method Matlab language
ant
- 蚁群算法( ant colony algorithm) 是由意大利学者 Dorigo 等人[1 ,2 ] 于20 世纪90 年代初期通过模拟自然界 中蚂蚁集体寻径的行为而提出的一种基于种群的启发 式仿生进化系统。蚁群算法包含两个基本阶段:适应阶 段和协作阶段。在适应阶段,各候选解根据积累的信息 不断调整自身结构。在协作阶段,候选解之间通过信息 交流,以期望产生性能更好的解,这类似于学习自动机 的学习机制。蚁群算法最早成功应用于解决著名的旅 行商问
蚂蚁算法
- VC++设计的蚂蚁算法在TSP问题中的应用 方便学习蚂蚁算法 -VC design Ant Algorithm in the TSP of ants facilitate learning algorithm
AntColonAlgorithmforTSP
- c++程序 用于求解TSP问题，有说明注释 -Ant Colony Algorithm for TSP C++
gsd
- 蚁群算法源程序：求31个城市的最短路径的程序！（TSP）-Ant Colony source: 31 cities seeking the shortest path program! (TSP)
ant
- 用蚁群算法解决TSP问题，该程序并非本人编写，见谅！-using ant colony to solve problem of TSP,this program is not created by me,forgiving me!
ant-tsp-ndd
- 该算法能够蚁群算法在TSP问题上的实现，能取得比较好的效果，但并非本人编写。-This programming can solving TSP problem,the effect is good ,but it is not created by me.
ant
- 蚁群算法是一种较新型的求解大规摸问题的群体智能算法，本源代码用于求解TSP问题-The ant colony algorithm is a more swarm intelligence algorithm to solve the problem of large-scale touch the source code used for solving TSP
TSP-ACO
- 運用蟻群演算法ACO去求解TSP旅行者路徑問題-Using ant algorithm to solve TSP travelers ACO path problem
YiQun
- 用蚁群算法来解决TSP问题，压缩包内附有源代码，可以正常运行-Ant colony algorithm to solve TSP problems, compressed package containing source code, can be normal operation
ant
- 经典蚁群算法 常用语解决tsp，多路径路由问题-Classical ant colony algorithm to solve common language tsp, multi-path routing problem
qqq
- 蚁群算法求解TSP问题的源代码，c++实现的-Ant colony algorithm for TSP source code, c++ achieved
antsystem-TSP
- matlab智能算法 蚁群算法的优化计算，旅行商问题优化（案例背景为巡回我国31个地区）-apply ant colony algorithm to solve TSP
ACA_main
- 蚁群算法及MATLAB实现——TSP问题的新解法 -Ant colony algorithm and MATLAB realization TSP problem New Solution
yiqun
- 蚁群算法的优化计算――旅行商问题(TSP)优化 -Ant colony optimization algorithm- traveling salesman problem (TSP) optimization
yiqunsuanfa
- 蚁群算法解决TSP问题。通过蚁群算法解决一个城市的结合以及城市之间的旅行代价，寻找经过每个城市一次且仅一次而最终返回的旅行最小代价，及寻找最短路径。-Ant colony algorithm to solve TSP problem. Through the combination of ant colony algorithm to solve a city and cost of travel between cities, seeking after each city once and
TSP
- 能够解决旅行商的路径规划问题，是一个蚁群算法。-Can solve the traveling salesman problem of path planning is an ant colony algorithm.
TSP双蚁群算法
- 蚁群算法是一种用来寻找优化路径的概率型算法。它由Marco Dorigo于1992年在他的博士论文中提出，其灵感来源于蚂蚁在寻找食物过程中发现路径的行为(The ant colony algorithm is a probabilistic algorithm used to find the optimal path. It was proposed by Marco Dorigo in his doctoral dissertation in 1992, inspired by the wa