当前位置：
首页 资源下载
搜索资源 - Ant Colony Algorithm Optimization
搜索资源列表
-
0下载：
人工智能matlab仿真！！个人杰作，包含 粒子群算法，遗传算法，蚁群算法等等，非常有趣，希望能帮到您学习matlab-Artificial Intelligence matlab simulation! ! Individual masterpieces, including the particle swarm optimization, genetic algorithm, ant colony algorithm, etc., is very interesting, I hope to
-
-
0下载：
蚁群算法是一种模仿蚁群行为的仿生优化算法，其实现机理包括两个基本阶段：适应阶段和协作阶段。在适应阶段，各可行解根据积累的信息不断调整自身结构，路径上经过的蚂蚁越多，信息量越大，则该路径越容易被选择：时间越长，信息量越小。在协作阶段，各可行解之间通过信息交流，以期望产生性能更好的解。-Ant colony algorithm is a mimic ant colony behavior of bionic optimization algorithm, its implementation mec
-
-
0下载：
蚁群算法实现连续函数优化问题，包含程序说明。-Ant colony algorithm for continuous function optimization problems, including program instructions.
-
-
0下载：
This code is for solving traveling salesman problem using ant colony algorithm.Ant Colony Optimization (ACO) is a population-based approach for solving
combinatorial optimization problems that is inspired by the foraging behavior
of ants and thei
-
-
0下载：
除了蚁群算法，可用于PID参数优化的智能算法还有很多，比如遗传算法、模拟退火算法、粒子群算法、人工鱼群算法，等等。-In addition to the ant colony algorithm, can be used to optimize the PID parameters, there are many intelligent algorithms, such as genetic algorithms, simulated annealing algorithm, particle
-
-
0下载：
Ant colony optimization toolbox, this toolbox is graph based toolbox. that can help you to understand who ant colony work. I hope that this software can useful for you
-
-
0下载：
改进的蚁群算法并应用与旅行商问题，相比于没有改进的蚁群算法来说，这个算法能更好的对旅行商寻优问题，寻优结果也挺满意，希望感兴趣的可以借鉴一下。-Improved ant colony algorithm and application of the traveling salesman problem, compared to no improvement ant colony algorithm, this algorithm can better optimization of the tr
-
-
0下载：
matlab 遗传算法GA，粒子群算法PSO,蚁群算法AS 前段时间上智能计算方法实验课上，自己做的程序。帖到这里，希望有人能改进它们，交流经验这样更有价值。 遗传算法解决最小生成树问题，PURFER编码。 粒子群算法做无约束最优化问题。 蚁群算法解决TSP问题。 -matlab genetic algorithm GA, particle swarm optimization PSO, some time ago on the ant colony algorithm intelligent
-
-
2下载：
多目标蚁群算法，蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。-MOACO，Multi-objective ant colony algorithm
-
-
0下载：
遗传算法解决最小生成树问题，PURFER编码。
粒子群算法做无约束最优化问题。
蚁群算法解决TSP问题。-Genetic algorithm (ga) to solve minimum spanning tree problem, PURFER encoding.Particle swarm algorithm for unconstrained optimization problems.Ant colony algorithm to solve TSP problem.
-
-
0下载：
蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。-Ant colony algorithm (ant colony optimization, ACO), also known as ant algorithm is an algorithm used to find the optimal path probability model in the figure.
-
-
0下载：
虽然对蚁群算法的研究时间不长, 但是初步研究已显示出它在求解复杂优化问题方面具有很大的优势, 特别是1998 年在比利时布鲁塞尔专门召开了第一届蚂蚁-Although research on ant colony algorithm is not long, but preliminary studies have shown that it has a great advantage in solving complex optimization problems, in particular
-
-
0下载：
蚁群算法对多变量函数进行优化，亲测可用。-Ant colony algorithm for multi-variable function optimization, pro-test available.
-
-
0下载：
蚁群算法多目标优化,针对多个目标，主要用在路径取货方面-Ant colony algorithm for multi-objective optimization.
-
-
0下载：
智能算法（遗传算法，蚁群算法）解决优化算法问题，很实用的matlab代码-Intelligent algorithms (genetic
algorithms, ant colony algorithm) algorithm to solve the optimization problem, it is useful matlab code
-
-
0下载：
蚁群算法的优化设计-旅行商问题（TSP）优化-Design Optimization Ant Colony Algorithm- Traveling Salesman Problem (TSP) optimization
-
-
0下载：
旅行推销商问题(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.
-
-
1下载：
包含：基于蚁群算法求解对称非对称旅行商问题
粒子群优化算法演示(PSO)
基于遗传算法(GA)的多变量旅行商问题(TSP)
遗传算法优化BP 神经网络在数据预测方面的应用
金融数量分析相关代码-Comprising: Solving Symmetric Asymmetric Traveling Salesman Problem Based on Ant Colony Algorithm
Particle Swarm Optimization Demo (PSO)
Mult
-
-
0下载：
蚁群算法，直接可用，是一种新型的优化算法，用于参数寻优，精度高，速度快。-Ant colony algorithm, available directly, is a kind of new optimization algorithm, is used for parameter optimization, high precision and fast speed.
-
-
0下载：
蚁群优化是一种元启发式的随机搜索技术,是目前解决组合优化问题最有效的工具之一.将信
息素更新和随机搜索机制的改进相结合,提出一种快速求解旅行商问题的蚁群算法-Ant colony optimization is a kind of meta heuristic random search technique, is one of the most effective tool to solve combinatorial optimization problem. The letter
-
«
1
2
...
7
8
9
10
11
1213
14
15
16
17
...
23
»
