Welcome![Sign In][Sign Up]
Location:
Search - TSP ant-Q

Search list

[AI-NN-PR51个城市的tsp程序

Description: 这是一个用蚁群算法来解决51个城市的tsp问题,该源码是用C++编写的,是一个非常有用的源代码 const int iAntCount=34;//ant numbers 蚂蚁数量 const int iCityCount=51;//城市数量 const int iItCount=500;//循环次数 const double Q=100;//信息素总量
Platform: | Size: 1578 | Author: cuifangsong | Hits:

[Documents一种求解TSP的蚁群算法

Description: 一种求解TSP的蚁群算法-a solution of TSP Ant Algorithm
Platform: | Size: 35840 | Author: 王涛 | Hits:

[matlabACTSP

Description: 实现了蚁群算法求解TSP问题。注释详细 function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q) ------------------------------------------------------------------------- 主要符号说明 C n个城市的坐标,n×2的矩阵 NC_max最大迭代次数 m蚂蚁个数 Alpha表征信息素重要程度的参数 Beta表征启发式因子重要程度的参数 Rho信息素蒸发系数 Q信息素增加强度系数 R_best各代最佳路线 L_best各代最佳路线的长度 ========================================================================= -Ant Colony Algorithm for the realization of the TSP problem. Notes the detailed function [R_best, L_best, L_ave, Shortest_Route, Shortest_Length] = ACATSP (C, NC_max, m, Alpha, Beta, Rho, Q) ------------------------------------------------------------------- The main symbol------ C n that cities coordinates, n × 2 matrix NC_max the largest number of iterations m the number of Alpha ant pheromones characterized the importance of the parameters Beta factor heuristic importance of characterization of the parameters Rho evaporation coefficient of pheromone pheromone Q increase in intensity coefficient R_best best route generations generations L_best the length of the best route ====== ================================================== =================
Platform: | Size: 2048 | Author: 王晶 | Hits:

[AI-NN-PRACOforTSP

Description: tsp问题的群蚁算法实现,其中c为测试矩阵,代表各点的相对坐标,NC_max 最大迭代次数 ,m蚂蚁个数,Alpha 表征信息素重要程度的参数,Beta 表征启发式因子重要程度的参数,Rho 信息素蒸发系数,Q 信息素增加强度系数,R_best 各代最佳路线,L_best 各代最佳路线的长度,运行后得到最佳路线和收敛曲线-ant problem tsp algorithm group, of which c for the test matrix, the representative of the relative coordinates of the points, NC_max the largest number of iterations, m the number of ants, Alpha pheromone characterization of the importance of the parameters, Beta factor, the importance of heuristic characterization of the parameters , Rho pheromone evaporation factor, Q factor pheromone to increase strength, R_best generations the best route, L_best generations the best route length, running the best routes and the convergence curve
Platform: | Size: 1024 | Author: WJC | Hits:

[Windows DevelopACOforTSP

Description: ant colony for tsp code
Platform: | Size: 72704 | Author: ehsan | Hits:

[OtherTCP

Description: 蚁群算法是当前研究非常火热的一种智能算法,下面的蚁群算法程序专门用于求解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 following ant colony algorithm for solving TSP problem specifically, we tested through simulation and found to optimize the efficiency and robustness of this program are very good. function [R_best, L_best, L_ave, Shortest_Route, Shortest_Length] = ACATSP (C, NC_max, m, Alpha, Beta, Rho, Q)
Platform: | Size: 2048 | Author: 冯丁 | Hits:

CodeBus www.codebus.net