搜索资源列表
TSPSA
- 模拟退火算法SA求解TSP旅行商问题。可以自己设定初始温度和冷却温度-SA simulated annealing algorithm for solving traveling salesman problem TSP. Can be set for the initial temperature and cooling temperature
vrp_matlab
- 旅行商问题，城市坐标、交配概率和变异概率、遗传代数-vrp
TSP_Based_on_Genetic_Algorithm
- 论文，:从应用的角度讨论了基于遗传算法的旅行商问题( Travelling Salesman Problem ,简称TSP) 的求解方 法,并结合实例给出了求解过程和计算机仿真结果-Solution of Travel ing Salesman Problem Based on Genetic Algorithm
TSP_by_dynamic_programming
- 使用C++ 实现的，利用动态规划算解决旅行商问题-solving TSP problem with dynamic programming in C++
ACATSP
- 蚁群算法实现TSP旅行商问题并带图形输出-ant colony optimization algorithm for tsp
TSPMatlab
- 这是一个用Matlab程序写的模拟退火算法，用于解决旅行商问题-It s a matlab code for TSP problem using SA Algorithm
GA_java
- java版的经典遗传算法源码 功能：经典遗传算法类，用来实现其在NM96文献中关于旅行商问题的算法.-Genetic Algorithm source code in java
AntColonyAlgorithmTsp
- 用蚁群算法求解TSP（旅行商问题）。附上实验报告-ant colony algorithm
TSP
- 本系统是用C#语言进行旅行商问题（TSP)的实验仿真，来实现从一个城市到最后一个城市的最短路径的模拟。-This system is to use C# language Traveling Salesman Problem (TSP) of the experimental simulation, to move from one city to the last one the city' s shortest path si
GATSP201046
- 使用遗传算法解决旅行商问题，用户自己设置城市参数，有良好的处理速度！-The use of genetic algorithm to solve traveling salesman problem, the user set up their own city parameters, good speed!
ant
- 蚁群算法结合2-opt技术解决旅行商问题（TSP）-Ant colony algorithm with 2-opt technology to solve the traveling salesman problem (TSP)
travelingsalesmanproblem
- 这是用Delphi编写的动态规划旅行商问题，程序完整，可运行-It is written in Delphi traveling salesman problem dynamic programming, program integrity, and can run. . .
TSPPSO
- 用该进的粒子群优化算法来解决旅行商问题，即TSP问题（Traveling Salesman Problem）-Using the advanced PSO algorithm to solve TSP（Traveling Salesman Problem）
ABC解决TSP问题程序
- ABC算法解决TSP旅行商问题，使用matlab语言，适应于ABC算法的初学者(The ABC algorithm for solving TSP problem)
tsp_NSGA
- 解决多目标的旅行商问题，可得出非劣解和前沿图(To solve the multi-objective traveling salesman problem, we can obtain the non inferiority solution and the frontier graph)
Ant_TSP
- 基于蚁群算法的旅行商问题，matlab源代码，带功能说明(Ant colony algorithm for traveling salesman problem matlab source code)
GATraveller
- GAT旅行商，随机生成城市，一个出发点，最终回到初始点。遍历计算，求最短路径(GAT travel agents randomly generate cities, a starting point, and eventually back to the initial point. Traversal calculation, seek the shortest path)
mtsp问题matlab代码
- 使用ga算法，通过八种评价机制解决多旅行商问题(The GA algorithm is used to solve the multiple traveling salesman problem via eight evaluation mechanisms)
旅行商
- 利用分支界限算法实现旅行销售商问题的分支限界算法(Branch and bound algorithm for the traveling salesperson problem)
acatsp
- 利用蚁群算法仿真解决旅行商问题，找出最短路径(Ant colony algorithm to solve traveling salesman)