搜索资源列表
ann_and_ga_soft
- 用神经网络和遗传算法解决tsp问题，先使用神经网络训练出较优个体，然后再进化，可以反其道而行，-using neural networks and genetic algorithms to solve the problem tsp first use of neural network training of better individual, then evolution can be just the opposite.
tsp+vrp.rar
- 详细讲述模拟退火算法的理论原理。并TSP问题为例进行讲解，并各处多种语言的源代码，包括c，matlab以及delphi。 ,Simulated annealing algorithm described in detail the theory of principle. And TSP as an example to explain the problem and the source code of various languages, including c, matlab, as w
gatspexe
- 给出一个运行用遗传算法运算的Delphi可执行程序。可以解决TSP问题。-Give a running operations using genetic algorithms Delphi executable program. TSP problem can be solved.
ANNEALTSP
- solving the TSP problem
tsp
- 用蚁群原理编写的商旅路径的优化问题，可以自动绘制各种曲线图，以反应收敛的程度-With the ant colony principle to write business path optimization problem, can be automatically draw all kinds of graph, in order to response the degree of convergence
TSP
- 旅行商问题的matlab程序，34个城市，采取经营策略-Traveling salesman problem matlab program, 34 cities, to take the business strategy
tsp
- tsp问题，算法简单灵巧，解决tsp问题的良法-tsp problem, the algorithm is simple and ingenious, settlement tsp good law
TSP_matlab
- 旅行商问题(TSP)是典型的NP完全问题，遗传算法是求解NP完全问题的一种常用方法。旅行商问题(TSP)的蚁群算法实现算法。在MATLAB中用遗传算法施行对TSP问题进行了求解，进行了选择、交叉和变异算子进行了算法设计。MATLAB源代码。-Traveling Salesman Problem (TSP) is a typical NP-complete problem, genetic algorithm for solving NP-complete problems, a common m
neural-network-solving-tsp
- 神经网络解决旅行商问题，讨论了矩阵大小对算法稳定性的影响。土木工程领域中，常用于进行结构参数识别等。-Neural network to solve the traveling salesman problem, discussed the impact of the size of the matrix algorithm stability. The field of civil engineering, structural parameters commonly used in iden
TSP
- this an interface for TSP (travelling salesman problem ) -this is an interface for TSP (travelling salesman problem )
belguembour-et-bellakhelef
- PSO algorithm for solving TSP problem
AGCode.tar
- Implamentation to problem TSP in Matlab
hopfield
- hopfield神经网络解决旅行商问题。-hopfield TSP problem
TSP
- Traveling salesman problem
TSP-Traveling-Salesman-Problem
- TSP解决旅行商问题，设计出最优最便捷的方案实现最好的效果。-TSP Traveling Salesman Problem, the optimal design of the most convenient solutions to achieve the best results.
遗传算法txt
- 遗传算法解决tsp问题 遗传算法，模拟达尔文进化论的自然选择和遗传学机理的生物进化过程的计算模型，一种选择不断选择优良个体的算法。谈到遗传，想想自然界动物遗传是怎么来的，自然主要过程包括染色体的选择，交叉，变异（不明白这个的可以去看看生物学），这些操作后，保证了以后的个体基本上是最优的，那么以后再继续这样下去就可以一直最优了。(Genetic algorithm to solve TSP problem)
2-opt
- 运用2-opt算法解决TSP（旅行商问题），满足自定义五个点及自设迭代次数，包括可视化结果。(TSP (Traveling Salesman Problem) is solved by using 2-opt algorithm, which satisfies five custom points and self-designed iteration times, including visualization results.)