求解集合联盟背包问题的二次贪心变异乌鸦算法

刘雪静; 贺毅朝; 吴聪聪

Chinese

您当前的位置：

首页 >

文章列表页 >

求解集合联盟背包问题的二次贪心变异乌鸦算法

更新时间：2026-09-04

- 求解集合联盟背包问题的二次贪心变异乌鸦算法
- Quadratic Greedy Mutated Crow Search Algorithm for Solving Set-Union Knapsack Problem
- 微电子学与计算机 2018年35卷第11期页码：13-19
- 作者机构：
  
  河北地质大学机构信息工程学院,河北,石家庄,050031
- 作者简介：
- 基金信息：
  
  河北省高等学校科学研究计划项目 ZD2016005河北省自然科学基金 F2016403055
- DOI：
  中图分类号：
- 纸质出版：2018
- 稿件说明：
移动端阅览
刘雪静, 贺毅朝, 吴聪聪. 求解集合联盟背包问题的二次贪心变异乌鸦算法[J]. 微电子学与计算机, 2018, 35(11): 13-19.

LIU Xue-jing, HE Yi-chao, WU Cong-cong. Quadratic Greedy Mutated Crow Search Algorithm for Solving Set-Union Knapsack Problem[J]. 2018, 35(11): 13-19.
刘雪静, 贺毅朝, 吴聪聪. 求解集合联盟背包问题的二次贪心变异乌鸦算法[J]. 微电子学与计算机, 2018, 35(11): 13-19. DOI：

LIU Xue-jing, HE Yi-chao, WU Cong-cong. Quadratic Greedy Mutated Crow Search Algorithm for Solving Set-Union Knapsack Problem[J]. 2018, 35(11): 13-19. DOI：

摘要

针对确定性算法难以求解的集合联盟背包问题(Set-Union Knapsack Problem

SUKP)

提出了二次贪心变异乌鸦算法(quadratic greedy mutated crow search algorithm

QGMCSA).首先结合SUKP问题模型对贪心策略进行改进

提出了处理其潜在解的二次贪心修复和优化策略; 其次

为了扩大乌鸦个体的搜索范围

对乌鸦算法进行变异操作

在跟踪过程中引入莱维飞行; 最后

利用三类SUKP实例验证本文算法.仿真结果表明:QGMCSA是比二进制人工蜂群算法求解SUKP的结果更优的一个高效算法.

Abstract

In order to solve the Set-Union Knapsack Problem (SUKP) which is difficult to be solved by the deterministic algorithm

the quadratic greedy mutated crow search algorithm (QGMCSA) is proposed. Firstly

the greedy strategy is inproved by combining the SUKP model

and the quadratic greedy repair and optimization strategy is proposed to deal with its potential solutions. Secondly

in order to enlarge the search scope of the individual

Lévy flight is introduced into the tracking process of crow search algorithm. Finally three kinds of SUKP instances are used to verify the algorithm. Simulation results show that QGMCSA is better than binary artificial bee colony algorithm for solving SUKP

it is a an effective algorithm.

关键词

Keywords

references

Berlin Michalewicz Z. Genetic algorithm+data structure=evolution programs[M]. Berlin, Springer-Verlag, 1996.

Schneier B. Applied cryptography (2nd ed): protocols, algorithms, and source code in C[J]. Government Information Quarterly, 1995, 13(3):336. DOI: 336

Oliva D, Hinojosa S, Cuevas E, et al. Cross entropy based thresholding for magnetic resonance brain images using Crow Search Algorithm[J]. Expert Systems with Applications, 2017(79) :164-180. DOI: 164

刘长平, 叶春明.一种新颖的仿生群智能优化算法:萤火虫算法[J].计算机应用研究, 2011, 28(9): 3295-3297. DOI: 3295

Askarzadeh A. A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm[J]. Computers % Structures, 2016(169):1-12. DOI: 1

Yang X S, Deb S. Cuckoo search via lévy flights[C]// Nature % Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on. Pietermaritzburg, South Africa, 2009: 210-214.

Arulselvan A. A note on the set union knapsack problem[J]. Discrete Applied Mathematics, 2014, 169(41):214-218. DOI: 214

Satpathy A, Addya S K, Turuk A K, et al. A resource aware VM placement strategy in cloud data centers based on crow search algorithm[C]// International Conference on Advanced Computing and Communication Systems., Los Angeles USA - 2017.

TU M, Xiao L. System resilience enhancement through modularization for large scale cyber systems[C]// IEEE/CIC International Conference on Communications. China, Qingdao, IEEE, 2016: 1-6.

Goldschmidt O, Nehme D, Yu G. Note: on the set-union knapsack problem[J]. Naval Research Logistics, 2015, 41(6):833-842. DOI: 833

刘雪静, 贺毅朝, 路凤佳, 等.基于差分策略的混沌乌鸦算法求解折扣{0-1}背包问题[J].计算机应用, 2018, 38(1):137-145. DOI: 137

Reynolds A M. Cooperative random Lévy flight searches and the flight patterns of honeybees [J]. Physics Letters A, 2006, 354(5):384-388. DOI: 384

He Y C, Xie H, Wong T L, et al. A novel binary artificial bee colony algorithm for the set-union knapsack problem[J]. Future Generation Computer Systems, 2017, 78(1): 77-86. DOI: 77

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于反向体偏置的高增益稳定性高温运放设计

AlN/GaN混合缓冲层双异质结p-GaN HEMT直流特性仿真

注意力机制与改进密集卷积引导的信息隐藏模型

基于多尺度融合与小目标增强的航拍车辆检测算法

超低功耗实时时钟电路的设计