计算机应用研究2016，Vol.33Issue(10)：2941-2945,5.DOI:10.3969/j.issn.1001-3695.2016.10.015
求解高维动态0-1背包问题的修补二进制差分进化算法
Solving high-dimensional dynamic 0-1 knapsack problem using binary differential evolution algorithm with repair strategy
摘要
Abstract
The existing dynamic optimization algorithm is difficult to achieve high quality feasible solutions on high-dimension-al dynamic knapsack problem (DKP),and shows a slower tracking environmental speed.This paper proposed a binary differen-tial evolution algorithm with repair strategy (BDE/R)for solving DKP.In BDE/R,it applied a random compressibility muta-tion strategy directly to carry out individual’s mutation in discrete space according to the difference between two individuals.It developed greedy repair strategy to improve the feasible solution’s quality obtained and the convergence speed of the BDE/R. It used dual transformation to improve population diversity,and accelerated the ability of tracking environmental optimum.To validate the tracking performance of the BDE/R,which was applied to solve four high-dimensional DKPs.Experimental results show that BDE/R can achieve a superior average accuracy(Av-Acc)and adaptability(Av-Ada)when compared with five peer optimization algorithms.Furthermore,BDE/R displays a fast tracking environmental speed in terms of the average fitness track-ing curves.关键词
高维动态0-1 背包问题/二进制/差分进化算法/修补策略/跟踪性能Key words
high-dimensional dynamic 0-1 knapsack problem/binary/differential evolution algorithm/repair strategy/tracking performance分类
信息技术与安全科学引用本文复制引用
武慧虹,钱淑渠,徐国峰..求解高维动态0-1背包问题的修补二进制差分进化算法[J].计算机应用研究,2016,33(10):2941-2945,5.基金项目
国家自然科学基金资助项目（61304146）；贵州省教育厅优秀科技创新人才奖励计划项目（黔教合KY字［2014］255）；贵州省科技计划基金资助项目（20152002）；江苏省创新基金江苏省研究生创新基金资助项目 （）
