基于遗传算法的0/1背包问题的改进算法

Improved algorithm based on Genetic Algorithm for 0/1 knapsack problem

在分析现有遗传算法解决背包问题存在局限性的基础上,将原来的二进制编码改为十进制实数编码,通过算法模拟收敛了搜索范围,避免了局部搜索,并在实验中获得了对于问题的更优近似解。

Based on the analysis of limitation of the existing genetic algorithms to solve knapsack problem, through the optimization of code system and algorithm two optimization to change the original binary coded to decimal encoding instead, through the simulation algorithm to limit the convergence of search range, avoiding the local search, and obtained better approximate solution in the experiment.