求解0-1背包问题的共同进化遗传算法

摘要：

The efficacy and efficiency of conventional single-population-based genetic algorithm(SGA)decrease with the size of 0-1 Knapsack-Problem. A coevolutionary genetic algorithm (CGA)for 0-1 Knapsack-Problem is proposed in this paper ,which includes the representation of solution,construction of feasible solution,converting illegal solution into feasible one,and fitness computing,etc. The simulation results show that the optimal/sub-optimal and convergence of CGA are better than that of SGA,and the algorithm is of practical use in engineering.

关键词：0-1 Knapsack-problem、Genetic algorithms、Coevolutionary computation

所属期刊栏目：28

分类号：TP3(计算技术、计算机技术)

资助基金：国家自然科学基金69903010,60003002

在线出版日期：2004-01-08（万方平台首次上网日期，不代表论文的发表时间）

页数：共4页

页码：102-105