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.
