搜索资源列表
aaa
- 遗传算法解决旅行商问题-The genetic algorithm to solve the traveling salesman problem. . . . . . . . . .
TSP
- 旅行商问题的matlab程序，34个城市，采取经营策略-Traveling salesman problem matlab program, 34 cities, to take the business strategy
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
yichuan
- 用遗传算法实现旅行商问题.答案可能都不一样（有时候不一定是最优的）。-Solve Traveling Salesman Problems with genetic algorithm.
tuihuo
- 用退火算法实现旅行商问题。问题的解不唯一。不一定是最优解。-Solve Traveling salesman problem with annealing algorithm.
hopfield
- hopfield神经网络解决旅行商问题。-hopfield TSP problem
TSP-Traveling-Salesman-Problem
- TSP解决旅行商问题，设计出最优最便捷的方案实现最好的效果。-TSP Traveling Salesman Problem, the optimal design of the most convenient solutions to achieve the best results.
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.)