带惯性权重的Jaya算法求解0-1背包问题  

Jaya Algorithm with Inertia Weight to Solve 0-1 Knapsack Problem

作　　者：张小萍[1] ZHANG Xiaoping(College of Computer and Electronic Information,Guangxi University,Nanning 530004,China)

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《太原师范学院学报（自然科学版）》2022年第1期73-76,共4页Journal of Taiyuan Normal University:Natural Science Edition

摘　　要：为了更有效地求解0-1背包问题,在基本Jaya算法特点的基础上,提出一种带惯性权重的Jaya算法.算法在二进制编码后采用贪心策略对不可行解修复同时优化可行解,并引入线性递减的惯性权重来平衡迭代过程中全局搜索和局部搜索的关系,在算法迭代初期增强全局搜索的能力,在迭代后期提高搜索的精度.仿真实验表明,提出算法与其他三种算法相比在求解0-1背包问题上具有更好的寻优效果.In order to solve the 0-1 knapsack problem more effectively,a Jaya algorithm with inertia weight is proposed based on the characteristics of the basic Jaya algorithm.After binary coding,the algorithm adopts greedy strategy to repair the infeasible solution and optimize the feasible solution,and introduces the linearly decreasing inertia weight to balance the relationship between global search and local search in the iterative process,so as to enhance the ability of global search in the early stage of algorithm iteration and improve the accuracy of search in the later stage of iteration.Simulation results show that the proposed algorithm has better optimization effect than the other three algorithms in solving 0-1 knapsack problem.

关 键 词：Jaya算法 0-1背包问题 惯性权重 贪心策略 

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