搜索资源列表
HeuristicGuilherme
- Heuristic solution for the traveling salesman problem
tsp
- 多旅行商问题，最小生成树优化。 提供新思路-Multi-traveling salesman problem, minimum spanning tree optimization. To provide new ideas
TabuSearchforTSP
- This gives source code of traveling salesman problem. The algorithm used is tabu search.
mtspf_ga
- Genetic Algorithm that solves te Multiple Travelling Salesman Problem. This algorithm uses fixed start and end points
mtsp_ga
- Algorithm that solves the Multiple Travelling Salemsan Problem. This algorithm needs the starting position of every salesman.
Salesman
- Salesman With Genetic
local_search
- 运用局部搜索算法实现旅行商问题。作者：陈华昌-The use of local search algorithm traveling salesman problem. Author: Chen Huachang
noising_method_articles
- Great articles on noising method algorithm for travelling salesman problem-Great articles on noising method algorithm for travelling salesman problem
DSS_HW1_2009
- a version of travelling salesman problem
tsp_ga_cities
- Develop a generic genetic algorithm to solve the traveling salesman problem with 20 cities that are uniformly distributed within a unit square in a 2-dimensional plane.
2
- PSO求解TSP问题的参考文献，查询学校IEEE检索得到！-Particle Swarm Optimization Based on Neighborhood Encoding for Traveling Salesman Problem
upload5
- 遗传算法求解旅行商问题。在n=20的情况下依然能90 以上获得正确解。-Genetic Algorithm for Traveling Salesman Problem. In the case of n = 20 can still obtain the correct solution for more than 90 .
MATLAB
- 用MATLAB求解遗传算法的旅行商问题，这一类问题在大学生以及研究生的数模竞赛以及日常生活当中尤为重要的，为我们所重视。、近年来，学术界对旅行商问题也逐渐重视起来。-Using MATLAB genetic algorithm for solving the traveling salesman problem, this kind of problem students and graduate students in Mathema
genetic
- genetic algorithm used to solve travelling salesman prolem
TSP
- 利用遗传算法求解旅行商问题 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling salesman problem using genetic algorithm travelin
Traveling-Salesman
- his the classic traveling salesman problem. A traveling salesman has to visit 19 cities in any order. Each city has a profit to be earned by moving from a city to a different city. Each movement has a different pay
ACOTSP.V1.0
- Traveling salesman problem with Ant Colony Optimization-Traveling salesman problem with Ant Colony Optimization
Salesman
- Travelling salesman problem descr iption to code in matlab is provided in this document
New-Folder
- Modified Hopfield Neural Network for Travelling Salesman Problem
traveling-salesman-problem
- 遗传算法解决旅行商问题,遗传算法对解决NP问题.-Genetic algorithm to solve traveling salesman problem, genetic algorithm to solve the NP problem.