Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (30): 45-47.DOI: 10.3778/j.issn.1002-8331.2009.30.015

• 研究、探讨 • Previous Articles     Next Articles

New genetic algorithm to solve 0-1 knapsack problem

ZHOU Ben-da1,CHEN Ming-hua2,REN Zhe3   

  1. 1.Dept. of Mathematics & Physics,West Anhui University,Liu’an,Anhui 237012,China
    2.Dept. of Computer Science & Technology,West Anhui University,Liu’an,Anhui 237012,China
    3.Dept. of Mathematics and Physics,Hefei University,Hefei 230022,China
  • Received:2008-06-18 Revised:2008-09-03 Online:2009-10-21 Published:2009-10-21
  • Contact: ZHOU Ben-da

一种求解0-1背包问题的新遗传算法

周本达1,陈明华2,任 哲3   

  1. 1.皖西学院 数理系,安徽 六安 237012
    2.皖西学院 计算机科学与技术系,安徽 六安 237012
    3.合肥学院 数理系,合肥 230022
  • 通讯作者: 周本达

Abstract: It is well known that the GA is a guided random search and the guiding direction always aims at the family whose ancestors have schemata with high fitness.Based on the results,the crossover operation in GA is redesigned by using the principle of random uniform design sampling.Then a new GA called Genetic Algorithm based on Random Uniform Design Sampling is presented.The new GA is applied to solve the 0-1 knapsack question.Compared to simple GA and Good Point GA for solving this problem,the simulation results show that the new GA has superiority in speed,accuracy and overcoming premature.

Key words: Genetic Algorithm(GA), Random Uniform Design Sampling(RUDS), Genetic Algorithm Based on Random Uniform Design Sampling(RUDSGA)

摘要: 众所周知,遗传算法的运行机理及特点是具有定向制导的随机搜索技术,其定向制导的原则是: 导向以高适应度模式为祖先的“家族”方向。以此结论为基础,利用随机化均匀设计的理论和方法,对遗传算法中的交叉操作进行了重新设计,给出了一个新算法,称之为随机化均匀设计遗传算法。最后将随机化均匀设计遗传算法应用于求解0-1背包问题,并与简单遗传算法和佳点集遗传算法进行比较。通过模拟比较,可以看出新的算法不但提高了算法的速度和精度,而且避免了其他方法常有的早期收敛现象。

关键词: 遗传算法, 随机化均匀设计, 随机化均匀设计遗传算法

CLC Number: