首页 | 本学科首页   官方微博 | 高级检索  
     

具有多父代重组的遗传算法解0-1背包问题
引用本文:刘志华,周绍梅. 具有多父代重组的遗传算法解0-1背包问题[J]. 江西科学, 2007, 25(2): 183-186
作者姓名:刘志华  周绍梅
作者单位:南昌大学计算中心,江西,南昌,330031;南昌大学计算中心,江西,南昌,330031
摘    要:
遗传算法的创始人最初是从自然界获取灵感的,但是后来的遗传算法的研究者也试图将生物界不存在的特征引入遗传算法,多父代重组(或称为N父代重组,N>2)就是其中的一种。有文献显示这种机制在解很多不同的问题时都能有较好的效果。本文用几种多父代重组方法(包括一种新的面向特定问题的方法)解0-1背包问题,结果显示多父代重组确实有较好的性能。

关 键 词:遗传算法  多父代重组  N父代重组  0-1背包问题
文章编号:1001-3679(2007)02-0183-04
修稿时间:2007-01-192007-02-10

Solutions to 0-1 Knapsack Problem Using Multi-parent Genentic Algorithms
LIU Zhi-hua,ZHOU Shao-mei. Solutions to 0-1 Knapsack Problem Using Multi-parent Genentic Algorithms[J]. Jiangxi Science, 2007, 25(2): 183-186
Authors:LIU Zhi-hua  ZHOU Shao-mei
Affiliation:Computer Center, Nanchang University, Jiangxi Nanehang 330031 PRC
Abstract:
Looking at nature's solutions is a suorce of inspiration to the genetic algorithms'originator.But trying non-existing biological features has been done by several GAs'practitionors.As a case,they took multi-parent recombination(or N-parent recombination,N>2).Their work had shown the beneficial effects under many different circumstances.Several multi-parent recombination mechanisms,including a new problem-specific method,are experimented under solving 0-1 knapsack problem in this paper.The results prove that such mechanism can reach good performance.
Keywords:Genetic algorithms  Multi-parent recombination  N-parent recombination  0-1 knapsack problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号