搜索资源列表
multisp
- 使用MPI编写一个并行程序，利用遗传算法来解决旅行商问题。
tspGA
- 采用遗传算法解决ＴＳＰ旅行商问题 对初学遗传算法者很不错
Parallel_TSP
- 基于MPI并行技术，用遗传算法解决旅行商问题-MPI TSP GA
MATLAB
- 用MATLAB求解遗传算法的旅行商问题，这一类问题在大学生以及研究生的数模竞赛以及日常生活当中尤为重要的，为我们所重视。、近年来，学术界对旅行商问题也逐渐重视起来。-Using MATLAB genetic algorithm for solving the traveling salesman problem, this kind of problem students and graduate students in Mathematical Modeling Contest, and da
tsp_ga
- 遗传算法，matlab编写的源代码，用于解决旅行商等np问题，算法效率高-Genetic algorithm written in Matlab source code used to solve the traveling salesman and other np, high efficiency of the algorithm
tsp-chang
- 5个城市TSP（旅行商问题）的基于遗传算法的C++源代码，希望对于你学习遗传算法会有一定的帮助-Five cities TSP (traveling salesman problem), genetic algorithm-based C++ source code, there will be some hope for you to learn the genetic algorithm help
Genetic-Algorithm
- 本程序用遗传算法基于C语言解决10个城市的旅行商问题，可求出10个城市之间的最短距离。-The procedures used to solve a 10-city traveling salesman problem, genetic algorithm based on the C language can be calculated the shortest distance between the 10 cities.
TSP---Matlab
- 将遗传算法用于旅行商问题求最佳路径的算法，程序简单易懂-The genetic algorithm for traveling salesman problem the optimal path algorithm, program is simple and easy to understand
genetic-algorithm
- 在旅行商问题中利用遗传算法求解，这是遗传算法的代码-genetic algorithm
tsp
- 这个文件主要涉及tsp问题，即旅行商问题，采用遗传算法。-This paper mainly involves the TSP problem, the traveling salesman problem, using genetic algorithm.
Cpp1
- 遗传算法TSP，旅行商问题，1． 假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求所经过的路径路程尽量短。-Genetic algorithm TSP, Traveling Salesman Problem, 1. Suppose you have a traveling businessman to visit n cities, he must choose the path to go, a re