当前位置:
首页 资源下载
搜索资源 - traveling salesman problem
搜索资源列表
-
1下载:
带精英策略的蚂蚁算法,针对TSP问题做了研究(Ant Colony Algorithm for Traveling Salesman Problem)
-
-
0下载:
用遗传算法实现旅行商问题,可选择城市数量(Traveling salesman problem is realized by genetic algorithm, and the number of cities can be selected.)
-
-
1下载:
遗传算法,旅行商问题的python代码(The Python code of the genetic algorithm, the traveling salesman problem)
-
-
0下载:
这是完整的基于MATLAB的遗传算法的程序,是关于旅行商问题的求解(This is a complete procedure of genetic algorithm based on MATLAB, which is about solving traveling salesman problem.)
-
-
0下载:
A Genetic Algorithms and the Traveling Salesman Problem div hr d()
-
-
0下载:
这个代码可以有效地解决旅行商问题的组合优化问题(This code can effectively solve the combinatorial optimization problem of traveling salesman problem.)
-
-
0下载:
Traveling Salesman Problem
-
-
0下载:
实现推销员问题,算法作业,类似即TSP问题(Traveling Salesman Problem)又译为旅行推销员问题、货郎担问题,是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路……(To realize the problem of salesman)
-
-
0下载:
用来解决旅行商问题 可以直接运行 很好的代码(To solve traveling salesman problem, we can run good code directly.)
-
-
0下载:
蚁群算法解决旅行商问题,能够成功运行并且有结果(Ant colony algorithm can solve the traveling salesman problem and run successfully.)
-
-
0下载:
使用遗传算法解决了旅行商问题,采用C++做实现(The traveling salesman problem is solved by genetic algorithm, and implemented by C++.)
-
-
0下载:
5 kinds of genetic algorithms to solve multiple traveling salesman problem (mtsp) matlab program 5, respectively, the following situations: 1. Back to the starting point a different starting point (TSP fixed amount) 2. Back to the starting point a di
-
-
0下载:
遗传算法解决旅行商问题,可以解决N个城市最短路程问题并画图表示,给出迭代次数和最短距离(Solving the traveling salesman problem by genetic algorithm)
-
-
0下载:
tsp的java源码实现旅行商问题,即TSP问题(Traveling Salesman Problem)又译为旅行推销员问题、货郎担问题,是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市,他必须选择所要走的路径,路径的限制是每个城市只能拜访一次,而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(The Java source of TSP is one of the famous problems in the field of mathemati
-
-
1下载:
有效解决旅行商问题,与遗传算法相互结合。优化路线(Solve the traveling salesman problem effectively)
-
-
1下载:
matlab程序,遗传算法解决经典的TSP(旅行商)问题,不错的(The matlab program, the genetic algorithm to solve the classical TSP (traveling salesman problem, good)
-
-
0下载:
遗传算法 粒子群 蚁群等7种算法,可解决求极值问题以及旅行商问题(Genetic algorithm, particle swarm optimization and ant colony algorithm can solve extreme value problem and traveling salesman problem. 7 algorithms are used to solve extreme value problem and traveling salesman probl
-
-
1下载:
人工蜂群算法工具箱,可用于求解旅行商问题,以及多维数据极大值和极小值等问题(Artificial bee colony algorithm toolbox can be used to solve traveling salesman problem, multi-dimensional data maxima and minima and other issues!)
-
-
0下载:
Traveling Salesman Problem
市场上有很多种商品,旅行商 Shrek 做短期买卖赚取差价。他从一个城市购买一件商品,到达下一个相邻的城市就卖掉。如果这一次买卖无利可图,那么他就不会这么走。凭着自己和同伴多年的经验,他已经对地图上 n 个城市之间的差价了如指掌。两城市间可能有多种商品可赚取差价,此时 Shrek 只好倒卖利润最大的一件商品。
现在请你帮 Shrek 规划一条路线,使他能赚最多的钱。
输入
第一行两个整数 n、m。表示有 n 个城市,编号
-
-
1下载:
运用2-opt算法解决TSP(旅行商问题),满足自定义五个点及自设迭代次数,包括可视化结果。(TSP (Traveling Salesman Problem) is solved by using 2-opt algorithm, which satisfies five custom points and self-designed iteration times, including visualization results.)
-
«
1
2
...
45
46
47
48
49
50»