An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems
Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binar...
Main Authors: | Yanhong Feng, Ke Jia, Yichao He |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Computational Intelligence and Neuroscience |
Online Access: | http://dx.doi.org/10.1155/2014/970456 |
Similar Items
-
An Effective Hybrid Cuckoo Search Algorithm with Improved Shuffled Frog Leaping Algorithm for 0-1 Knapsack Problems
by: Yanhong Feng, et al.
Published: (2014-01-01) -
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems
by: Yanhong Feng, et al.
Published: (2016-12-01) -
Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems
by: Yanhong Feng, et al.
Published: (2019-01-01) -
Improvement and Application of Adaptive Hybrid Cuckoo Search Algorithm
by: Zhiwen Cheng, et al.
Published: (2019-01-01) -
Quantum-Inspired Tabu Search Algorithm for Solving 0/1 Knapsack Problems
by: Chia-Hui Chiu, et al.
Published: (2011)