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

解决多维0/1背包问题的遗传算法综述
引用本文:李晓萌,戴光明,石红玉. 解决多维0/1背包问题的遗传算法综述[J]. 电脑开发与应用, 2006, 19(1): 4-5,8
作者姓名:李晓萌  戴光明  石红玉
作者单位:中国地质大学,武汉,430074;中国地质大学,武汉,430074;中国地质大学,武汉,430074
摘    要:多维背包问题是经典的NP hard问题。为了更有效地解决背包问题,针对多维背包问题介绍了三种比较新的混合遗传算法的思想,尤其是QGA和VEGA,QGA较注重于算法的并行性实现,VEGA则是利用病毒感染的生物机理,利用病毒个体和主个体之间的协同进化而实现局部搜索和全局搜索的结合。提出了值得改进的问题。

关 键 词:多维背包  遗传算法  QGA  VEGA
文章编号:1003-5850(2006)01-0004-03
收稿时间:2005-05-20
修稿时间:2005-05-202005-11-20

An Introduction to Mixed Genetic Algorithm for Solving Multi-dimension Package Problem
Li XiaoMeng;Dai GuangMing;Dan GongYu. An Introduction to Mixed Genetic Algorithm for Solving Multi-dimension Package Problem[J]. Computer Development & Applications, 2006, 19(1): 4-5,8
Authors:Li XiaoMeng  Dai GuangMing  Dan GongYu
Affiliation:Li Xiaomeng et al
Abstract:Multi-dimension package problem is a classic NP- hard problem. In order to solve the package problem effectively, this paper presents the ideas of three mixed new genetic algorithms,such as QGA and VEGA,and QGA lays stress on the implementation of algorithm parallelism and VEGA implements the combination of local search and whole search by using biology mechanism of virus infection and cooperation evolution between virus unit and host unit. The problems that need to be improved are presented.
Keywords:QGA  VEGA
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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