论文部分内容阅读
探讨利用遗传算法解决背包问题并设计新型的遗传算法 .给出了背包问题的数学模型 ,建立了有效的约束条件 .在引入一种新的具有自适应性的杂交概率和变异概率的基础上 ,提出了面向背包问题的遗传算法和一种构造染色体的新方法 .提供了遗传算法的结构并讨论了遗传算子 .给出了一个例子说明算法的收敛性和收敛效率 .仿真说明了算法的有效性
This paper discusses the use of genetic algorithm to solve knapsack problem and designs a new type of genetic algorithm.A mathematical model of knapsack problem is presented and an effective constraint condition is established.On the basis of introducing a new adaptive probabilistic and mutation probability, A genetic algorithm for knapsack problem and a new method for constructing chromosomes are proposed.The structure of genetic algorithm is provided and genetic operators are discussed.An example is given to illustrate the convergence and convergence efficiency of the algorithm.The simulation shows that the algorithm is effective Sex