搜索资源列表
ACATSP
- 蚁群算法是一种分布式内在并行算法。单个蚂蚁的搜索过程是彼此独 立的，易于局部最优，通过个体间不断的信息交流和传递有利于发现较好解；并且该算法是一种正反馈算法。路径上的信息素浓度较高，将吸引更多的蚂蚁沿这条路径运动，又使得信息素浓度增加，加快了算法的进化过程。本文通过求解TSP问题，通过在特定情况下对路径进行逐步遍历比较来降低陷入局部最优解的可能性, 找出最优解。-Ant colony algorithm is an inherent distributed parallel algorithm.
ACO
- TSP旅行商问题，解决城市旅行距离最短的问题，基于蚁群算法求解。-TSP traveling salesman problem, solve the problem of urban travel the shortest distance, based on ant colony algorithm.
chapter22
- 蚁群算法的优化设计-旅行商问题（TSP）优化-Design Optimization Ant Colony Algorithm- Traveling Salesman Problem (TSP) optimization
ACO3
- 融合蚁群算法和模拟退火算法的C++程序，解决TSP-Fusion ant colony algorithm and simulated annealing algorithm C++ program to solve TSP
TSP2
- 旅行推销商问题(TSP)是组合优化中的一个热点问题，它有着广泛的应用背景。应用蚁群算法求解TSP问题。-Traveling salesman problem (TSP) is a combinatorial optimization problem in a hotspot, it has a wide application background. Application of ant colony algorithm for TSP.
yiqun
- 蚁群算法的优化计算――旅行商问题(TSP)优化 -Ant colony optimization algorithm- traveling salesman problem (TSP) optimization
ANT
- 蚁群算法，很好的解决了TSP的问题，简单，通俗易懂-Colony algorithm, a good solution to the problem of TSP, simple, easy to understand
Ant-Colony-Algorithm-matlab
- 利用蚁群算法寻找以下10个城市的TSP最短路径。输出最短路径顺序及其长度，以及蚁群算法迭代过程中的最短路径长度进化曲线-Ant colony algorithm to find the following 10 cities TSP shortest path. Output sequence and the shortest path length, and the ant colony algorithm is an iterative process of evolution of the
aco
- 描述蚁群算法的功能及应用，及其在TSP中的实现-Function and Application of ant colony algorithm is described, and its implementation in the TSP
daimayasuo
- 包含：基于蚁群算法求解对称非对称旅行商问题 粒子群优化算法演示(PSO) 基于遗传算法(GA)的多变量旅行商问题(TSP) 遗传算法优化BP 神经网络在数据预测方面的应用 金融数量分析相关代码-Comprising: Solving Symmetric Asymmetric Traveling Salesman Problem Based on Ant Colony Algorithm Particle Swarm Optimization Demo (PSO) Mult
ANT-conony-system
- 一个简单实用的使用c语言进行蚁群算法的实现解决tsp问题- A simple and practical using c language for the realization of the ant colony algorithm to solve TSP problem
ant
- 蚁群算法 解决TSP问题 程序对20个城市 数据进行计算 通过蚁群算法 计算最短路径 城市数据保存在当前目录下的 1173.txt 文件中-Ant colony algorithm to solve the TSP program for the calculation of 20 urban data through the ant colony algorithm to calculate the shortest path of urban data stored in the curre
ant
- matlab实现蚁群算法解决旅行商(TSP)问题-Matlab ant colony algorithm to solve the traveling salesman problem (TSP)
yiqunsuanfa
- 蚁群算法是当前研究非常火热的一种智能算法，下面的蚁群算法程序专门用于求解TSP问题，此程序由GreenSim团队于2006年初完成，最初公开发表于研学论坛，我们经过仿真检验，发现此程序的优化效率和鲁棒性都非常好。-Ant colony algorithm is currently very hot research an intelligent algorithm, the following special procedures ant colony algorithm for solving
AS-matlab-source
- 基本蚁群算法的matlab程序，以旅行商问题（TSP）为求解模型。-The basic ant colony algorithm matlab procedures to the traveling salesman problem (TSP) to solve the model.
yiqunyouhuasuanfa
- 蚁群算法的优化，以改善传统的蚁群算法不适用欲大规划的TSP问题的解决，缩短搜索的时间。-Ant colony optimization algorithm to improve the traditional ant colony algorithm NA For big plan to solve TSP problem, shorten the time of the search.
ACforTSP
- 蚁群算法是一种新型群智能算法，为求解旅行商问题提供新的方法-ANT CLONY algorithm is a new method to solve tsp.
C-ant
- 运用蚁群算法求解TSP问题，蚁群算法十几年来研究比较热门的人工智能算法，应用在很多领域，如TSP、JSP等。-The use of ant colony algorithm to solve the TSP problem, ant colony algorithm for more than ten years of research and more popular artificial intelligence algorithms, applications in many fields
Ant_algorithm(matlab)
- 蚁群算法程序，用以解决TSP问题，引用自解放军信息工程大学的资料。-Ant colony algorithm program to solve the TSP, quoted the PLA Information Engineering University information.
25ab6e2dcc02
- 智能蚂蚁算法――蚁群算法的改进 求解VRP问题 求解TSP问题-Intelligence ant algorithm, improved ant colony algorithm to solve VRP problem solving TSP problem,Intelligence ant algorithm, improved ant colony algorithm to solve VRP problem solving TSP problem