Description: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value Platform: |
Size: 4096 |
Author:宏姬 |
Hits:
Description: 主要解决旅行商问题(traveling saleman problem,简称tsp,即已知n个城市之间的相互距离,现有一个推销员必须遍访这n个城市,并且每个城市只能访问一次,最后又必须返回出发城市,求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the existing one salesman must traveled n this city, and visit each city only once, finally starting to return to the city, for the shortest distance from the genetic algorithm. Platform: |
Size: 1024 |
Author:阳文 |
Hits:
Description: 旅行商问题(TSP)是一个经典的优化组合问题,本个案列采用遗传算法来求解TSP问题,进行了选择、交叉、变异算子的设计,并通过MATLAB对算法进行了实现,附有详细的说明和代码。,The traveling salesman problem (TSP) is a classic combination optimization problem, in this case the column using a genetic algorithm to solve TSP problem selection, crossover and mutation operator design and realization by MATLAB algorithm, with detailed description and code. Platform: |
Size: 887808 |
Author:ZHENG |
Hits: