搜索资源列表
trp
- SA-TSP 模拟退火算法求解旅行商问题-SA - TSP simulated annealing algorithm for the traveling salesman problem
anneal_travel
- 用模拟退火算法求解旅行商问题，其中用STL中的Vector来实现路径的存放 -simulated annealing algorithm for the traveling salesman problem, which use the STL Vector to achieve the storage path
TSPSA.模拟退火算法SA求解TSP旅行商问题
- 模拟退火算法SA求解TSP旅行商问题。可以自己设定初始温度和冷却温度,SA simulated annealing algorithm for solving traveling salesman problem TSP. Can be set for the initial temperature and cooling temperature
matlab--tsp tsp问题 旅行商问题 matlab求解
- tsp问题 旅行商问题 matlab求解 遗传算法-TSP problem traveling salesman problem with MATLAB genetic algorithm
TS-TSP.rar
- 使用禁忌搜索算法求解TSP（旅行商问题）的JAVA源程序,The use of tabu search algorithm for solving TSP (Traveling Salesman Problem) the JAVA source code
2
- tsp遗传算法代码 利用交叉算子改进方法求解旅行商问题-tsp genetic algorithm code
TspSA
- 用模拟退火算法求解旅行商问题的代码，采用C++编写-Using Simulated Annealing Algorithm for Solving Traveling Salesman Problem code, using C++ Prepared
TSP11
- 这是一个很好用的多算法求解旅行商问题的源码。-This is a very good algorithm used in multi-source for Traveling Salesman Problem.
TspSA
- 用模拟退火算法对求解旅行商组合优化问题作了一定的研究，提出了多种不同的随机抽样方式，并对其进行了分析计算并以代码实现。 -This paper studied the optimizing of the traveling salesman problem with the Simulated Annealing(SA)． Different random sampling forms were proposed and analyzed．
TSPGA
- 旅行商问题求解 旅行商问题求解 旅行商问题求解-Traveling Salesman Problem Solving Traveling Salesman Problem Solving Traveling Salesman Problem Solving Traveling Salesman Problem Solving
genetic
- 使用遗传算法求解旅行商问题，城市数目及城市之间的距离通过txt文件来读入，然后输出求解过程及最后收敛到的最有路径-The use of Genetic Algorithm for Traveling Salesman Problem, the number of cities and the distance between cities through the txt file to read, and then output the solution process and the fina
HybridalgorithmbasedonabalancedstudyofMTSP
- 基于混合算法的均衡路程MTSP研究 给出了MTSP的整数线性规划模型、分类, 提出了均衡各旅行商访问路程和均衡各旅行商访问人数的多目标 问题针对均衡各旅行商访问路程的设计了相应的求解算法, 求解算法为遗传算法和一的混合算法给出了相应 的示例和实验结果, 并对实验结果的有效性进行了研究-Hybrid algorithm based on a balanced study of MTSP given distance of the MTSP integer linear programm
mtspf_ga
- 基于遗传算法的多旅行商问题求解，有过程变化图-MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
GATSP
- 用遗传算法求解旅行商问题，程序中的数据采用的是马少平，朱小燕编写的人工智能P298中的10城市的数据，运行的结果和书上给出的最优解一致，由于程序中群体规模设置的较大，程序运行时间可能需要7s左右。另外初始群体的生成是采用的排列组合算法，有兴趣的读者可以研究此算法的原理或共同探讨-A Genetic Algorithm for Traveling Salesman Problem, program data is in Ma Siu-ping, Xiao-Yan Zhu artificial in
program
- 基于遗传算法的旅行商问题求解 旅行商问题：假设有一个推销员，要到 n 个城市推销商品，他要找出一个包含所有 n 个城市的具有最小开销的环路-Traveling Salesman Problem Based on Genetic Algorithm for Traveling Salesman Problem: Suppose a salesman, to sell goods to the n cities, he has to find a city that contains all n
TSP
- 用贪心算法实现tsp(旅行商问题)求解，实现中国34个城市环游路线-With the greedy algorithm tsp (TSP) solution to achieve China' s 34 cities around the line
TSPandprogramme
- 旅行商问题求解的源代码，TSP问题（Traveling Salesman Problem），组合优化问题的求解。-The source code to solve the traveling salesman problem, namely TSP problem (Traveling Salesman Problem), combinatorial optimization problem solving.
VFSA
- 求模拟退火算法解旅行商问题,求解最优路径，为用户计算得到最经济的路线，一遍做决策。-Solving Traveling Salesman Problem seeking the simulated annealing algorithm for solving the optimal path, calculate the most economic route for the user, again to make decisions.
pso求解旅行商问题
- pso算法实现tsp问题，算法运行速度特别快(pso solves tsp problem)
改进pso可以求解城市数量大的旅行商问题
- 城市数量最大的改进的粒子群算法求解旅行商问题(Particle swarm optimization for traveling salesman problem)