搜索资源列表
SGALAB1003beta3withdoc
- run the SGALAB_MO_VEGA_demo.m in command windows. to get beta3 version here: http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=5882 What s new: 1)fixed a critical bug in selection operation 2)update the 13 c
TravelingSalesmanProblemwithGeneticAlgorithm
- this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checki
wujiao-elimcross
- wujiao.m是五角星去交叉程序，用于使求出的tsp去交叉，应用见我上载的ant-tsp-elimcross程序 nixu.m是wujiao.m求逆序的测试程序-wujiao.m is five-pointed star to cross procedures for so to get the cross-tsp. I see on the application contained in the ant-tsp - elimcross nixu.m is wujiao procedur
satsp
- 这是一个SA求解tsp旅行商的matlab源代码，由m文件构成，可方便大家学习模拟退火算法。-This is a traveling salesman tsp SA for the Matlab source code, document constitute m, can facilitate learning simulated annealing.
TSP_ACO
- 用蚁群算法求解TSP（旅行商）问题，按照TSP.m中要求的格式输入程序参数即可运行！
m
- 模拟退火算法实现，内负有模拟退火的聚类，TSP等等6种问题的实现例子，在EXAMPLE文件夹内
TSP
- 蚁群算法是新兴的仿生算法，最初是由意大利学者Dorigo M于1991年首次提出，由于具有较强的鲁棒性，优良的分布式计算机制和易于与其它方法结合等优点，成为人工智能领域的一个研究热点。本程序是实现简单的蚁群算法
TSp
- cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
AHybidGeneticAgorithmtoSolveTS
- 求解TSP和MTSP的混合遗传算法_英文_,Abstract:M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2 mum. Th is is called
GA-TSP
- 遗传算法求解TSP问题。包含6个文件。用matlab打开gatsp1.m，点击运行即可以得出结果。distTSP.txt文件包含了城市数据。如果更改了城市数，则须修改gatsp1.m文件中的N参数。-Genetic algorithm for TSP. Contains 6 files. Using matlab to open gatsp1.m, click on the results of running that can be drawn. distTSP.txt file contai
tsp-ga.m
- sovling TSP(Travelling Salesman Problem) with GAs -sovling TSP (Travelling Salesman Problem) with GAs
TSPandMTSP
- MTSP 问题其实与单 旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条 件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。-M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup c
ACOforTSP
- 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
AntSystem
- 一个较好的蚁群MATLAB程序，附地图。-In this M-file, the implemention of ACO Algorithm is given with the support of reference papers listed. You can easily use it as following command to see the pictures of result and the iterative playing course.
mtspf_ga
- 基于遗传算法的多旅行商问题求解，有过程变化图-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
mtsp_ga
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exactly o
AntSystem-WithPlay
- matlab,蚁群算法解TSP，M文件，最优解-matlab, ACO for TSP, M files, the optimal solution
tsp_SA.m
- 基于神经网络的模拟退火算法解决tsp问题 matlab实现-Neural network-based simulated annealing algorithm to solve the problem tsp matlab implementation
TSP
- tsp for (int i=0 i<M i++) S[i] = i S[M] = 0 T = 1000 //初始温度1000 Tl = 35000 //内循环次数35000 a = 0.93 //温度下降系数 k = 0 PreMin = 0 Path = GetPath(S) srand((unsigned)time( NULL )) cout<<"The initial Path Diste
tsp
- 一个演示如何使用TSP测试库的matlab程序，参数设置在主程序tsptest.m中，然后调用函数文件InitTSPSimAn.m-A demonstration of how to use the the TSP test library matlab procedures, parameters are set in the main program tsptest.m, then call the function file InitTSPSimAn.m