文件名称:tsp_ga
- 所属分类：
- matlab例程
- 资源属性：
- [Matlab] [源码]
- 上传时间：
- 2014-05-26
- 文件大小：
- 3kb
- 下载次数：
- 0次
- 提 供 者：
- XIAOM*****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
Summary:
1. A single salesman travels to each of the cities and completes the
route by returning to the city he started from
2. Each city is visited by the salesman exactly once- TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
Summary:
1. A single salesman travels to each of the cities and completes the
route by returning to the city he started from
2. Each city is visited by the salesman exactly once
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
Summary:
1. A single salesman travels to each of the cities and completes the
route by returning to the city he started from
2. Each city is visited by the salesman exactly once- TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
Summary:
1. A single salesman travels to each of the cities and completes the
route by returning to the city he started from
2. Each city is visited by the salesman exactly once
(系统自动生成,下载前可以参看下载内容)
下载文件列表
tsp_ga.m