搜索资源列表
function
- 遗传算法小程序,关于解决TSP问题的遗传算法,仅供参考,多多交流-GA small program on the settlement of the TSP Genetic Algorithm for reference purposes only and interact more
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
SGA_TSP
- 标准GA算法解决TSP问题的Matlab源代码-standards GA solution of TSP Matlab source code
TravelingSalesmanProblemGeneticAlgorithm
- Finds 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)
tsp_matlab
- Matlab的GA程序，利用遗传算法求TSP问题
tsp-ga
- 基于遗传算法解决旅行商问题的vc++源码。
tspwt
- 自己根据其他例子改编的MATLAB的GA工具箱实现TSP的程序
GA for TSP
- 关于经典NP问题的处理！-on the classic question of NP!
modifidedGAforTSP
- 改进GA解决TSP问题，引入精英保留策略和其它两种变异算子（邻位变异、倒位变异）来增加种群多样性。
旅行商问题
- % 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 needed for % each salesman to trav
GABOX
- 遗传算法实现TSP问题的工具箱程序，还包括大量遗传算法方面的实例，是很丰富的GA工具箱。-TSP problem genetic algorithm toolbox program also includes many examples of aspects of genetic algorithm, GA is a very rich toolbox.
VRP_GA.rar
- 用GA遗传算法求解VRP车辆配送问题，以及VRP的特殊情况TSP旅行商问题,GA Genetic Algorithm for VRP with the distribution of vehicles, as well as the special circumstances of VRP Traveling Salesman Problem TSP
GA_TSP
- 遗传算法结局旅行商问题，有界面显示.实现简单的问题，初学者下载可以学习到很多东西。-the GA for TSP,has the gdi
Parallel_TSP
- 基于MPI并行技术，用遗传算法解决旅行商问题-MPI TSP GA
TSP(GA)
- 遗传算法求解TSP问题的全部函数，运行时间很短。(THE FUNCTION OF GA to solve the tsp problem.)
6. TSP Prog
- 遗传算法解决旅行商问题，可以解决N个城市最短路程问题并画图表示，给出迭代次数和最短距离(Solving the traveling salesman problem by genetic algorithm)
ga_TSP
- 遗传算法求解TSP问题，可生成迭代图像，有详细中文注释(Solving TSP problem by GA)
GA优化TSP
- TSP是典型的NP完全问题，即其最坏情况下的时间复杂性随着问题规模的增大按指数方式增长，到目前为止不能找到一个多项式时间的有效算法。实践证明，遗传算法对于解决TSP问题等组合优化问题具有较好的寻优性能。
基于混合pso的TSP搜索
- 混合pso摒弃了传统pso算法中的通过跟踪极值来更新粒子位置的方法，而是引入了GA，通过粒子同个体极值和群体极值的交叉的方式来搜索最优解。