用蚁群算法解决0-1背包问题。
让我们开始仔细讲讲一个问题，那就是背包问题。
So we'll start looking in detail at one problem, and that's the knapsack problem. Let's see.
这是关于01背包问题的动态规划算法。
This is about 01 knapsack problem dynamic programming algorithm.
试用递归方法设计求解背包问题的算法。
Trial designed recursive algorithm for solving knapsack problem.
粒子群优化算法；背包问题；遗传概率；
Particle Swarm Optimism; Knapsack Problem; genetic probability;
提出了0-1多项式背包问题的一种新的精确算法。
This paper proposes a rigorous algorithm for solving the 0-1 polynomial knapsack problem.
提出了一种蚁群系统与多选择背包问题融合的算法。
A hybrid algorithm combining ant colony system with multi-choice Knapsack problem was proposed.
在求解背包问题时，采用修复函数来修正不可行编码。
When solving the knapsack question, repair function was used to repair unfeasible code.
从理论上讲，仓储空间布局问题可以理解为背包问题。
In theory, the layout problem of storage space can be interpreted as a knapsack problem.
另外还讨论了拼板问题、背包问题和下料问题的关系。
The relations among the board welding problem, knapsack problem and cutting stock problem are also discussed.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
给出了用这三种算法解决多选择背包问题的基本原理及求解步骤。
The basic principle and step of these three algorithms are given to solve Multiple-choice Knapsack Problem.
因此，应用该混合智能算法求解0 - 1背包问题是比较有效的。
Therefore, the hybrid intelligence algorithm is effective to solve 0-1 knapsack problems.
针对经典的背包问题，给出一种新的基于蚂蚁优化思想的求解算法。
Based on the ant colony optimization idea, this paper presents a new algorithm for the classical knapsack problem.
通过求解背包问题对算法进行验证，实验结果表明所提算法性能较优。
This algorithm is verified by solving knapsack problem, the results of the experiment show that the proposed algorithm can result in better profits.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
但是别担心，我讲这些是因为它比我，真正想讲的问题简单一些，我想讲的是背包问题。
But don't worry about it, it's not, I'm just using it because it's a simpler example than the one I really want to get to, which is knapsack.
实验证明采用这种改进的粒子群算法解决多约束背包问题切实可行， 搜索效率较高。
The result of this experiment shows that this particle swarm algorithm is available and efficient in solving multi-c…
该文提出了一类新的易解背包问题，基于此问题构造了一个新的加法背包型公钥密码体制。
This article proposes a new easy knapsack problem, based on which a novel knapsack-type public key cryptosystem is derived.
但是让我们找一找它的一些变种，在这些变种中贪婪算法用处不大,这些问题也就是0/1背包问题。
But let's look for a slight variant of it, where greedy is not so good. And that's what's called the zero-one knapsack problem.
本文提出了改进的粒子群算法求解背包问题，阐明了该算法求解背包问题的具体实现过程。
In this paper, a modified particle swarm optimization algorithm is presented to solve knapsack problem, and the detailed realization of the algorithm is illustrated.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
让我们回来用具体例子，来说明我们上次看过的背包问题，特别是对0 - 1背包问题来说。
Let's now go back and instantiate these ideas for the knapsack problem we looked at last time in particular, for the 0-1 knapsack problem.
把对最大割问题进行秩二松驰的思想应用到二次背包问题上，得到二次背包问题的秩二松驰模型。
The idea of rank two relaxation for max-cut problem is used to quadratic knapsack problem, and the model of the rank two relaxation for quadratic knapsack problem is obtained.
然后从计算方法上，将该贷款组合优化问题归结为一类有上下限的非连续、多峰的特殊背包问题。
Then, analyzed from calculation methods, this model is a type of Knapsack Problem with restrictions between lower-limit and upper-limit, which is a discontinuous and multi-maximum complicated problem.
并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。
And the combination of an instance of the knapsack problem, given specific encoding method, operating parameters, population size, maximum number of iterations, and appropriate genetic operators.
求解0 - 1背包问题的精确算法不能在较短时间内求解大规模0 - 1背包问题，使其实用性受到限制。
The precise and approximate algorithms solving 0-1 knapsack problem, precise algorithm could not be used to solve 0-1 knapsack problem in a short time, so it could not be applied extensively.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题，从而可用动态规划寻求最佳的出清向量；
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题，从而可用动态规划寻求最佳的出清向量；
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.
应用推荐