【摘要】 探讨利用遗传算法解决背包问题并设计新型的遗传算法 .给出了背包问题的数学模型 ,建立了有效的约束条件 .在引入一种新的具有自适应性的杂交概率和变异概率的基础上 ,提出了面向背包问题的遗传算法和一种构造染色体的新方法 .提供了遗传算法的结构并讨论了遗传算子 .给出了一个例子说明算法的收敛性和收敛效率 .仿真说明了算法的有效性更多还原

【Abstract】 A genetic algorithm is given to solve the packsack. The mathematical model of the packsack problem is presented, and the effective restriction condition is established. On the basis of this new method with self adaptive commute and mutate probability, a new genetic algorithm for knapsack problem is developed. A method for constructing chromosome is presented. The structure of the genetic algorithms is provided, and its genetic algorithms′ operators are discussed. An example to illustrate the convergence property and the convergence efficiency of the algorithm is given. The simulation shows that this method is effective.更多还原