Skip to main content
SpringerLink
Log in

Noising methods with hybrid greedy repair operator for 0–1 knapsack problem

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Noising methods (NMs) include a set of local search methods and can be considered as simulated annealing algorithm or threshold accepting (TA) method when its components are properly chosen. This paper studies how to utilize NMs for solving the 0–1 knapsack problem (0–1 KP). Two noising strategies, noising variation of objective function and noising data, are used to help NMs escape from local optima. When noising variation of objective function is used, probabilistic acceptance or deterministic acceptance is used to decide whether to accept neighbor solutions. Two decreasing strategies, arithmetical decreasing and geometrical decreasing, are used to control the change of parameter noise-rate. In total, six variants of NMs including two TAs are designed to solve the 0–1 KP. In those variants, a hybrid greedy repair operator, which combines density-based and value-based greedy drop and add operators, is designed to get better balance between intensification and diversification. Extensive experiments were performed to compare the performances of the six variants of NMs. The performances of the six variants of NMs were also compared with some state-of-the-art metaheuristics on a wide range of small size, medium size, and large size 0–1 KP instances. Simulation results show that NMs are better than or competitive with other state-of-the-art metaheuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Charon I, Hudry O (1993) The noising method: a new method for combinatorial optimization. Oper Res Lett 14(3):133–137

    Article  MathSciNet  MATH  Google Scholar 

  2. Charon I, Hudry O (2001) The noising methods: a generalization of some metaheuristics. Eur J Oper Res 135(1):86–101

    Article  MATH  Google Scholar 

  3. Charon I, Hudry O (2002) The noising methods: a survey. In: Hansen P, Ribeiro CC (eds) Essays and surveys in metaheuristics. Springer, Boston, pp 245–261

    Google Scholar 

  4. Abdel-Basset M, El-Shahat D, Sangaiah AK (2019) A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem. Int J Mach Learn Cybern 10(3):495–514

    Article  Google Scholar 

  5. Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0/1 knapsack problem. Appl Soft Comput 19:252–263

    Article  Google Scholar 

  6. Bhattacharjee KK, Sarmah SP (2017) Modified swarm intelligence based techniques for the knapsack problem. Appl Intell 46(1):158–179

    Article  Google Scholar 

  7. Nguyen PH, Wang D, Truong TK (2017) A novel binary social spider algorithm for 0–1 knapsack problem. Int J Innov Comput Inf Control 13(6):2039–2049

    Google Scholar 

  8. Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0–1 knapsack problem. Appl Soft Comput 38:817–830

    Article  Google Scholar 

  9. Gherboudj A, Layeb A, Chikhi S (2012) Solving 0–1 knapsack problems by a discrete binary version of cuckoo search algorithm. Int J Bio-Inspir Comput 4(4):229–236

    Article  Google Scholar 

  10. Kulkarni AJ, Shabir H (2016) Solving 0–1 knapsack problem using cohort intelligence algorithm. Int J Mach Learn Cybern 7(3):427–441

    Article  Google Scholar 

  11. Han M, Liu S (2017) An improved binary chicken swarm optimization algorithm for solving 0–1 knapsack problem. In: 2017 13th International conference on computational intelligence and security (CIS). IEEE, pp 207–210

  12. Cao J, Yin B, Lu X, Kang Y, Chen X (2018) A modified artificial bee colony approach for the 0–1 knapsack problem. Appl Intell 48:1582–1595

    Article  Google Scholar 

  13. Wu H, Zhang F, Zhan R, Wang S, Zhang C (2014) A binary wolf pack algorithm for solving 0–1 knapsack problem. Syst Eng Electron 36(8):1660–1667

    MATH  Google Scholar 

  14. Gao Y, Zhang F, Zhao Y, Li C (2018) Quantum-inspired wolf pack algorithm to solve the 0–1 knapsack problem. Math Probl Eng 2018:5327056

    MathSciNet  MATH  Google Scholar 

  15. Rizk-Allah RM, Hassanien AE (2018) New binary bat algorithm for solving 0–1 knapsack problem. Complex Intell Syst 4(1):31–53

    Article  Google Scholar 

  16. Wu H, Zhou Y, Luo Q (2018) Hybrid symbiotic organisms search algorithm for solving 0–1 knapsack problem. Int J Bio-Inspir Comput 12(1):23–53

    Article  Google Scholar 

  17. Feng Y, Jia K, He Y (2014) An improved hybrid encoding cuckoo search algorithm for 0–1 knapsack problems. Comput Intell Neurosci 2014:970456

    Google Scholar 

  18. Feng Y, Wang GG, Feng Q, Zhao XJ (2014) An effective hybrid cuckoo search algorithm with improved shuffled frog leaping algorithm for 0–1 knapsack problems. Comput Intell Neurosci 2014

  19. Feng Y, Wang GG, Gao XZ (2016) A novel hybrid cuckoo search algorithm with global harmony search for 0–1 knapsack problems. Int J Comput Intell Syst 9(6):1174–1190

    Article  Google Scholar 

  20. Feng Y, Wang GG, Deb S, Lu M, Zhao XJ (2017) Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput Appl 28(7):1619–1634

    Article  Google Scholar 

  21. Feng Y, Yang J, Wu C, Lu M, Zhao XJ (2018) Solving 0–1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation. Memet Comput 10(2):135–150

    Article  Google Scholar 

  22. Feng Y, Wang GG, Dong J, Wang L (2018) Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0–1 knapsack problem. Comput Electr Eng 67:454–468

    Article  Google Scholar 

  23. Abdel-Basset M, Zhou Y (2018) An elite opposition-flower pollination algorithm for a 0–1 knapsack problem. Int J Bio-Inspir Comput 11(1):46–53

    Article  Google Scholar 

  24. Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0–1 knapsack problem. Appl Soft Comput 13(4):1774–1780

    Article  Google Scholar 

  25. Truong TK, Li K, Xu Y, Ouyang A, Nguyen TT (2015) Solving 0–1 knapsack problem by artificial chemical reaction optimization algorithm with a greedy strategy. J Intell Fuzzy Syst 28(5):2179–2186

    Article  MathSciNet  MATH  Google Scholar 

  26. Zhou Y, Bao Z, Luo Q, Zhang S (2017) A complex-valued encoding wind driven optimization for the 0–1 knapsack problem. Appl Intell 46(3):684–702

    Article  Google Scholar 

  27. Zou D, Gao L, Li S, Wu J (2011) Solving 0–1 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11(2):1556–1564

    Article  Google Scholar 

  28. Layeb A (2013) A hybrid quantum inspired harmony search algorithm for 0–1 optimization problems. J Comput Appl Math 253:14–25

    Article  MathSciNet  MATH  Google Scholar 

  29. Tuo S, Yong L, Deng F (2014) A novel harmony search algorithm based on teaching-learning strategies for 0–1 knapsack problems. Sci World J 2014:637412

    Article  Google Scholar 

  30. Xiang WL, An MQ, Li YZ, He RC, Zhang JF (2014) A novel discrete global-best harmony search algorithm for solving 0–1 knapsack problems. Discrete Dyn Nat Soc 2014:573731

    Article  Google Scholar 

  31. Kong X, Gao L, Ouyang H, Li S (2015) A simplified binary harmony search algorithm for large scale 0–1 knapsack problems. Expert Syst Appl 42(12):5337–5355

    Article  Google Scholar 

  32. Kruskal WH, Wallis WW (1952) Use of ranks in one-criterion variance analysis. J Am Stat Assoc 47(260):583–621

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer and Information Science, Fujian Agriculture and Forestry University, Fuzhou, 350002, China

    Shihua Zhan, Lijin Wang, Zejun Zhang & Yiwen Zhong

  2. Key Laboratory of Smart Agriculture and Forestry (Fujian Agriculture and Forestry University), Fujian Province University, Fuzhou, 350002, China

    Shihua Zhan, Lijin Wang, Zejun Zhang & Yiwen Zhong

Authors
  1. Shihua Zhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lijin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zejun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yiwen Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yiwen Zhong.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This work was supported by the Nature Science Foundation of Fujian Province of P. R. China (Nos. 2019J01401, 2016J01280) and the Special Fund for Scientific and Technological Innovation of Fujian Agriculture and Forestry University (Nos. CXZX2016026, CXZX2016031).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhan, S., Wang, L., Zhang, Z. et al. Noising methods with hybrid greedy repair operator for 0–1 knapsack problem. Memetic Comp. 12, 37–50 (2020). https://doi.org/10.1007/s12293-019-00288-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-019-00288-z

Keywords

Search

Navigation