基于粒计算理论的背包问题研究

Research on Knapsack Problem Based on the Theory of Granular Computing

本文阐述了遗传算法是解决背包问题的有效方法,指出将粒计算理论引入背包问题求解的可行性,研究了基于粒矩阵知识约简遗传算法求解背包问题,为背包问题的求解提供了新的思路,本文通过一个四背包问题进行举例说明。

This paper expounds that genetic algorithm is an effective method to solve the knapsack problem, points out the feasibility of introducing the grain computing theory into the knapsack problem solving, and studies the solution of knapsack problem based on the kernel matrix knowledge reduction genetic algorithm, and provides a new idea for the solution of the knapsack problem. This paper is carried out through a four knapsack problem. Examples are given.