安徽农业科学2011，Vol.39Issue(32)：19667-19670,4.
一种多维背包问题的n进制编码遗传求解算法
A Genetic Algorithm with Arbitrary Encoding for Multi-Dimensional Knapsack Problems
摘要
Abstract
According to the problems ( high diversity and premature convergence) of traditional binary code genetic algorithm when it was used to solve multi-dimensional knapsack optimization problems,a genetic algorithm with arbitrary encoding for multi-dimensional knapsack problems was proposed. The algorithm initializes population with arbitrary encoding,evolves population with mutation operator and crossover operator,and corrects infeasible solution with modified operator in order to make the solution satisfy the constrained condition,and then optimizes the optimization front end with pareto optimal set updating algorithm in order to enlarge its coverage and guarantee its homogeneity. The results of 20 times of random experiments showed that the algorithm could effectively overcome premature convergence and keep the population diversity and solving precision,which indicated that the algorithm had the ability of solving multi-dimensional knapsack problems.关键词
多维背包问题/n进制编码/遗传算法Key words
Multi-dimensional knapsack problems/Multi-band encoding/Genetic algorithm分类
农业科技引用本文复制引用
拓守恒..一种多维背包问题的n进制编码遗传求解算法[J].安徽农业科学,2011,39(32):19667-19670,4.基金项目
国家自·然科学基金(81160183) （81160183）
陕西省教育厅科研基金(2010JK466,2010JK459) （2010JK466,2010JK459）
宁夏自然科学基金项目(NZ11105). （NZ11105）
