【摘要】 介绍了一种最优保存遗传算法,针对该算法提出一种改进方案,一方面改变了保存最优个体的方法,另一方面对不满足约束条件的个体采用贪心策略进行改造,使其满足条件。最后通过一个具体的背包问题实例验证了改进算法的可行性和有效性。更多还原

【Abstract】 A genetic algorithm with best elitist preserved method is introduced. In allusion to this algorithm an improved project is proposed. On the one hand best elitist preserved method is changed,on the other hand those individuals ,which aren’t satisfied with restrict condition, are reconstructed with greedy strategy. The fea- sibility and validity of improved algorithm is proved through a knapsack problem instance.更多还原