Location:
Search - tsp recursive
Search list
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: 1368 |
Author: wan |
Hits:
Description: tsp递归程序实现(Java)-tsp recursive program (Java)
Platform: |
Size: 3621 |
Author: 阿宝 |
Hits:
Description: 因为递归程序运行的效率一般都比较低,本程序用java语言来实现TSP递归程序的优化-because recursive program run average efficiency are low, the procedure used java language to achieve TSP recursive process optimization
Platform: |
Size: 12275 |
Author: 我心飞扬 |
Hits:
Description: tsp递归程序实现(Java)-tsp recursive program (Java)
Platform: |
Size: 3072 |
Author: 阿宝 |
Hits:
Description: 因为递归程序运行的效率一般都比较低,本程序用java语言来实现TSP递归程序的优化-because recursive program run average efficiency are low, the procedure used java language to achieve TSP recursive process optimization
Platform: |
Size: 12288 |
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: 旅行商问题，两种方法实现，分别是递归回溯和用栈来代替递归的功能的程序-Traveling salesman problem, two methods to achieve, namely, retrospective and the use of recursive stack instead of recursive function procedures
Platform: |
Size: 175104 |
Author: 张云 |
Hits:
Description: Java语言TSP递归程序的优化，采用新型递归模式设计实现的。-Java language TSP optimization of recursive procedures, recursive model using the new design.
Platform: |
Size: 9216 |
Author: pengyang |
Hits:
Description: 利用以递归算法为基础演变而来的医学算法来解决tsp问题-Recursive algorithm used in medicine evolved based algorithm to solve the problem tsp
Platform: |
Size: 3072 |
Author: 张想 |
Hits:
Description: 用递归法解决最短周游路径问题的java实现-Travel by the shortest path of the recursive method to solve the problem of the java implementation
Platform: |
Size: 201728 |
Author: luoyu |
Hits:
Description: 人工智能实验，基于遗传算法TSP 八数码 解决传教士—野人问题的递归程序 等问题-Artificial intelligence experiments, based on genetic algorithm to solve TSP eight digital missionaries- Savage problem issues such as recursive program
Platform: |
Size: 10240 |
Author: liuxin |
Hits:
Description: TSP的递归算法，小软件形式。可以动态载入不同数量的城市数目。-TSP S Recursive algorithm,A small software.
Platform: |
Size: 7168 |
Author: 刘康 |
Hits:
Description: tsp递归程序实现 java ,不错的源码程序,可以下载学习-TSP recursive procedure to realize Java, good source programs, you can download the study
Platform: |
Size: 3072 |
Author: interrhpt |
Hits:
Description: tsp递归程序实现 java ,不错的源码程序,可以下载学习-TSP recursive procedure to realize Java, good source programs, you can download the study
Platform: |
Size: 3072 |
Author: handlisg |
Hits:
Description: tsp递归程序实现 java ,不错的源码程序,可以下载学习-TSP recursive procedure to realize Java, good source programs, you can download the study
Platform: |
Size: 3072 |
Author: CMQC!42572 |
Hits:
Description: 0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。(0-1 integer programming has a very wide application background, such as assignment problem, knapsack problem and so on. In fact, TSP problem is also a 0-1 problem. Of course, these problems are NP problems. For large-scale problems, exhaustive method is unable to find the optimal solution in an acceptable time. This program is only an exercise, and the proud point is that all solutions are arranged by recursive method. Come out.)
Platform: |
Size: 2048 |
Author: 末光 |
Hits: