搜索资源列表
ACS
- 基本蚁群算法用于解决eil51 TSP问题代码，开发环境是VC-basic ant colony algorithm is used to solve eil51 TSP code development environment is VC
MAOS_TSP
- 用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）-for TSP (Traveling salesman problem, TSP), the implementation of basic run.bat see, see the
ACOTSP.V1.0.rar
- 解旅行商问题的ACO算法，包括了AS，EAS，ASRANK，MMAS，ACS,ACO to slove TSP. Including AS，EAS，ASRANK，MMAS，ACS.
ACS
- matlab编写的蚁群优化tsp程序，很不错，希望大家喜欢-ant colony optimization matlab prepared tsp procedures, very good, I hope everyone likes
ACS-TSP
- 蚁群算法在tsp（旅行商问题)的matlab程序。可以运行。-Ant colony algorithm in tsp (TSP) of the matlab program. Can run.
acs
- 利用蚂蚁算法求解TSP问题的matlab源程序，适合初学蚂蚁算法的朋友学习，同时又利于理解TSP问题。-The use of ant algorithm matlab source TSP problem, suitable for beginners to learn ant algorithm friends, but also conducive to understanding the problem TSP.
ACS
- 蚁群算法 控制台程序 基于类 不是基本的TSP模型的ant-cycle算法 而是蚁群系统 ant colony system算法-ANT COLONY ALGORITM. TSP MODEL. C++ CLASS BASED. ANT COLONY SYSTEM,NOT ANT-CYCLE ALGORITHM.
Genetic-Ant
- 遗传算法和蚂蚁算法融合的代码，比较好的利用了两种代码的优点，有很好的参考价值-Genetic Algorithm and Ant Algorithm code integration, better use of the advantages of two kinds of code, have a good reference value
ACOTSP.V1.0
- 大师级人物写的蚁群算法解决TSP问题,真的挺不错,你可以下下来看看的.- Program s name: acotsp Ant Colony Optimization algorithms (AS, ACS, EAS, RAS, MMAS, BWAS) for the symmetric TSP Copyright (C) 2004 Thomas Stuetzle This program is free software yo
TSP_matlab_code
- TSP_matlab_code using acs(Ant Colony Optimization) -TSP_matlab_code using acs(Ant Colony Optimization)
ACO-ACS
- algoritmo ACO soportado a c++ usando TSP
acs
- This manipulated code for ant colonies it can solve a kind of tsp-This is manipulated code for ant colonies it can solve a kind of tsp
ACS
- 用蚁群算法来解决，TSP（履行商人）最短路径问题。-TSP
1
- ACS解决TSP问题的代码，希望对大家有所帮助哦-ACS to solve the problem of code TSP
ACATSP
- 蚁群算法TSP问题解答方案，采用的是ACS的算法编码，可以自行更改其中的代码。-Questions program of ant colony algorithm TSP
ACS-31TSP
- 自己改进的蚁群算法求解31城市tsp问题的程序-Own improved ant colony algorithm program 31 cities tsp problem
ACS
- 蚁群算法求解TSP 假设条件： 1、非对称桥上的信息量与过去一个时间段内经过该桥的蚂蚁数目成正比； 2、某一时刻蚂蚁按照桥上残留的信息量多少来选择其中某座桥 3、经过该桥的蚂蚁数目越多则桥上的残留信息量就越大 -ACS for TSP