搜索资源列表
meshpartdist.tar
- This toolbox contains Matlab code for several graph and mesh partitioning methods, including geometric, spectral, geometric spectral, and coordinate bisection. It also has routines to generate recursive multiway partitions, vertex separators, and nes
ACO_Peng_V4
- 这是我用matlab编写的，利用蚁群算法（ACO）求连续函数最优解的源码。是对段海滨《蚁群算法原理及应用》一书中，网格策略法的实现。-This is my prepared using Matlab, using ant algorithms (ACO) function for the optimal solution for the source code. On the waterfront of the "ant colony algorithm and application
ACOTSP.V1.1
- 是从一个国外的蚁群算法网站上下载的源程序,是用蚁群算法解TSP问题的源程序!感谢开放源程序-from a foreign website ant algorithm download the source code, is ACO for the TSP source! thanks to open source
yiqun
- 是从一个国外的蚁群算法网站上下载的源程序,是用蚁群算法解TSP问题的源程序!感谢开放源程序-from a foreign website ant algorithm download the source code, is ACO for the TSP source! thanks to open source
mayi
- 是从一个国外的蚁群算法网站上下载的源程序,是用蚁群算法解TSP问题的源程序!感谢开放源程序-from a foreign website ant algorithm download the source code, is ACO for the TSP source! thanks to open source
ACS
- matlab编写的蚁群优化tsp程序，很不错，希望大家喜欢-ant colony optimization matlab prepared tsp procedures, very good, I hope everyone likes
ant-colony-algorithm(ACO)
- 蚁群算法实现TSP问题，代码由MATLAB编写，可直接运行，直接修改初始城市数据即可-Ant colony algorithm TSP problem, the code is written in MATLAB can be directly run, the data can directly modify the initial cities
aco
- code matlab pso based aco
05-ACO-for-TSP
- this code is ACO for TCP. work with this GA very simple.
ACO-knapsack
- Ant colony optimization matlab code for solving Knapsack problem
aco
- 蚁群算法是现代优化算法，这个是直接可以编译通过的蚁群算法求解51城市的TSP问题的MATLAB源代码 -Ant colony algorithm is a modern optimization algorithm, which is directly compiled by the ant colony algorithm to solve the 51 cities of the TSP problem MATLAB source code
ACO-tsp
- 利用蚁群算法求解tsp问题的源代码，这个模板能够运行。 如果你想带入自己的数据只需要修改城市的坐标矩阵（也就是C）和蚂蚁数量、迭代次数就能很好的运行并得到结果了。 希望对你学习蚁群算法有所帮助。-Using the ant colony algorithm to solve the tsp problem source code, this template can run. If you want to bring your own data only need to modify
myMatlab-code
- In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the
ACO
- matlab code for ant colony optimization
57504
- aco code foe feature selection
ACO(daneshjooyar.com)
- abt colony matlab code
ACOBP
- 用蚁群算法优化BP神经网络，然后用于预测，非常实用，适合初学者。(This is the aco-bp code in matlab)
ACO程序 含数据示例
- 蚁群算法，内含详细的代码和数据。亲测可用(Ant colony algorithm with detailed code and data)
蚁群算法ACO
- 一种经典蚁群算法的matlab代码，可进行函数的优化，内含函数的优化。(A classical ant colony algorithm's matlab code, can carry out the function optimization, contains the function optimization.)
code
- 基于蚁群算法的 TSP 求解，分别采用蚁群算法和蚁群算法-粒子群混合算法进行优化求解，使用不同的交叉和变异适应度函数更新粒子，从而实现 TSP问题的优化求解，更加逼近实际问题。(Based on the TSP solution of ant colony algorithm, ant colony algorithm and hybrid algorithm of ant colony algorithm particle swarm optimization are used to solv