核加速萤火虫算法求解有界背包问题  

Core Accelerated Firefly Algorithm for Solving Bounded Knapsack Problem

作　　者：任静敏 潘大志[1,2] REN Jing-min;PAN Da-zhi(College of Mathematics and Information,China West Normal University,Nanchong 637009,China;Institute of Computing Method and Application Software,China West Normal University,Nanchong 637009,China)

机构地区：[1]西华师范大学数学与信息学院,四川南充637009 [2]西华师范大学计算方法与应用研究所,四川南充637009

出　　处：《数学的实践与认识》2020年第11期172-182,共11页Mathematics in Practice and Theory

基　　金：国家自然科学基金(11871059);四川省教育厅自然科学基金(18ZA0469);西华师范大学英才科研基金项目(17YC385);2018级校级创新创业训练计划项目(CXCY2018200)。

摘　　要：针对有界背包问题,本文提出一种结合核算法的改进萤火虫算法.首先采用核算法对问题规模进行缩减,为了使算法更适于不同规模的有界背包问题,根据规模对核半径进行自适应控制,对缩减后的剩余物品利用基于Levy飞行的萤火虫算法进行位置更新,并对更新后的最优个体进行变异操作以此增加种群多样性.通过仿真实验表明新改进算法能有效求解有界背包问题.In order to solve the bounded knapsack problem,an improved firefly algorithm combined with core algorithm is proposed.First using the core algorithm to reduce the scale of the problem,in order to make the algorithm more suitable for different sizes of bounded knapsack problem,According to the size of the problem,the nuclear radius is adaptively controlled to obtain the remaining items,and the remaining items were updated with the firefly algorithm based on Levy flight,the updated optimal individuals were mutated to increase the diversity of the population.Simulation results show that the improved algorithm can effectively solve bounded knapsack problem.

关 键 词：萤火虫算法 有界背包问题 核算法 变异操作 Levy飞行 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]