Location:
Search - TSP
Search list
Description: 蚁群算法的c++实现程序，是一个求解tsp的简单的例子-Ant colony algorithm implementation c++ program is a simple example of solving tsp
Platform: |
Size: 2048 |
Author: nong |
Hits:
Description: TSP Algorithm (GRASP+Simmulated annealing) TSPLIB format compliant
Platform: |
Size: 114688 |
Author: spadks |
Hits:
Description: GA（遗传算法）求解TSP问题，GA（遗传算法）求解TSP问题。拿来分享下。-GA for solving TSP problems
Platform: |
Size: 2585600 |
Author: 杨扬 |
Hits:
Description: 一个蚁群算法求解邮递员路由问题（TSP）具体实现，本人在传统蚁群算法基础上进行改进，达到较高的效率-An ant colony algorithm for routing problem postman (TSP) concrete implementation, I am in the traditional ant colony algorithm based on the improvements to achieve higher efficiency
Platform: |
Size: 291840 |
Author: wangrenbiao |
Hits:
Description: 在Visual C++ 编译环境下，遗传算法的程序，并利用它们求解了48个城市的TSP问题。-In the Visual C++ compiler environment, the genetic algorithm process, and use them to solve a 48 cities TSP problem.
Platform: |
Size: 731136 |
Author: wjw |
Hits:
Description: 在MATLAB中用粒子群算法解决TSP问题。-use the particle swarm optimization(PSO) to solve the TSP problem。
Platform: |
Size: 3072 |
Author: hedongjing |
Hits:
Description: 解决TSp问题，对于初学者挺实用，大家可以讨论，QQ：297043183。-TSp solve the problem, quite useful for beginners, we can discuss, QQ: 297043183.
Platform: |
Size: 2048 |
Author: fangxin |
Hits:
Description: 旅行商问题，即TSP问题（Traveling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
TSP问题是一个组合优化问题。该问题可以被证明具有NPC计算复杂性。因此，任何能使该问题的求解得以简化的方法，都将受到高度的评价和关注。
-Traveling salesman problem, the TSP problem (Traveling Salesman Problem) is a well-known field of mathematics one of the problems. Suppose there is a travel merchant n cities to be visited, he must select the path to go, passing the restriction is to visit each city only once, and the last to go back to the original departure city. Path Selection The objective is to get the path distance for the minimum value among all the paths. TSP problem is a combinatorial optimization problem. This problem can be shown to have NPC computational complexity. Therefore, any solution of the problem can be simplified method will be subject to a high degree of evaluation and attention.
Platform: |
Size: 669696 |
Author: zhengjie |
Hits:
Description: 禁忌搜索的matlab程序，包括求解TSP问题，介绍和ppt-Matlab tabu search procedures, including the TSP problem solving, presentation and ppt
Platform: |
Size: 45056 |
Author: 周宇 |
Hits:
Description: 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。本程序即用matlab实现TSP问题。-Traveling salesman problem, the TSP problem (Travelling Salesman Problem) is a well-known field of mathematics one of the problems. The procedure that is the problem with the matlab implementation TSP.
Platform: |
Size: 2048 |
Author: zsy |
Hits:
Description: tsp问题的模拟退火算法实现,使用VC++实现，-TSP DEVELOPMENT BY VC+
Platform: |
Size: 3072 |
Author: lz |
Hits:
Description: 国外写的求解traveling salesman problem (TSP)问题的常用算法合集-a set of algorithms for TSP
Platform: |
Size: 258048 |
Author: 王鹏 |
Hits:
Description: 外国人写的求解traveling salesman problem (TSP)
和some related network optimization problems的算法合集-Concorde is a computer code for the traveling salesman problem (TSP)
and some related network optimization problems. The code is written
in the ANSI C programming language and it is available for academic
research use
Platform: |
Size: 753664 |
Author: 王鹏 |
Hits:
Description: this ACO algorithm for TSP problem-this is ACO algorithm for TSP problem
Platform: |
Size: 4096 |
Author: ehsan |
Hits:
Description: 实验四：分枝限界算法设计
实现课本上旅行售货员问题的分枝限界算法(P225)，随机生成两个规模为10和20的TSP实例，比较算法运行时间。
提交源代码以及实验报告。
-Experiment 4: Design and Implementation of Branch and Bound algorithm for the traveling salesman problem textbooks Branch and Bound algorithm (P225), randomly generated two size 10 and 20 of the TSP instance, comparison algorithm running time. Report submitted to the source code and experimental.
Platform: |
Size: 14336 |
Author: pactric |
Hits:
Description:
Platform: |
Size: 3778560 |
Author: mana |
Hits:
Description: 旅行商问题
订一个分支定界求解的旅行商问题- Branch&Bound
Platform: |
Size: 1024 |
Author: 王巧云 |
Hits:
Description: GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.-GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.
Platform: |
Size: 1024 |
Author: gardenia_roses |
Hits:
Description: discret pso for tsp discret pso for tsp discret pso for tsp-discret pso for tsp discret pso for tspdiscret pso for tspdiscret pso for tsp
Platform: |
Size: 1005568 |
Author: hach |
Hits:
Description: ant colony for tsp code
Platform: |
Size: 72704 |
Author: ehsan |
Hits: