首页 | 官方网站   微博 | 高级检索  
     

一种求解0-1背包问题的改进遗传算法
引用本文:吕晓峰,张勇亮,马羚.一种求解0-1背包问题的改进遗传算法[J].计算机工程与应用,2011,47(34):44-46.
作者姓名:吕晓峰  张勇亮  马羚
作者单位:1. 海军航空工程学院兵器科学与技术系,山东烟台,264001
2. 海军航空工程学院研究生管理大队,山东烟台,264001
摘    要:针对传统遗传算法(SGA)容易"早熟"的不足,提出一种求解0-1背包问题(KP)的改进遗传算法。借鉴二重结构编码的解码处理方法设计了一种新解码方法,在保证解可行性的同时修正种群中无对应可行解的个体;采用模拟退火算法和改进的精英选择算子改进SGA。实例仿真结果验证了改进遗传算法在进化效率和最优解搜索能力上的优越性。

关 键 词:遗传算法  背包问题  解码  模拟退火  精英选择
修稿时间: 

Improved genetic algorithm to 0-1 knapsack problem
LV Xiaofeng,ZHANG Yongliang,MA Ling.Improved genetic algorithm to 0-1 knapsack problem[J].Computer Engineering and Applications,2011,47(34):44-46.
Authors:LV Xiaofeng  ZHANG Yongliang  MA Ling
Affiliation:LV Xiaofeng1,ZHANG Yongliang2,MA Ling21.Department of Armament Science and Technology,Naval Aeronautical and Astronautical University,Yantai,Shangdong 264001,China2.Brigade of Graduate Student,China
Abstract:An improved Genetic Algorithm(GA) is proposed to solve 0-1 Knapsack Problem(KP) considering the deficiency of the Simple GA(SGA) that being easy toprecocity.A new way to decode is designed to ensure solutions workable according to the way of dual-structure coding,and to revise individuals without corresponding solutions in the population at the same time.And SGA is improved by the Simulated Annealing(SA) algorithm and improved elite selection operator.The advantage of the improved GA in the evolution effici...
Keywords:Genetic Algorithm(GA)  Knapsack Problem(KP)  decode way  Simulated Annealing(SA)  elite selection  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号