Description: 这是一个用遗传算法来求解旅行商问题(TSP问题:Travelling Salesman Problem)的源代码,学习遗传算法,演化计算的很值得一看!-This is a genetic algorithm to solve the traveling salesman problem (TSP problems: Travelling Salesman Problem) source code, learning genetic algorithm, evolutionary computation is very worth a visit! Platform: |
Size: 71680 |
Author:郭肇禄 |
Hits:
Description: 用C语言实现旅行商问题。该算法简单精悍,效率也不低,是实现TSP问题的很好的算法。-Using C language realize traveling salesman problem. The algorithm is simple and lean, efficiency is not low, the problem is to achieve a good TSP algorithms. Platform: |
Size: 236544 |
Author:锭 |
Hits:
Description: This program gives solution to the Travelling Salesman problem (TSP). I use genetic algorithm, tabu search, exhaustive search. It all combine in a windows application. Platform: |
Size: 60416 |
Author:yyavuz |
Hits:
Description: Best First Search Algorithm
to Puzzle game- Best First Search Algorithm
to Puzzle game
Platform: |
Size: 88064 |
Author:dewi_irianti |
Hits:
Description: 论文,:从应用的角度讨论了基于遗传算法的旅行商问题( Travelling Salesman Problem ,简称TSP) 的求解方
法,并结合实例给出了求解过程和计算机仿真结果-Solution of Travel ing Salesman Problem Based on Genetic Algorithm Platform: |
Size: 346112 |
Author:li dabao |
Hits:
Description: 利用遗传算法求解旅行商问题
旅行商问题,即TSP问题(Travelling Salesman Problem)是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路经的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths. Platform: |
Size: 7168 |
Author:yanzhongyuan |
Hits:
Description: The simulation of the travelling salesman problem using the Nearest neighbor method and the genetic algorithm Platform: |
Size: 87040 |
Author:Sudaraka |
Hits: