Location:
Search - np-hard
Search list
Description: 英文资料。利用蚁群算法正反馈、并行计算的优点，将蚁群算法用于求解典型的NP-hard问题—旅行商问题。-English. Ant algorithm is the use of feedback, the advantages of parallel computing, Ant algorithm will be used to solve the typical NP-hard problem-Traveling Salesman Problem.
Platform: |
Size: 300106 |
Author: safin |
Hits:
Description: 八数码难题至今仍然是难以真正解决的NP-hard,这里仅提供了一种实现，当然里面难免存在bug.
Platform: |
Size: 76510 |
Author: 程斌 |
Hits:
Description: 0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right-tree solutions to the sector is a better way to the remaining units according to the
Platform: |
Size: 17790 |
Author: 汪柏然 |
Hits:
Description: 英文资料。利用蚁群算法正反馈、并行计算的优点，将蚁群算法用于求解典型的NP-hard问题—旅行商问题。-English. Ant algorithm is the use of feedback, the advantages of parallel computing, Ant algorithm will be used to solve the typical NP-hard problem-Traveling Salesman Problem.
Platform: |
Size: 300032 |
Author: safin |
Hits:
Description: 八数码难题至今仍然是难以真正解决的NP-hard,这里仅提供了一种实现，当然里面难免存在bug.-Eight digital problem is still difficult to really solve the NP-hard, here only provides a realize, of course, there will inevitably exist bug.
Platform: |
Size: 75776 |
Author: 程斌 |
Hits:
Description: 蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。最大团问题是一个经典的NP难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。 -Ant colony optimization algorithm is a metaheuristic based on natural-inspired algorithms, from their proposed up to now after 10 years of development to the present has become a kind of combinatorial optimization problems to solve an effective tool. Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.
Platform: |
Size: 236544 |
Author: wangliang |
Hits:
Description: TSP( Traveling Salesman Problem) is a typical NP complete problem ,genetic algorithm is the perfect method for solving NP complete problem. -TSP (Traveling Salesman Problem) is a typical NP complete problem, genetic algorithm is the perfect method for solving NP complete problem.
Platform: |
Size: 530432 |
Author: maolei |
Hits:
Description: 启发式遗传算法在电子商务下物流配送中心选址中的研究.
电子商务环境下的物流配送中心选址问题比较复杂，涉及因素较多。根据物流配送特点，对配送中心选址模型的变动
费用和时间约束作修改，建立更加合理的适用于电子商务环境下的物流配送中心选址模型。由于选址模型属于NP难问题，故采用启
发式遗传算法进行求解。
[关键词] 电子商务 启发式遗传算法 物流配送中心-Heuristic Genetic Algorithm in e-commerce logistics distribution center location under research. E-commerce environment of logistics distribution center location problem is rather complicated, involving many factors. According to the characteristics of logistics and distribution, distribution center location model for changes in cost and time constraints to make changes to the establishment of a more reasonable environment for e-commerce logistics distribution center location model. Because of the location model are NP hard problem, so the use of heuristic genetic algorithm. [Key words] Heuristic Genetic Algorithm e-commerce logistics distribution center
Platform: |
Size: 372736 |
Author: 唐五 |
Hits:
Description: NP-hard问题分析
NP-hard问题分析
-NP-hard problem of analysis of NP-hard problem analysis
Platform: |
Size: 316416 |
Author: 小鱼儿 |
Hits:
Description: The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: Given an assignment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results-The combinatorial core of the OVSF code assignment problemthat arises in UMTS is to assign some nodes of a complete binarytree of height h (the code tree) to n simultaneous connections, such thatno two assigned nodes (codes) are on the same root-to- leaf path. Eachconnection requires a code on a specified level. The code can change overtime as long as it is still on the same level. We consider the one-step codeassignment problem: Given an assignment, move the minimum number ofcodes to serve a new request. Minn and Siu proposed the so-called DCAalgorithmto solve the problem optimally. We show that DCA does notalways return an optimal solution, and that the problem is NP-hard.We give an exact nO (h)-time algorithm, and a polynomial time greedyalgorithm that achieves approximation ratio Θ (h). Finally, we considerthe online code assignment problem for which we derive several results
Platform: |
Size: 157696 |
Author: shilei |
Hits:
Description: 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TSP problem) is a vendor from the n cities in a city of departure, not repeated through the remaining n-1 cities and back to to the original starting point, in all possible path to derive a shortest path length. The software design is the use of simulated annealing algorithm to solve TSP problems, the adoption of the software design, on the simulated annealing algorithm and the traveling salesman problem to have a preliminary understanding.
Platform: |
Size: 1024 |
Author: 周薇 |
Hits:
Description: 遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm is based on Darwin' s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combination optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.
Platform: |
Size: 9216 |
Author: wangtao |
Hits:
Description: 参考文章
遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic Algorithm article reference Darwin' s theory of evolution is based on an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely applied in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.
Platform: |
Size: 99328 |
Author: wangtao |
Hits:
Description: 程序源代码
遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Genetic algorithm source code is based on Darwin' s theory of evolution of an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.
Platform: |
Size: 53248 |
Author: wangtao |
Hits:
Description: 修正后版本
遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法，适用于解决传统方法难以解决的复杂的、非线性问题，可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题，具有重要的理论研究价值和实际应用背景。然而，传统遗传算法中存在有不足，需要提出新的改进的遗传算法，并应用于旅行商问题的求解。-Amended version of genetic algorithm based on Darwin' s theory of evolution is an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.
Platform: |
Size: 9216 |
Author: wangtao |
Hits:
Description: 使用进化计算算法解决TSP（Travelling Sales man Problem）问题的算法实现。程序显示了进化计算在解决NP-Hard的传统难题上的优势。-The use of evolutionary computation algorithm to solve TSP (Travelling Sales man Problem) algorithm problem.
Platform: |
Size: 2048 |
Author: joe |
Hits:
Description: 十一个不同的算法解决一个NP-Hard问题。
包括遗传算法GA, 爬山算法HC。
名称：K背包问题-10 Pop,Single Ally-Gene Mutation EA
10 Pop,2 Ally-Gene Mutation EA
10 Pop,10 Ally-Gene Mutation EA
10 Pop,20 Ally-Gene Mutation
10 Pop,100 Ally-Gene Mutation
100 Pop,Single Ally-Gene Mutation EA
100 Pop,2 Ally-Gene Mutation EA
100 Pop,10 Ally-Gene Mutation EA
100 Pop,20 Ally-Gene Mutation
100 Pop,100 Ally-Gene Mutation
10 Pop, Single Ally-Gene Hill-Climbing
100 Pop, Single Ally-Gene Hill-Climbing
Platform: |
Size: 35840 |
Author: mark |
Hits:
Description: 基于粒子群优化算法（PSO）的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Based on Particle Swarm Optimization (PSO) of the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
Platform: |
Size: 2048 |
Author: 孙岩 |
Hits:
Description: 算法当中的NP问题的详细讲解以及各种实例算法讲解-Among the NP algorithm is explained in detail the problem as well as various examples of algorithms to explain
Platform: |
Size: 283648 |
Author: sunbo |
Hits:
Description: 基于模拟退火的粒子群算法，基于自然选择的粒子群算法，基于杂交的粒子群算法-Based on simulated annealing particle swarm algorithm, based on natural selection, particle swarm optimization, particle swarm optimization based on hybrid
Platform: |
Size: 4096 |
Author: Scott |
Hits: