搜索资源列表
蚁群算法
- 蚁群算法/ 蚁群算法/Matlab中文论坛--助努力的人完成毕业设计.url 蚁群算法/一种快速求解旅行商问题的蚁群算法.pdf 蚁群算法/使用帮助：新手必看.htm 蚁群算法/基于改进蚁群算法对最短路径问题的分析与仿真.pdf 蚁群算法/基于改进蚁群算法的出租车路径规划算法.pdf 蚁群算法/基于改进蚁群算法的最短路径问题研究.pdf 蚁群算法/基于蚁群算法的公交路线走向模型及其求解.pdf 蚁群算法/基于蚁群算法的完全遍历路径规划研究.PDF 蚁群算法/用蚂蚁算法和模拟退火
antcolony
- 蚁群算法的实现以及改进。基于基本的蚁群算法解决Tsp问题很好的办法。-Ant group algorithm s realization as well as improves. Solves the Tsp question very good means based on the basic ant group algorithm.
jibenyiqunjuleisuanfa
- 该算法，解决了不收敛的问题，聚类效果非常好（效果图如附件图片所示）。改进的蚁群算法是基于遗传算法的改进，在基本遗传算法的基础之上，加入了变异因子，产生变异，从而更快的收敛。-Basic ant clustering algorithm and its improved algorithm
anttsp
- 用蚁群算法解决TSP问题，其中有基本蚁群，蚁密系统，还有自己提出的改进算法，自带GUI界面。-TSP with ant colony algorithm to solve the problem, including the basic ant colony, ant density systems, as well as the improved algorithm itself, its own GUI interface.
AntSystem
- 此程序是用Visual C++开发的，功能是用改进后的蚁群算法解决TSP问题，可以直接在Visual C++6.0下运行。-This program s function is solving TSP question using Ant algrithm.
ant-tsp-search
- 改进的蚁群算法及其在TSP问题中的应用研究 核心是用遗传算法对蚁群算法的四个参数进行优化，及运用MMAS进行巡径-Improved ant colony algorithm and its problems in the TSP is the core of the application of genetic algorithm with ant colony algorithm to optimize the four parameters, and application of MMA
PSO
- matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS 前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。 遗传算法解决最小生成树问题，PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。 如果有宝贵经验希望能交流一下，谢谢，-matlab genetic algorithm GA, particle swarm optimization PSO, ant colony algorithm f
threeAlgo
- matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS 前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。 遗传算法解决最小生成树问题，PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。 如果有宝贵经验希望能交流一下，谢谢，-matlab genetic algorithm GA, particle swarm optimization PSO, ant colony algorithm f
acotsp
- 改进的蚁群算法，大家可以借鉴一下，多多提下意见就好了 -Improved ant colony algorithm, we can learn about, a lot like a thank you to mention the views of the next
Genetic_ACO
- 蚁群算法和遗传算法解决TSP问题，C++编写，可以改进应用于其他方面。-It is very useful for student who study ant algoritym optimization.
AntAlgorithm
- 一个蚁群算法求解邮递员路由问题（TSP）具体实现，本人在传统蚁群算法基础上进行改进，达到较高的效率-An ant colony algorithm for routing problem postman (TSP) concrete implementation, I am in the traditional ant colony algorithm based on the improvements to achieve higher efficiency
ACA
- C++蚁群算法解决TSP问题，内有详细的说明。改进了信息素更新方式，使得olive30城市的TSP例子能达到416的最小值。-C++ ant colony algorithm to solve TSP problems, with detailed instructions. Improved pheromone update methods, making olive30 city TSP example to achieve the minimum 416.
antsyscolony
- 关于TSP旅行商问题的蚁群标准算法，以及在一些地方的改进算法-TSP Traveling Salesman Problem on the standard ant colony algorithm and improved algorithm in some places
TSPant
- 蚁群算法来解决TSP问题,结合改进的蚁群算法，来解决TSP问题，对比其它算法，体现蚁群算法的优越性-Ant colony algorithm to solve TSP problems, combined with improved ant colony algorithm to solve TSP problems, compared to other algorithms, reflecting the superiority of the ant colony algorithm
AntColonyAlgorithmforTSP
- matlab编写的蚁群算法解决TSP问题，对路径选择部分作了改进，有详细中文注解。-ant colony algorithm written in matlab to solve TSP problem, select the part of the path has been improved, there are more Chinese comments.
TSP-based-on-improved-pso
- 基于对粒子群优化算法原理的分析，实现了一种基于TSP的改进的粒子群优化算法：求解TSP的混合粒子群算法，结合遗传算法、蚁群算法和模拟退火算法的思想来解决TSP问题。-Particle swarm optimization based on the principle of the analysis, implemented based on TSP, improved particle swarm optimization algorithm: solving the TSP hybrid pa
ant-and-tsp-
- 经典的蚁群TSP算法，而且通过改进，使路线更加圆滑，最后有三个图形进行比较-ant system algrithm with tsp
PSO_TSP（混合粒子群：较优）
- 解决环球旅行问题的一种精确度比较高的算法，相较于蚁群算法和遗传算法都有较大的改进；(A high precision algorithm for solving global travel problems has a greater improvement than the ant colony algorithm and the genetic algorith)
TSP
- 基本蚁群算法求解TSP，还有一种改进的最大最小蚁群算法求解，包括绘图函数(The basic ant colony algorithm for TSP, and an improved maximum and minimum ant colony algorithm, including the drawing function.)
TSP
- 利用蚁群算法、遗传算法还有改进的蚁群算法来解决TSP问题，根据需要可以选择TSP的规模，分别有31个城市的和48个城市的。(Using ants colony algorithm, genetic algorithm and improved ant colony algorithm to solve the TSP problem, we can choose the scale of TSP according to the needs, there are 31 cities and 48