不满足约束条件的染色体被称为致死染色体。
The chromosome unsatisfied constrain condition is called lethal chromosome.
不满足约束条件的染色体被称为致死染色体。
The chromosome unsatisfied constraint condition is called lethal chromosome.
这里使用遗传算法来规划拆卸序列,产生满足约束条件的效率最好的顺序。
This paper use GA to deal such kind of problem, which can generate an optimal sequence under constraint of disassembly priority.
And now we want to find the subset of a that has the maximum value, subject to the weight constraint.
会有一个值与其对应,现在我们想要找出满足,重量约束条件的a的最大值子集。
So he's packing and unpacking, packing and unpacking, trying all possible combinations of objects that will obey the constraint. And then choosing the winner. Well, this is like an algorithm we've seen before. It's not greedy.
因此它不断装包和清包,尝试了所有满足约束条件的物品组合,最后选择最优者,这很像我们以前看过的一个算法,这不是贪婪算法。
应用推荐