Location:
Search - AS-TSP
Search list
Description: 一些模拟退火算法及元代码,可以用于解决TSP问题的等，我已经验证过了
可以的，速度比较快，大家可以下载试试！
-some simulated annealing yuan and the code can be used to solve problems such as TSP, I can be tested, and faster speed, you can download a try!
Platform: |
Size: 39886 |
Author: 刘三 |
Hits:
Description: tsp问题的蚂蚁算法-ant colony algorithm for TSP problem
Platform: |
Size: 1024 |
Author: 邓连波 |
Hits:
Description: 一些模拟退火算法及元代码,可以用于解决TSP问题的等，我已经验证过了
可以的，速度比较快，大家可以下载试试！
-some simulated annealing yuan and the code can be used to solve problems such as TSP, I can be tested, and faster speed, you can download a try!
Platform: |
Size: 39936 |
Author: 刘三 |
Hits:
Description: 实现用固定变异概率和自适应变异概率解tsp问题的比较，自适应式算法采用基于种群差异度的自适应算法，详见实验报告-achieve fixed mutation probability and Adaptive Solutions tsp mutation probability of comparison, Adaptive Algorithm-based differences in the populations adaptive algorithm, as detailed experimental report
Platform: |
Size: 2419712 |
Author: 叶靥 |
Hits:
Description: 在http://elib.zib.de/pub/Packages/mp-testdata/tsp/tsplib/tsp/上下载eil51地图，以eil51.tsp与源程序存在一起-at http :// elib.zib.de/pub/Packages/mp- testdata/t sp/tsplib/tsp/eil51 download maps, eil51.tsp to exist together with the source
Platform: |
Size: 3072 |
Author: huanxong |
Hits:
Description: tsp问题俗称旅行商问题，一个商人从一个城市出发，经过所有的城市一次且仅一次回到出发的城市，问旅行商应当如何选择路径使总路径最短。本程序是用lingo软件编写的，只需要更改城市的数目以及距离矩阵即可。-tsp problem commonly known as the traveling salesman problem, a businessman from a city of departure, after all of the city once and only once returned to the starting city TSP question should be how to choose the shortest path so that the total path. This procedure is used lingo software programmers only need to change the number of cities as well as the distance matrix can be.
Platform: |
Size: 1024 |
Author: 雷浩 |
Hits:
Description: "遗传算法"以及"退火算法"用C++语言可以直接运行-Genetic algorithm as well as the annealing algorithm C++ Language can be directly run
Platform: |
Size: 1419264 |
Author: mause |
Hits:
Description: 包括蚁群，模拟退火，遗传，神经网络，禁忌搜索等智能优化算法对TSP问题的解决。-Including ant colony, simulated annealing, genetic, neural networks, tabu search, such as intelligent optimization algorithm to TSP problem.
Platform: |
Size: 7168 |
Author: orange |
Hits:
Description: Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
Platform: |
Size: 446464 |
Author: yangdi |
Hits:
Description: 通过神经网络，蚁群算法，遗传算法等智能优化方法解决TSP问题-Through neural networks, ant colony algorithm, genetic algorithm, such as intelligent optimization methods to solve TSP problems
Platform: |
Size: 9216 |
Author: anson |
Hits:
Description: 段海滨教授主编的《蚁群算法原理及其应用》附录里的C程序代码-Professor Duan Haibin editor-in-chief of
Platform: |
Size: 6144 |
Author: 杨永飞 |
Hits:
Description: cost存放了一个强连通图的边权矩阵，作为一个实例。
可在workspace中加载
运用此算法要注意多次试验。
bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
Platform: |
Size: 11264 |
Author: 岳明 |
Hits:
Description: 标准的pso 程序，可用于tsp 等优化问题，大家分享交流 共同进步。-Standard PSO procedure, can be used for optimization problems, such as tsp, we shared the common progress.
Platform: |
Size: 1024 |
Author: 曹洪印 |
Hits:
Description: 遗传算法实现TSP算法，包括选择、交叉等操作-TSP algorithm for genetic algorithm implementation, including selection, crossover, such as operation
Platform: |
Size: 86016 |
Author: evan |
Hits:
Description: 多旅行商问题(Multiple Traveling Salesperson Problem ,简称MTSP) 讨论的是如何安排m( > 1 ) 位旅行商访问n( >
m ) 座城市,要求每个城市只允许被访问一次时,求解所有旅行商花费的费用和是最小(或最大) 的问题。MTSP 问题其实与单
旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条
件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。现
为解决MTSP 问题给出了一种新的染色体设计和相关的处理方法,并与以往的理论设计和计算性能进行比较。计算测试显
示,新的方法能够获得较小的查找空间,在许多方面,新的方法产生的解空间更好。-Multi-Traveling Salesman Problem (Multiple Traveling Salesperson Problem, referred to as MTSP) discussed the arrangements for the m (> 1)-bit traveling salesman visits n (>
m) cities to require each city to allow only visited once, the solution of traveling salesman to spend all the costs and the smallest (or largest) problems. In fact, with the single issue of MTSP
TSP (Traveling Salesperson Problem, referred to as TSP) is similar to, but added any city as long as the visit by a traveling salesman to be attached to the
Pieces, thus increasing the complexity of the problem. The use of genetic algorithms in the past (GA) to study and solve the issue of MTSP, usually a standard chromosome and the TSP approach. Is
MTSP problem to solve is given a new design and associated chromosome approach and the theory of the previous design and to compare performance. Calculation of the test significantly
Show that the new method can find a smaller space, in many respects, the new met
Platform: |
Size: 247808 |
Author: liqiubin |
Hits:
Description: TSP问题关于蚁群最优化算法的MATLAB程序-Ant colony optimization about TSP algorithm of MATLAB
Platform: |
Size: 15360 |
Author: 江奇 |
Hits:
Description: 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
Platform: |
Size: 5120 |
Author: Horace |
Hits:
Description: 旅行商问题（Traveling Saleman Problem，TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本。采用回溯法，邻点法实现，有图形界面。-TSP (Traveling Saleman Problem, TSP) also translated as traveling salesman problem, traveling salesman problem, referred to as TSP, is the most basic routing problem, the problem is the starting point in the search for single travelers departing through all the given demand points, and finally back to the origin of the minimum path costs. Using backtracking, neighbor method to achieve, a graphical interface.
Platform: |
Size: 2897920 |
Author: invest |
Hits:
Description: 实践证明，遗传算法对于解决TSP问题等组合优化问题具有较好的寻优性能。-Practice has proved that a combination of genetic algorithms for solving optimization problems such as TSP problem has better optimization performance.
Platform: |
Size: 2048 |
Author: Monica |
Hits:
Description: 本文是以旅行商问题为研究点，利用蚂蚁算法优化求解最短路径，平台工具是具有绘图功能的matlab软件。(This paper takes traveling salesman problem as the research point, and uses ant algorithm to optimize the shortest path. The platform tool is matlab software with drawing function.)
Platform: |
Size: 12288 |
Author: lm521
|
Hits: