Description: Hopfield网络解决旅行商问题（TSP），迭代过程中采用保优方法，并计算最优解和次优解的个数。-Hopfield network Traveling Salesman Problem (TSP), iterative process used method for ensuring quality, and calculating the optimal solution and sub-optimal number of solutions. Platform: |
Size: 40960 |
Author:文文 |
Hits:
Description: matlab求解tsplib，该算法简单有效，能够解决tsplib的通用问题，通过计算机仿真，得到结果与实际符合度较高-Matlab tsplib solution, the algorithm is simple and effective, tsplib can solve the common problems through computer simulation, and the actual outcome with a higher degree Platform: |
Size: 17408 |
Author:吴伟锋 |
Hits:
Description: 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个-0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source Platform: |
Size: 1024 |
Author:wan |
Hits:
Description: 一个模拟退火算法的程序，使用matlab编写。实现了tsp问题的求解-a simulated annealing procedures, the use of Matlab prepared. Implementation of the solution tsp Platform: |
Size: 1024 |
Author:蒋赛 |
Hits:
Description: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value Platform: |
Size: 4096 |
Author:宏姬 |
Hits:
Description: TSP双种群蚁群算法。还包括了“30城市TSP问题数据与最优解.mat”，“75城市TSP问题数据.mat”，和“442TSP问题数据与算法对比.mat”-TSP-Stocks ant colony algorithm. Also include "30 cities TSP data and the optimal solution. Mat, " "75 cities TSP data. mat, " and "442TSP problem with the algorithm for data comparison. mat " Platform: |
Size: 12288 |
Author:ivan |
Hits:
Description: 任务均分的多旅行商问题的解决办法（很有价值）-Divided equally between the mission of the multi-traveling salesman problem solution (very valuable) Platform: |
Size: 169984 |
Author:pengchao |
Hits:
Description: 遗传算法解中国旅行商问题，里面有45个城市，用遗传算法算出近似最优解-Genetic Algorithm for Traveling Salesman Problem in China, there are 45 cities, using genetic algorithms calculate the approximate optimal solution Platform: |
Size: 520192 |
Author:lsk |
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: 使用遗传算法求解邮递员问题，从而可以同时求得多个最优解-The use of genetic algorithm postman problem, which can be obtained at the same time more than the optimal solution Platform: |
Size: 2048 |
Author:上将 |
Hits:
Description: 这是一个MATLAB写的一个解决TSP问题的蚁群算法程序。-This is a MATLAB to write a solution to the problem of ant colony algorithm TSP procedures. Platform: |
Size: 3072 |
Author:leijiang |
Hits:
Description: 利用模拟退火算法解决50个城市的tsp问题，简单易懂，适合初学者-The use of simulated annealing algorithm to solve 50 problems tsp city, easy-to-read, suitable for beginners Platform: |
Size: 3072 |
Author:dayong |
Hits:
Description: TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution.-TSP can be defined as a problem where starting from a node it is required to visit every other node only once in a way that the total distance covered is minimized. After an initial solution a neighborhood solution is selected by an exchange of a randomly selected pair of nodes. The randomly generated neighbor solution is selected if it improves the solution else it is selected with a probability that depends on the extent to which it deteriorates from the current solution. Platform: |
Size: 13312 |
Author:amilcar |
Hits:
Description: 基于蚁群算法用MATLAB求解76城市TSP问题，可得目前世界最优解，适合高手阅读使用-Using MATLAB based on ant algorithm for solving the problem of 76 cities TSP, the best solution available to the world for master read the Platform: |
Size: 11264 |
Author:刘兵 |
Hits:
Description: matlab 关于tsp解法的matlab程序，可以供大家参考下和学习下-About tsp solution matlab matlab program, can be used for your reference and learning under Platform: |
Size: 39936 |
Author:彭成新 |
Hits:
Description: 基于混合粒子群算法的tsp问题求解的MATLAB程序。(Solution of TSP problem based on Hybrid Particle Swarm Optimization) Platform: |
Size: 10240 |
Author:小红发 |
Hits:
Search - tsp solution matlab