搜索资源列表
-
0下载：
专门用于求解TSP问题的matlab编制的蚁群算法,此程序的优化效率和鲁棒性都非常好,Ant Colony Algorithm for Traveling Salesman Problem,very efficient and robust
-
-
0下载：
一种用matlab写的群集智能算法-蚁群算法,Of a cluster with matlab to write intelligent algorithm- ant colony algorithm
-
-
1下载：
用MATLAB编写的蚁群算法最短路径寻找程序，压缩包内包含了网络结点坐标。-The preparation of the ant colony algorithm using MATLAB to find the shortest path procedure, compressed package that contains a network node coordinates.
-
-
2下载：
matlab编写的蚁群优化tsp程序，很不错，希望大家喜欢-ant colony optimization matlab prepared tsp procedures, very good, I hope everyone likes
-
-
1下载：
一共四个蚁群算法 程序源码，三个matlab，一个C语言-A total of four procedures for source code ant colony algorithm, three matlab, a C language
-
-
0下载：
利用蚁群算法解决旅行商问题，其中运用智能蚂蚁算法-Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem
-
-
0下载：
帮助大家认识蚁群算法 附上典型TSP的dat文件供大家测试-Ant colony algorithm to help you understand the typical TSP attached dat file for all the test
-
-
0下载：
Contour Correspondence via Ant Colony Optimization
Oliver van Kaick <ovankaic@cs.sfu.ca>
http://www.cs.sfu.ca/~ovankaic/personal/
This MATLAB implementation computes a correspondence between two shapes
based on ant colony optimi
-
-
0下载：
无约束连续函数优化的人工蚁群算法通用MATLAB源码
此源码是对人工蚁群算法的一种实现，用于无约束连续函数的优化求解，对于含有约束的情况，可以先使用罚函数等方法，把问题处理成无约束的模型，再使用本源码进行求解
-Unconstrained optimization of continuous function of artificial ant colony algorithm for general-purpose MATLAB source code。
This sour
-
-
0下载：
This MATLAB implementation computes a correspondence between two shapes based on ant colony optimization (ACO). The input shapes can be either two 2D contours (open or closed) or two arbitrary sets of 2D points.
-
-
0下载：
matlab编的蚁群算法解TSP问题（att48），调整参数可解决多类问题。-matlab code of ant colony algorithm for solving TSP problems (att48), adjust the parameters to resolve multi-class problems.
-
-
1下载：
蚁群算法（ACO）解决旅行商问题（TSP）的matlab程序。数据取自Oliver30。-Ant colony optimization (ACO) to solve the traveling salesman problem (TSP) in the matlab program. Data from Oliver30.
-
-
0下载：
This MATLAB implementation computes a correspondence between two shapes
based on ant colony optimization (ACO). The input shapes can be either
two 2D contours (open or closed) or two arbitrary sets of 2D points. The
algorithm is described in de
-
-
2下载：
用改进的蚁群算法来解决旅行商问题，以寻求最优解！-Improved ant colony algorithm used to solve the traveling salesman problem, to find the optimal solution!
-
-
0下载：
Ant colony algorithm and TSP
-
-
1下载：
蚁群算法，计算各个城市之间的线路问题，使用matlab实现-aco ant colony optimization，matlab
-
-
0下载：
Solve Travelling Salesman Problem Using Ant Colony Optimization
-
-
0下载：
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 a
-
-
0下载：
ant colony optimization algorithm implementation matlab
-
-
1下载：
蚁群优化是一组概率性元启发式算法和智能优化算法，受蚂蚁社会行为的启发。(Ant Colony Optimization (ACO) are a set of probabilistic metaheuristics and an intelligent optimization algorithms, inspired by social behavior of ants.)
-
