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

• 作者: 刘娜 钟求喜
• 来源期刊: 计算机科学
• 学科: 工学
• 关键词: 0-1 Knapsack-problem,Genetic algorithms,Coevolutionary computation
• 年，卷（期）: 2001,（9）
• 页码范围: 102-105
• 页数: 4页
• 分类号: TP3
• 字数: 4408字
• 语种: 中文
• DOI: 10.3969/j.issn.1002-137X.2001.09.027

摘要

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.

作者信息

序号	姓名	单位	发文数	被引次数	H指数	G指数
1	钟求喜	国防科技大学计算机学院	15	162	8.0	12.0
2	刘娜	国防科技大学计算机学院	2	13	2.0	2.0