搜索资源列表
an-for-tsp
- 利用蚁群算法解决tsp问题，适合初学者。-Tsp using ant colony algorithm to solve the problem, suitable for beginners.
ACO-TSP
- 利用蚁群算法解决旅行商问题，其中运用智能蚂蚁算法-Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem
TSP(matlab)
- matlab蚁群算法，要使用城市坐标的版本-ant colony algorithm matlab, it is necessary to coordinate the use of the version of the City
tsp
- 该程序是蚁群算法和遗传算法的混合算法的C语言程序在求解TSP问题时的应用，可以进行扩展到其他问题的两种算法应用-The program is ant colony algorithm and genetic algorithm hybrid algorithm in the C language program to solve the issue of the application of TSP, can be extended to other applications of the tw
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
TSP
- 介绍求解TSP 问题的蚁群算法，是解决旅行售货员问题的一种比较好的方法-Introduced to solve the ant colony algorithm for TSP problem is to solve the traveling salesman problem of a better way to
ACO-PSO
- 蚁群算法（ACO）和粒子群算法（PSO）的混合算法解决旅行商问题（TSP）的matlab代码-Ant colony optimization (ACO) and particle swarm optimization (PSO) of the hybrid algorithm to solve traveling salesman problem (TSP) in matlab code
ant-for-tsp-pr76
- 基于蚁群算法用MATLAB求解76城市TSP问题，可得目前世界最优解，适合高手阅读使用-Using MATLAB based on ant algorithm for solving the problem of 76 cities TSP, the best solution available to the world for master read the
aritificial-ant-algorithms-for-TSP
- 应用双种群蚁群算法解决TSP问题，计算速度快，准确率高-Application of ant colony algorithm to solve TSP double population problem, computational speed, high accuracy
TSP(AA)
- 从北京出发经过全部省会回到北京的TSP问题，蚁群算法求解(Starting from Beijing, the TSP problem is solved by ant colony algorithm after all the provincial capitals return to Beijing)
蚁群算法TSP问题
- 典型的matlab求运行商问题，可以看到进化曲线和线路计算过程。(The typical matlab asks the operator problem, and you can see the evolution curve and the line calculation process.)
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
AA—TSP
- 本算法是在MATLAB下，用蚁群算法求解tsp问题(The algorithm is based on MATLAB, ant colony algorithm to solve the TSP problem)
蚁群算法
- 蚁群算法，包括蚁群算法解决TSP问题，蚁群算法寻找最优解等问题还包括蚁群算法的c语言程序，希望能帮助大家！(Ant colony algorithm, including ant colony algorithm to solve the TSP problem, ant colony algorithm to find the optimal solution and other issues, including the C language program of ant colony al
蚁群算法实验文件
- 蚁群算法TSP解决物流问题，Matlab编程仿真(Solving logistics problems by ant colony algorithm TSP)
蚁群
- 用蚁群算法来解决TSP问题的matlab代码，用的蚁周模型，参数为实验选择的最优参数(Ant arithmetic and TSP problem)
蚁群算法（路径规划程序）
- 蚁群算法是一种群智能算法，也是启发式算法。基本原理来源于自然界蚂蚁觅食的最短路径原理。蚁群算法根据模拟蚂蚁寻找食物的最短路径行为来设计的仿生算法，因此一般而言，蚁群算法用来解决最短路径问题，并真的在旅行商问题（TSP，一个寻找最短路径的问题）上取得了比较好的成效。目前，也已渐渐应用到其他领域中去，在图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类分析等方面都有所应用。(Ant colony algorithm is a population intelligent algorithm,
蚁群算法求解TSP问题
- 将蚁群算法有效应用到TSP问题，并使用Matlab求解(Ant colony algorithm for solving TSP problem)
蚁群算法的TSP优化
- 基于基础蚁群算法的TSP寻优，包括信息素更新方法，禁忌表使用更新(TSP optimization based on basic ant colony algorithm, including pheromone updating method, tabu table updating)
蚁群算法
- 利用蚁群算法解决典型tsp问题，算法中数据可参数化，31个城市(Using ant colony algorithm to solve typical TSP problems)