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
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
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