搜索资源列表
YIQUN
- 蚁群算法的MATLAB实现 蚁群算法解决TSP问题(Ant colony algorithm based on ant colony algorithm to solve TSP problem by ant colony algorithm (MATLAB))
TSP
- 这是一个基于蚁群算法的matlab程序,可运行,也可以修改运行(This is an ant colony algorithm based matlab program, can run, and can be modified to run)
AntColonyOptimization-TSP
- 蚁群算法作为新发展的一种模拟蚂蚁群体智能行为的仿生优化算法,它具有较强的鲁棒性、优良的分布式计算机制、易于与其他方法相结合等优点,本算法用来解决最短路径问题,并在TSP旅行商问题上取得较好的成效。同时也可以在他领域如图着色问题、车辆调度问题、集成电路设计、通讯网络、数据聚类进行参考。(Ant colony algorithm is a newly developed bionic optimization algorithm that simulates the ant colony intel
U4
- 用蚁群算法解决TSP旅游商问题,效果较好(Use ant colony algorithm to solve TSP travel salesman problem)
ACO_TSP
- 利用matlab软件,应用蚁群算法解决31个城市的TSP问题(Using Antlab Algorithm to Solve TSP Problems in 31 Cities Using Matlab Software)
ACA
- 基于蚁群算法的TSP问题的实现,仅用于对蚁群算法的学习(Implementation of TSP problem based on ant colony algorithm)
ACA_Matlab
- 该文件中程序主要解决TSP问题的蚁群算法的matlab程序(The program in this document mainly solves the TSP problem ant colony algorithm matlab program)
Matlab
- 基于Matlab m 函数开发的蚁群算法(The program in this document mainly solves the TSP problem ant colony algorithm matlab program)
antcolonytsp
- 采用蚁群算法求解TSP问题 迭代次数设置200(Ant colony algorithm is used to solve TSP problem. The number of iterations is set to 200.)
matlab解决tsp
- matlab中解决tsp问题经典蚁群算法(Classical ant colony algorithm for solving TSP problem in MATLAB)
ACO for TSP
- 蚁群算法解决旅行商问题,能够成功运行并且有结果(Ant colony algorithm can solve the traveling salesman problem and run successfully.)
ACAmain
- 程序为蚁群算法解决TSP问题,主要包含了蚁群算法的具体步骤(The program solves the TSP problem for the ant colony algorithm and mainly includes the steps of the ant colony algorithm)
main
- 基于C语言的蚁群算法求解tsp问题,使用邻接矩阵(Ant colony algorithm based on C language to solve TSP problem, using adjacency matrix)
TSP
- 基本蚁群算法求解TSP,还有一种改进的最大最小蚁群算法求解,包括绘图函数(The basic ant colony algorithm for TSP, and an improved maximum and minimum ant colony algorithm, including the drawing function.)
蚁群算法求解TSP问题
- 利用基本蚁群算法求解TSP问题,在100次迭代中得到了收敛
变异蚁群算法
- 蚁群算法,对ACO传统算法进行改进,求解TSP问题的软件(solution of space equilibrium piont)
ACOTSPtw
- 使用蚁群算法解决带时间窗的旅行商问题,注释详细(Ant colony algorithm is used to solve traveling salesman problem with time windows. Detailed annotations are given.)
蚁群算法
- 蚁群算法,用于解决TSP问题,可以避免过早收敛且时间复杂度低,是一种信而有效的启发式算法
蚁群算法路径规划
- 通过蚁群算法实现TSP问题的路径规划,找到最短距离,减少不必要的能量消耗
蚁群算法
- 本文对蚁群算法的基本理论以及在 TSP 问题中的应用进行了系统研究和 MATLAB 仿真。介绍了蚁群算法的基本原理、特点和算法的实现方法。.基本蚁群算法由于存在搜索时间长,易陷入局部最优解等突出缺点,使得求解效果不是很好。针对这些缺陷,提出了改进的蚁群算法(最大-最小蚂蚁系统)求解 TSP 问题。改进主要在于限制路径信息素浓度、信息素的初始值以及强调对最优解得利用这三个方面。(In this paper, the basic theory of ant colony algorithm and