一种基于耗散理论的遗传算法及其应用  

Genetic algorithm based on dissipative theory and It's application.

作　　者：于惠[1] 王洪国[1] 庄波[2] 郭彦伟[1] 徐卫志[1] 

机构地区：[1]山东师范大学信息科学与工程学院,济南250014 [2]滨州学院计算机科学技术系,山东滨州256603

出　　处：《计算机工程与应用》2008年第21期113-115,141,共4页Computer Engineering and Applications

基　　金：山东省自然科学基金(the Natural Science Foundation of Shandong Province of China under Grant No.Q2006G03)

摘　　要：在含有交叉和变异矩阵的自适应遗传算法的基础上,引入耗散结构理论,在交叉成功的个体数和变异概率之间建立联系,使交叉成功的个体影响变异概率,并且对非法个体进行贪婪处理。实验表明,该算法在解决0-1背包问题时获得较好的效果。In this paper,an adaptive genetic algorithm which includes crossover and mutation matrix is proposed.The dissipative structure theory is introduced,and the relationship between the number of the successfully crossovered individuals and the muta- tion probability is established,so the number of the successfully crossovered individuals can affect the mutation probability.A greedy algorithm is used to process the illegal individuals.According to the experiments,the algorithm gets better results when solving the 0-1 knapsack problem,

关 键 词：背包问题 耗散结构理论 海明距离 变异矩阵 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]