A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems
Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0–1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2016-12-01
|
| Series: | International Journal of Computational Intelligence Systems |
| Subjects: | |
| Online Access: | https://www.atlantis-press.com/article/25868755/view |
| _version_ | 1818233654183198720 |
|---|---|
| author | Yanhong Feng Gai-Ge Wang Xiao-Zhi Gao |
| author_facet | Yanhong Feng Gai-Ge Wang Xiao-Zhi Gao |
| author_sort | Yanhong Feng |
| collection | DOAJ |
| description | Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0–1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a novel hybrid meta-heuristic optimization approach, called cuckoo search Algorithm with global harmony search (CSGHS), is proposed in this paper to solve 0–1 knapsack problems (KP) more effectively. In CSGHS, it is the combination of the exploration of GHS and the exploitation of CS that makes the CSGHS efficient and effective. The experiments conducted demonstrate that the CSGHS generally outperformed the binary cuckoo search, the binary shuffled frog-leaping algorithm and the binary differential evolution in accordance with the search accuracy and convergence speed. Therefore, the proposed hybrid algorithm is effective to solve 0–1 knapsack problems. |
| first_indexed | 2024-12-12T11:25:37Z |
| format | Article |
| id | doaj.art-bac9c0434847427d86f0a0e3ba01e796 |
| institution | Directory Open Access Journal |
| issn | 1875-6883 |
| language | English |
| last_indexed | 2024-12-12T11:25:37Z |
| publishDate | 2016-12-01 |
| publisher | Springer |
| record_format | Article |
| series | International Journal of Computational Intelligence Systems |
| spelling | doaj.art-bac9c0434847427d86f0a0e3ba01e7962022-12-22T00:25:55ZengSpringerInternational Journal of Computational Intelligence Systems1875-68832016-12-019610.1080/18756891.2016.1256577A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack ProblemsYanhong FengGai-Ge WangXiao-Zhi GaoCuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0–1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a novel hybrid meta-heuristic optimization approach, called cuckoo search Algorithm with global harmony search (CSGHS), is proposed in this paper to solve 0–1 knapsack problems (KP) more effectively. In CSGHS, it is the combination of the exploration of GHS and the exploitation of CS that makes the CSGHS efficient and effective. The experiments conducted demonstrate that the CSGHS generally outperformed the binary cuckoo search, the binary shuffled frog-leaping algorithm and the binary differential evolution in accordance with the search accuracy and convergence speed. Therefore, the proposed hybrid algorithm is effective to solve 0–1 knapsack problems.https://www.atlantis-press.com/article/25868755/viewCuckoo searchGlobal Harmony Search0–1 knapsack problemsHybrid Encoding |
| spellingShingle | Yanhong Feng Gai-Ge Wang Xiao-Zhi Gao A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems International Journal of Computational Intelligence Systems Cuckoo search Global Harmony Search 0–1 knapsack problems Hybrid Encoding |
| title | A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems |
| title_full | A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems |
| title_fullStr | A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems |
| title_full_unstemmed | A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems |
| title_short | A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems |
| title_sort | novel hybrid cuckoo search algorithm with global harmony search for 0 1 knapsack problems |
| topic | Cuckoo search Global Harmony Search 0–1 knapsack problems Hybrid Encoding |
| url | https://www.atlantis-press.com/article/25868755/view |
| work_keys_str_mv | AT yanhongfeng anovelhybridcuckoosearchalgorithmwithglobalharmonysearchfor01knapsackproblems AT gaigewang anovelhybridcuckoosearchalgorithmwithglobalharmonysearchfor01knapsackproblems AT xiaozhigao anovelhybridcuckoosearchalgorithmwithglobalharmonysearchfor01knapsackproblems AT yanhongfeng novelhybridcuckoosearchalgorithmwithglobalharmonysearchfor01knapsackproblems AT gaigewang novelhybridcuckoosearchalgorithmwithglobalharmonysearchfor01knapsackproblems AT xiaozhigao novelhybridcuckoosearchalgorithmwithglobalharmonysearchfor01knapsackproblems |