搜索资源列表
aco
- 蚁群算法ACO的应用，包括图像匹配，边缘检测，点检测，以及遗传算法GA-ACO ACO algorithm applications, including image matching, edge detection, detection, and genetic algorithm GA
aco-matlab
- 蚁群算法ACO，MATLAB程序代码，具有详细解释，运行正确-Ant colony algorithm ACO, MATLAB code, with a detailed explanation to run properly
ACO-PID
- 除了蚁群算法，可用于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 s
antnet
- 一个可扩展到ns2中的蚁群算法程序。对于蚁群算法的路由研究很有用处。用于蚁群算法研究和拓展。-1 can be expanded to ns2 in the ant colony algorithm program for the study of ant colony algorithm is useful for routing
TCP
- 蚁群算法是当前研究非常火热的一种智能算法，下面的蚁群算法程序专门用于求解TSP问题，我们经过仿真检验，发现此程序的优化效率和鲁棒性都非常好。 function [R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q)-Ant colony algorithm is very hot current research an intelligent algorithm, the
Ant
- 蚁群算法解决车辆调度问题，包含了信息素更新的算法-The ant colony algorithm to solve the vehicle scheduling problem.including the the algorithm of pheromone update.
cPP
- 实现蚁群算法和模拟退火算法的研究，很好用的-Simulated Annealing
ANN_MATLAB_CODE
- 一种简单的蚁群算法优化bp神经网络隐含层的算法-A simple ant colony algorithm optimization bp neural network algorithm hidden layer
TSPACO
- 这是一个在VC++ MFC环境下编写的蚁群算法，以51个城市为例实现了旅行商问题的路径规划，每代求出的解以VC++可视化的界面动态显示出来。-This is a prepared environment in VC++ MFC ant colony algorithm to 51 cities traveling salesman problem as an example to achieve a path planning, each generation of the solution o
Ant-colony-algorithm
- 根据最大最小蚁群算法 解决TSP问题 解决TSP问题 -According to the max min ant colony algorithm to solve the TSP problem
ACATSP
- 蚁群算法求解旅行商问题的实例，结果直观，值得学习，亲测可用，参数已经修改至最优。-Ant colony algorithm for traveling salesman problem instances, result intuitive, it is worth learning, pro-test is available, the parameters have been modified to the optimum.
Ant
- 基于物流配送问题的蚁群算法的C语言源代码-Distribution problem based on ant colony algorithm source code of logistics
ACO_GA_PSO
- 用三种方法解决城市距离问题（或背包问题）。三种方法分别为：遗传算法，蚁群算法，粒子算法。-Three ways to solve the problem of urban distance (or knapsack problem). Three methods are: genetic algorithm, ant colony algorithm, particle algorithm.
Ant-TSP
- 利用改进的蚁群算法，寻找最优路径，优化了算法运行时间-The use of improved ant colony algorithm to find the optimal path optimization algorithm running time
ACOTSP
- 蚁群算法，应用于TSP问题的解决，标有详尽的注释，已运行，正确-Ant colony algorithm, is applied to solve the TSP problem, with detailed notes, has been running, right
ACO-PID
- 除了蚁群算法，可用于PID参数优化的智能算法还有很多，比如遗传算法、模拟退火算法、粒子群算法、人工鱼群算法，等等。-In addition to the ant colony algorithm, can be used in the intelligent algorithm of PID parameter optimization and there are many, such as genetic algorithm, simulated annealing algorithm, pa
tsp
- 蚁群算法和遗传算法相融合，将遗传算法和蚁群算法相结合，在寻优过程中发挥各自的优势，克服各自的不足。-Ant colony algorithm and genetic algorithm integration, the genetic algorithm and ant colony algorithm combined to play their respective advantages in the optimization process, to overcome their defic
ACATSP
- 蚁群算法的TSP路径优化程序，程序运行良好。-TSP path ant colony algorithm optimization program, the program runs well.
yiqun
- 蚁群算法 这个程序来计算阶梯拉曼散射的不同值-This program ant colony algorithm to calculate the different values of the ladder Raman scattering
ACO_Algorithm
- 蚁群算法的源代码，在路径寻优及多目标非线性优化问题上都有很强的优势。-Ant colony algorithm source code, in the path of multi-objective optimization and nonlinear optimization problem has a strong advantage.