Location:
Search - GA_T
Search list
Description: 利用遗传算法求解TSP问题。TSP问题描述如下：给定一组n个城市和他们两两之间地直达距离，寻找一条闭合的旅程，使得每个城市刚好经过一次而且总的旅行距离最短。 -The use of genetic algorithm to solve TSP problem. TSP problem described as follows: given a set of n cities and they are between 22 to direct the distance of the journey to find a closed, making every city just after the total travel time and the shortest distance.
Platform: |
Size: 1159168 |
Author: 586 |
Hits: