搜索资源列表
SGALABbugfix
- 多目标遗传算法程序 to run Demo files, is to run SGALAB_demo_*.m what s new: 1) Multiple-Objective GAs VEGA NSGA NPGA MOGA 2) More TSP mutation and Crossover methods PMX OX CX EAX Boolmatrix 3) More selection methods
TSP
- 用模拟退火算法求解TSP问题 [1]主函数tsp.m [2]计算路径长度的子函数 route_long.m [3]随机交换两个节点的顺序函数exchange.m
蚁群算法求解TSP问题的matlab程序
- %蚁群算法求解TSP问题的matlab程序 clear all close all clc %初始化蚁群 m=31;%蚁群中蚂蚁的数量，当m接近或等于城市个数n时，本算法可以在最少的迭代次数内找到最优解 C=[1304 2312;3639 1315;4177 2244;3712 1399;3488 1535;3326 1556;3238 1229;4196 1004; 4312 790;4386 570;3007 1970;2562 1756;2788 1491;2381 1
ant-c-s
- 在matlab的环境下,利用ANT_COLONY算法求解TSP问题,灵活,精练,是你参考学习的好M文件-In the matlab environment, the use of TSP problem algorithm ANT_COLONY, flexible, concise, is that you learn a good reference document M
ACTSP
- 实现了蚁群算法求解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蚂蚁个数
MainAneal
- 求最短路径 tsp matlab M文件-The shortest path tsp matlab
ACATSP.m
- 基于蚁群算法解决TSP问题的三个matlab源程序，请多多交流！-TSP problem based on ant colony algorithm to solve the three matlab source, to a lot of communication!
mtspo_ga
- 旅行商问题，起点与终点为同一点，求最短路径，-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
yichuansuanfa
- 使用遗传算法求解TSP问题,文档文件里为坐标点，.m文件为程序源代码。-Genetic Algorithm for Solving the TSP Problem.
modified_tsp
- i m trying to modified Joseph Kirk work on TSP GA here but failed miserably. Trying to modify the operators from using mutation to crossover. Then try to implement it using the map toolbox and input city coordinates, but also fail. Help me please
gaTSP
- 采用GA算法解决TSP问题，包含所需的9个m文件和一个测试文本文件。其中bianma.m出现错误提示，尚未解决。仅供参考-GA algorithm to solve TSP, including the 9 m files and a test text file. The which bianma.m error occurs, remain unresolved. For reference only
Matlab_tsp
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序 D是距离矩阵，n为种群个数 参数a是中国31个城市的坐标 C为停止代数，遗传到第 C代时程序停止,C的具体取值视问题的规模和耗费的时间而定 m为适应值归一化淘汰加速指数,最好取为1,2,3,4,不宜太大 alpha为淘汰保护指数,可取为0~1之间任意小数,取1时关闭保护功能,建议取0.8~1.0之间的值 R为最短路径,Rlength为路径长度- TSP problem (also known as: traveling
mtsp
- 多旅行商问题的遗传算法 环形 固定节点- MTSPOFS_GA Fixed Start Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the "open" M-TSP by setting up a GA to search for the shortest route (le
ACO-for-TSP
- a ant colony optimization(aco) for traveling salesman problem(TSP).implementation in matlab.type of file:m file
Ant-colony-algorithm
- 蚁群算法解决TSP问题的MATLAB实现 出动m只蚂蚁，每只蚂蚁各随机选择一条路径，记为I=[1 2 3···m]，长度记为long(I) 计算出每条路径的信息素浓度，记为P(I)=1/long(I)，并进行归一化处理 重新出动m只蚂蚁，按如下规则选择路径： 每只蚂蚁都以一个概率p1选择新路径(路径随机)； 未选择新路径的蚂蚁以概率P(I)选择路径I； 所有蚂蚁都以一个小概率p2对自己的路径进行局部变化； 更新所有路径，计算出每条路径的信息素浓度； 重复上述步
mtspv_ga
- 基于遗传算法(GA)的多变量旅行商问题(TSP) ，MTSPV_GA Variable Multiple Traveling Salesman Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search fo
TSP-via-ants-colony
- here is m-files for tsp problem .it is well written with good descr iptions.and works even for large number of nodes.
MTSPF_GA
- 遗传算法计算多旅行商问题：多个商人从多个城市出发各自返回自己的出发城市。-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to a variation of the M-TSP by setting up a GA to search for the shortest route (least distance nee
TSP
- MATLAB TSP 算法，matlab .m文件-MATLAB TSP algorithm
Multiple-Traveling-Salesmen-Problem
- 多旅行商matlab实验源码实现了三种多旅行商问题,使用了遗传算法，可以在matlab2010a以上版本运行-MTSPOF_GA Fixed Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)