Skip to main content
SpringerLink
Log in

Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems

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

Abstract

Quantum Inspired Evolutionary Algorithms (QIEAs) are Evolutionary Algorithms which use concepts and principles of quantum computing. The 0/1 knapsack problem (KP) is a well known combinatorial optimization problem that has been typically used to validate the performance of QIEAs. However, there are some variants of KPs called difficult knapsack problems (DKPs) that are known to be more difficult to solve. QIEAs have not yet been fully explored for solving these. In this work, an improved QIEA, called QIEA-PSA is presented. A novel method to initialize the qubit individuals based on heuristic information for the KP instance and a method for size reduction for each new generation are introduced in the presented QIEA-PSA. Experiments are carried out for several types of DKPs that are much larger in size than those attempted hitherto. QIEA-PSA provides much better solutions than QIEA with much lesser computation times. Even a serial implementation of QIEA-PSA competes favorably on the same problem instances with a parallel implementation of an exact algorithm given recently in literature. A comparison is made which shows QIEA-PSA outperforms a recently applied population based search technique to solve benchmark KP instances. The ideas used for developing QIEA-PSA are general and may be utilized with advantage on other problems.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berin

    Book  MATH  Google Scholar 

  2. Horowitz E, Sahani S (1974) Computing partitions with applications to the knapsack problem. J ACM 21:277–292

    Article  MATH  Google Scholar 

  3. Fayard D, Plateau G (1975) Resolution of the 0–1 knapsack problem. Comparison of methods. Math Program 8:272–307

    Article  MATH  MathSciNet  Google Scholar 

  4. Nauss RM (1976) An efficient algorithm for the 0–1 knapsack problem. Manage Sci 23:27–31

    Article  MATH  Google Scholar 

  5. Martello S, Toth P (1977) An upper bound for the zero-one knapsack problemand a branch and bound algorithm. Eur J Oper Res 1:169–175

    Article  MATH  MathSciNet  Google Scholar 

  6. Bradley GH (1971) Transformation of integer programs to Knapsack problems. Discrete Math 1(1):29–45

    Article  MATH  MathSciNet  Google Scholar 

  7. Karp R (1972) Reducibility among combinatorial problems. Technical Report 3. University of California, Berkeley

  8. Narayanan A, Moore M (1996) Quantum-inspired genetic algorithms. In: Proc CEC, pp 61–66

  9. Han K, Kim J (2000) Genetic quantum algorithm and its application to combinatorial optimization problem. In: Proc. CEC, pp 1354–1360

  10. Han KH, Kim JH (2002) Quantum-Inspired Evolutionary Algorithm for a class of combinatorial optimization. IEEE Trans Evol Comput 6(6):580–593

    Article  Google Scholar 

  11. Han KH (2006) On the analysis of the Quantum-inspired Evolutionary Algorithm with a single individual. In: IEEE congress on evolutionary computation, Vancouver, Canada

  12. Platel MD, Schliebs S, Kasabov N (2009) Quantum-Inspired Evolutionary Algorithm: a multimodel EDA. IEEE Trans Evol Comput 13(6):1218–1232

    Article  Google Scholar 

  13. Zhang G (2011) Quantum-inspired evolutionary algorithms: a survey and empirical study. J Heurist 17(3):303–351

    Article  MATH  Google Scholar 

  14. Zhang H, Zhang G, Rong H, Cheng J (2010) Comparisons of quantum rotation gates in Quantum-Inspired Evolutionary Algorithms. In: Sixth international conference on natural computation (ICNC 2010), Hiroshima

  15. Yang SY, Wang M, Jiao LC (2004) A genetic algorithm based on quantum chromosome. In: Proc. ICSP, pp 1622–1625

  16. Yang SY, Wang M, Jiao LC (2004) A novel quantum evolutionary algorithm and its application. In: Proc CEC, pp 820–826

  17. Patvardhan C, Prakash P, Srivastav A (2009) A novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. In: Proceedings of the international conference on operationas research applications in engineering and management, May 2009; Tiruchirapalli, India, pp 2061–2064

  18. Zhang GX, Li N, Jin WD, Hu LZ (2006) Novel quantum algorithm and its applications. Front Electr Electron Eng Cina 1(1):31–26

    Article  Google Scholar 

  19. Li Y, Zhang YN, Zhao RC, Jiao LC (2004) The immune quantum-inspired evolutionary algorithm. In: IEEE ICSMC, pp 3301–3305

  20. Li Y, Zhang Y, Cheng Y, Jiang X, Zhao R (2005) A novel immune quantum-inspired genetic algorithm. In: Lecture notes in computer science, pp 215–218

  21. Wang Y, Feng XY, Huang YX, Pu DB, Zhou WG, Liang YC, Zhou CG (2007) A novel quantum swarm evolutionary algorithm and its applications. Neurocomputing 70(4–6):633–640

    Article  Google Scholar 

  22. Wang Y, Feng XY, Huang YX, Zhou WG, Liang YC, Zhou CG (2005) A novel quantum swarm evolutionary algorithm for solving 0–1 knapsack problem. In: Lecture notes in computer science, pp 698–704

  23. Zhang GX, Gheorghe M, Wu CZ (2008) A quantum-inspired evolutionary algorithm based on p systems for knapsack problem. Fund Inf 87(1):93–116

    MATH  MathSciNet  Google Scholar 

  24. Yarlagadda P, Kim YH (2012) An Improved Quantum-Inspired Evolutionary Algorithm based on P systems with a dynamic membrane structure for Knapsack problems. Appl Mech Mater 239–240:1528–1531

    Google Scholar 

  25. Mani A, Patvardhan C (2010) A hybrid quantum evolutionary algorithm for solving engineering optimization problems. Int J Hybrid Intell Syst 7:225–235

    MATH  Google Scholar 

  26. Mani A, Patvardhan C (2010) Solving ceramic grinding optimization problem by adaptive quantum evolutionary algorithm. In: Proceedings of the international conference on intelligent systems, modelling and simulation, January 2010, Liverpool, United Kingdom

  27. Han K, Kim J (2004) Quantum-inspired evolutionary algorithms with a new termination criterion, h-epsilon gate, and two-phase scheme. IEEE Trans Evol Comput 8(2):156–169

    Article  Google Scholar 

  28. Han K, Kim J (2003) On setting the parameters of quantum-inspired evolutionary algorithm for practical application. In: Proc. CEC, pp 178–184

  29. Han K, Park K, Lee C, Kim J (2001) Parallel quantum-inspired genetic algorithm for combinatorial optimization prblem. In: Proc. CEC, pp 1422–1429

  30. Zhang R, Gao H (2007) Improved quantum evolutionary algorithm for combinatorial optimization problem. In: Proc. ICMLC, pp 3501–3505

  31. Platel MD, Schliebs S, Kasabov N (2007) A versatile quantum-inspired evolutionary algorithm. In: Proc. CEC, pp 423–430

  32. Kim Y, Kim JH, Han KH (2006) Quantum-inspired multiobjective evolutionary algorithm for multiobjective 0/1 knapsack problems. In: Proc. CEC, pp 2601–2606

  33. Patvardhan C, Narayan A, Srivastav A (2007) Enhanced Quantum Evolutionary Algorithms for difficult Knapsack problems. In: PReMI’07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence, pp 252–260

  34. Nowotniak R, Kucharski J (2012) GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem. Bull Polish Acad Sci Tech Sci 60(2):323–330

    Google Scholar 

  35. Boyer V, Baz DE, Elkihel M (2012) Solving knapsack problems on GPU. Comput Oper Res 39:42–47

    Article  MATH  MathSciNet  Google Scholar 

  36. Reilly CH (2009) Synthetic optimization problem generation: show us the correlations!. INFORMS J Comput 21(3):458–467

    Article  MATH  MathSciNet  Google Scholar 

  37. Martello S, Pisinger D, Paolo T (2000) New trends in exact algorithms for the 0–1 knapsack problem. Eur J Oper Res 123(2):325–332

    Article  MATH  Google Scholar 

  38. Pisinger D (2005) Where are the hard Knapsack problems. Technical Report. Comput Oper Res 32(5):2271–2284

    Article  MATH  MathSciNet  Google Scholar 

  39. Martello S, Pisinger D, Toth P (1999) Dynamic programming and strong bounds for the 0–1 Knapsack problem. Manage Sci 45:414–424

    Article  MATH  Google Scholar 

  40. Bansal JC, Deep K (2012) A modified binary particle swarm optimization for Knapsack problems. Appl Math Comput 218:11042–11061

    Article  MATH  MathSciNet  Google Scholar 

  41. Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester

    MATH  Google Scholar 

  42. Zhao Z, Peng X, Peng Y, Yu E (2006) An effective repair procedure based on Quantum-inspired Evolutionary Algorithm for 0/1 Knapsack Problems. In: Proceedings of the 5th WSEAS Int. conf. on instrumentation, measurement, circuits and systems, Hangzhou, pp 203–206

  43. Tayarani-N MH, Akbarzadeh-T MR (2008) A sinusoid size ring structure quantum evolutionary algorithm. In: IEEE conference on cybernetics and intelligent systems, pp 1165–1170

  44. Mahdabi P, Jalili S, Abadi M (2008) A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems. In: (GECCO ’08) Proceedings of the 10th annual conference on genetic and evolutionary computation, pp 613–614

  45. Imabeppu T, Nakayama S, Ono S (2008) A study on a quantum-inspired evolutionary algorithm based on pair swap. Artif Life Robot 12:148–152

    Article  Google Scholar 

  46. Pisinger D (2012) David Pisinger’s optimization codes. [Internet]. [cited 2012 November 2]. http://www.diku.dk/pisinger/codes.html

  47. Boyer V, Baz D, Elkihel M. Knapsack Problems. [Internet]. http://www.laas.fr/CDA-EN/45-31329-Knapsack-problems.php

Download references

Acknowledgments

Authors are grateful to Department of Science and Technology, India (DST) and Deutsche Forschungsgemeinschaft, Germany (DFG) for the support under project No. INT/FRG/DFG/P-38/2012 titled “Algorithm Engineering of Quantum Evolutionary Algorithms for Hard Optimization Problems”.

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Faculty of Engineering, DEI, Agra, 282005, India

    C. Patvardhan & Sulabh Bansal

  2. Christian-Albrechts-Universität zu Kiel, Institut für Informatik, Christian-Albrechts-Platz 4, 24118, Kiel, Germany

    Anand Srivastav

  3. 1/25, Hazuri Bhawan, Peepal Mandi, Agra, 282003, India

    Sulabh Bansal

Authors
  1. C. Patvardhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sulabh Bansal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anand Srivastav
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sulabh Bansal.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Patvardhan, C., Bansal, S. & Srivastav, A. Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems. Memetic Comp. 7, 135–155 (2015). https://doi.org/10.1007/s12293-015-0162-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-015-0162-1

Keywords

Search

Navigation