Location:
Search - knapsack MULTI
Search list
Description: 遗传算法用于求解多目标背包问题，学包括基本的选择、杂交、变异等遗传算子.-Genetic algorithm for solving multi-objective knapsack problem, learning the basic choice, hybridization, mutation and other genetic operators.
Platform: |
Size: 44032 |
Author: daniel |
Hits:
Description: 采用了基本的蚁群算法来求解0-1背包问题，该算法不仅可以对0-1背包问题进行求解，还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimensional knapsack problem can be solved.
Platform: |
Size: 881664 |
Author: 小龙 |
Hits:
Description: 遗传算法
遗传算法简称GA(Genetic Algorithm)，在本质上是一种不依赖具体问题的直接搜索方法。遗传算法在模式识别、神经网络、图像处理、机器学习、工业优化控制、自适应控制、生物科学、社会科学等方面都得到应用。在人工智能研究中，现在人们认为“遗传算法、自适应系统、细胞自动机、混沌理论与人工智能一样，都是对今后十年的计算技术有重大影响的关键技术”。-Referred to as genetic algorithm genetic algorithm GA (Genetic Algorithm), in essence is a kind of do not rely on specific issues of direct search method. Genetic algorithm in pattern recognition, neural networks, image processing, machine learning, optimization of industrial control, adaptive control, biological sciences, social sciences and so on have been applied. Research in artificial intelligence, now that the " genetic algorithms, adaptive systems, cellular automata, chaos theory and artificial intelligence, are the next ten years of the computing technology have a major impact on the key technology."
Platform: |
Size: 303104 |
Author: sunguili |
Hits:
Description: 多目标背包问题的源码 希望对大家有用 很经典的 从Ziztler哪里得到的-Multi-objective knapsack problems code
Platform: |
Size: 62464 |
Author: brue yang |
Hits:
Description: 采用了基本的蚁群算法来求解0-1背包问题，该算法不仅可以对0-1背包问题进行求解，还可以对多维背包问题进行求解。-Using the basic ant colony algorithm to solve the 0-1 knapsack problem, the algorithm not only for the 0-1 knapsack problem can be solved, but also multi-dimensional knapsack problem can be solved.
Platform: |
Size: 7909376 |
Author: wangchangbin |
Hits:
Description: 混合蛙跳算法解决多背包问题，此算法是在vs2005下编写，语法为基本的c语言（可以直接复制源码到vc中运行）-Mixed leapfrog algorithm to solve multi-knapsack problem, this algorithm is prepared in vs2005, the syntax for basic c language (can copy the source code to run vc)
Platform: |
Size: 11092992 |
Author: yangfei |
Hits:
Description: Genetic Algorithm for multi objective knapsack problem
Platform: |
Size: 2048 |
Author: kalli |
Hits:
Description:
Platform: |
Size: 8192 |
Author: yangjie |
Hits:
Description: 有关背包方面的问题，包括普通背包，复杂背包，多重背包，背包的泛化物品-For knapsack problems, including ordinary backpack, backpack complex, multi-pack, backpack generalization items
Platform: |
Size: 19456 |
Author: lijianglei |
Hits:
Description: 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic programming (multi-segment Figure 0-1 backpack, resource allocation), backtracking and branch and bound method (sub-set several issues)
Platform: |
Size: 3476480 |
Author: 钟英 |
Hits:
Description: 基于多目标的PSO用于解决背包问题的程序，运行上比较花时间，请耐心等待。-Procedures used to solve the knapsack problem based on multi-objective PSO run more to spend time, please be patient.
Platform: |
Size: 3072 |
Author: 王力波 |
Hits:
Description: 多重背包的单调队列解法，经过测试完美运行！-Multiple backpack monotonous queue solution has been tested and works perfect!
Platform: |
Size: 1024 |
Author: Lyon |
Hits:
Description: 基于粒子群算法的多目标搜索算法，主要解决背包问题，直接运行即可
-Multi-objective particle swarm optimization-based search algorithm, mainly to solve the knapsack problem, can be run directly
Platform: |
Size: 1024 |
Author: 李梓晨 |
Hits:
Description: 采用基于粒子群的多目标优化算法解决背包问题。-Using multi-objective particle swarm optimization algorithm to solve knapsack problem.
Platform: |
Size: 5120 |
Author: 龙龙 |
Hits:
Description: 通过遗传算法计算多背包问题-Computing multi knapsack problem by genetic algorithm
Platform: |
Size: 40960 |
Author: leekahei |
Hits:
Description: MULTI OBJECTIVE KNAPSACK PROBLEMS IS BUILT IN VISUAL C-MULTI OBJECTIVE KNAPSACK PROBLEMS IS BUILT IN VISUAL CPP
Platform: |
Size: 136192 |
Author: abdirahim |
Hits:
Description: 1）编程递归实现0-1背包问题并回溯求出问题的解向量（即X[N]的值）和多段图的最短路经问题的动态规划算法。
2）图的数据结构采用邻接表。
3） 要求用文件装入5个多段图数据，编写从文件到邻接表的函数。
4）验证算法的时间复杂性。
5）0-1背包问题的实验数据见实验二的背包问题数据。
-1) programming recursive implementation of the 0-1 knapsack problem and backtracking to solve the problem of the solution vector (i.e. X[N] value) and the shortest path problem of multi segment graph by the dynamic programming algorithm.
2) the data structure of the graph uses the adjacency list.
3) the requirement to load the file into 5 multi- section data, write the function the file to the adjacency list.
4) the time complexity of the algorithm is verified.
5) the experimental data of the 0-1 knapsack problem is found in the experimental data of two knapsack problem.
Platform: |
Size: 12288 |
Author: 陈倩 |
Hits:
Description: 遗传算法用于求解多目标背包问题，学包括基本的选择、杂交、变异等遗传算子.-Genetic algorithm for solving multi-objective knapsack problem, learning the basic choice, hybridization, mutation and other genetic operators.
Platform: |
Size: 14336 |
Author: 常小小 |
Hits:
Description: 背包问题即给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。-A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed.
Platform: |
Size: 1024 |
Author: 刘芳 |
Hits:
Description: 遗传算法在旅行商问题下的一种应用代码，一种能够解决多维背包问题的应用代码。-Genetic algorithm in the traveling salesman problem of a kind of application code, one can solve the multi-dimensional knapsack problem application code.
Platform: |
Size: 6144 |
Author: 徐练淞 |
Hits: