{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T11:29:01Z","timestamp":1776338941882,"version":"3.51.2"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T00:00:00Z","timestamp":1429574400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s12293-015-0162-1","type":"journal-article","created":{"date-parts":[[2015,4,20]],"date-time":"2015-04-20T18:03:42Z","timestamp":1429553022000},"page":"135-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems"],"prefix":"10.1007","volume":"7","author":[{"given":"C.","family":"Patvardhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sulabh","family":"Bansal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,21]]},"reference":[{"key":"162_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berin"},{"key":"162_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1974","unstructured":"Horowitz E, Sahani S (1974) Computing partitions with applications to the knapsack problem. J ACM 21:277\u2013292","journal-title":"J ACM"},{"key":"162_CR3","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/BF01580448","volume":"8","author":"D Fayard","year":"1975","unstructured":"Fayard D, Plateau G (1975) Resolution of the 0\u20131 knapsack problem. Comparison of methods. Math Program 8:272\u2013307","journal-title":"Math Program"},{"key":"162_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"RM Nauss","year":"1976","unstructured":"Nauss RM (1976) An efficient algorithm for the 0\u20131 knapsack problem. Manage Sci 23:27\u201331","journal-title":"Manage Sci"},{"key":"162_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S Martello","year":"1977","unstructured":"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\u2013175","journal-title":"Eur J Oper Res"},{"issue":"1","key":"162_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(71)90005-7","volume":"1","author":"GH Bradley","year":"1971","unstructured":"Bradley GH (1971) Transformation of integer programs to Knapsack problems. Discrete Math 1(1):29\u201345","journal-title":"Discrete Math"},{"key":"162_CR7","doi-asserted-by":"crossref","unstructured":"Karp R (1972) Reducibility among combinatorial problems. Technical Report 3. University of California, Berkeley","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"162_CR8","doi-asserted-by":"crossref","unstructured":"Narayanan A, Moore M (1996) Quantum-inspired genetic algorithms. In: Proc CEC, pp 61\u201366","DOI":"10.1109\/ICEC.1996.542334"},{"key":"162_CR9","unstructured":"Han K, Kim J (2000) Genetic quantum algorithm and its application to combinatorial optimization problem. In: Proc. CEC, pp 1354\u20131360"},{"issue":"6","key":"162_CR10","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"KH Han","year":"2002","unstructured":"Han KH, Kim JH (2002) Quantum-Inspired Evolutionary Algorithm for a class of combinatorial optimization. IEEE Trans Evol Comput 6(6):580\u2013593","journal-title":"IEEE Trans Evol Comput"},{"key":"162_CR11","unstructured":"Han KH (2006) On the analysis of the Quantum-inspired Evolutionary Algorithm with a single individual. In: IEEE congress on evolutionary computation, Vancouver, Canada"},{"issue":"6","key":"162_CR12","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1109\/TEVC.2008.2003010","volume":"13","author":"MD Platel","year":"2009","unstructured":"Platel MD, Schliebs S, Kasabov N (2009) Quantum-Inspired Evolutionary Algorithm: a multimodel EDA. IEEE Trans Evol Comput 13(6):1218\u20131232","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"162_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10732-010-9136-0","volume":"17","author":"G Zhang","year":"2011","unstructured":"Zhang G (2011) Quantum-inspired evolutionary algorithms: a survey and empirical study. J Heurist 17(3):303\u2013351","journal-title":"J Heurist"},{"key":"162_CR14","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/ICNC.2010.5584179"},{"key":"162_CR15","unstructured":"Yang SY, Wang M, Jiao LC (2004) A genetic algorithm based on quantum chromosome. In: Proc. ICSP, pp 1622\u20131625"},{"key":"162_CR16","unstructured":"Yang SY, Wang M, Jiao LC (2004) A novel quantum evolutionary algorithm and its application. In: Proc CEC, pp 820\u2013826"},{"key":"162_CR17","unstructured":"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\u20132064"},{"issue":"1","key":"162_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s11460-005-0014-8","volume":"1","author":"GX Zhang","year":"2006","unstructured":"Zhang GX, Li N, Jin WD, Hu LZ (2006) Novel quantum algorithm and its applications. Front Electr Electron Eng Cina 1(1):31\u201326","journal-title":"Front Electr Electron Eng Cina"},{"key":"162_CR19","unstructured":"Li Y, Zhang YN, Zhao RC, Jiao LC (2004) The immune quantum-inspired evolutionary algorithm. In: IEEE ICSMC, pp 3301\u20133305"},{"key":"162_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013218","DOI":"10.1007\/11539902_25"},{"issue":"4\u20136","key":"162_CR21","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/j.neucom.2006.10.001","volume":"70","author":"Y Wang","year":"2007","unstructured":"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\u20136):633\u2013640","journal-title":"Neurocomputing"},{"key":"162_CR22","doi-asserted-by":"crossref","unstructured":"Wang Y, Feng XY, Huang YX, Zhou WG, Liang YC, Zhou CG (2005) A novel quantum swarm evolutionary algorithm for solving 0\u20131 knapsack problem. In: Lecture notes in computer science, pp 698\u2013704","DOI":"10.1007\/11539117_99"},{"issue":"1","key":"162_CR23","first-page":"93","volume":"87","author":"GX Zhang","year":"2008","unstructured":"Zhang GX, Gheorghe M, Wu CZ (2008) A quantum-inspired evolutionary algorithm based on p systems for knapsack problem. Fund Inf 87(1):93\u2013116","journal-title":"Fund Inf"},{"key":"162_CR24","first-page":"1528","volume":"239\u2013240","author":"P Yarlagadda","year":"2012","unstructured":"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\u2013240:1528\u20131531","journal-title":"Appl Mech Mater"},{"key":"162_CR25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/HIS-2010-0115","volume":"7","author":"A Mani","year":"2010","unstructured":"Mani A, Patvardhan C (2010) A hybrid quantum evolutionary algorithm for solving engineering optimization problems. Int J Hybrid Intell Syst 7:225\u2013235","journal-title":"Int J Hybrid Intell Syst"},{"key":"162_CR26","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/ISMS.2010.19"},{"issue":"2","key":"162_CR27","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/TEVC.2004.823467","volume":"8","author":"K Han","year":"2004","unstructured":"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\u2013169","journal-title":"IEEE Trans Evol Comput"},{"key":"162_CR28","unstructured":"Han K, Kim J (2003) On setting the parameters of quantum-inspired evolutionary algorithm for practical application. In: Proc. CEC, pp 178\u2013184"},{"key":"162_CR29","unstructured":"Han K, Park K, Lee C, Kim J (2001) Parallel quantum-inspired genetic algorithm for combinatorial optimization prblem. In: Proc. CEC, pp 1422\u20131429"},{"key":"162_CR30","doi-asserted-by":"crossref","unstructured":"Zhang R, Gao H (2007) Improved quantum evolutionary algorithm for combinatorial optimization problem. In: Proc. ICMLC, pp 3501\u20133505","DOI":"10.1109\/ICMLC.2007.4370753"},{"key":"162_CR31","unstructured":"Platel MD, Schliebs S, Kasabov N (2007) A versatile quantum-inspired evolutionary algorithm. In: Proc. CEC, pp 423\u2013430"},{"key":"162_CR32","unstructured":"Kim Y, Kim JH, Han KH (2006) Quantum-inspired multiobjective evolutionary algorithm for multiobjective 0\/1 knapsack problems. In: Proc. CEC, pp 2601\u20132606"},{"key":"162_CR33","doi-asserted-by":"crossref","unstructured":"Patvardhan C, Narayan A, Srivastav A (2007) Enhanced Quantum Evolutionary Algorithms for difficult Knapsack problems. In: PReMI\u201907 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence, pp 252\u2013260","DOI":"10.1007\/978-3-540-77046-6_31"},{"issue":"2","key":"162_CR34","first-page":"323","volume":"60","author":"R Nowotniak","year":"2012","unstructured":"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\u2013330","journal-title":"Bull Polish Acad Sci Tech Sci"},{"key":"162_CR35","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.cor.2011.03.014","volume":"39","author":"V Boyer","year":"2012","unstructured":"Boyer V, Baz DE, Elkihel M (2012) Solving knapsack problems on GPU. Comput Oper Res 39:42\u201347","journal-title":"Comput Oper Res"},{"issue":"3","key":"162_CR36","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/ijoc.1090.0330","volume":"21","author":"CH Reilly","year":"2009","unstructured":"Reilly CH (2009) Synthetic optimization problem generation: show us the correlations!. INFORMS J Comput 21(3):458\u2013467","journal-title":"INFORMS J Comput"},{"issue":"2","key":"162_CR37","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello S, Pisinger D, Paolo T (2000) New trends in exact algorithms for the 0\u20131 knapsack problem. Eur J Oper Res 123(2):325\u2013332","journal-title":"Eur J Oper Res"},{"issue":"5","key":"162_CR38","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger D (2005) Where are the hard Knapsack problems. Technical Report. Comput Oper Res 32(5):2271\u20132284","journal-title":"Comput Oper Res"},{"key":"162_CR39","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello S, Pisinger D, Toth P (1999) Dynamic programming and strong bounds for the 0\u20131 Knapsack problem. Manage Sci 45:414\u2013424","journal-title":"Manage Sci"},{"key":"162_CR40","doi-asserted-by":"crossref","first-page":"11042","DOI":"10.1016\/j.amc.2012.05.001","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for Knapsack problems. Appl Math Comput 218:11042\u201311061","journal-title":"Appl Math Comput"},{"key":"162_CR41","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, Chichester"},{"key":"162_CR42","unstructured":"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\u2013206"},{"key":"162_CR43","doi-asserted-by":"crossref","unstructured":"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\u20131170","DOI":"10.1109\/ICCIS.2008.4670952"},{"key":"162_CR44","doi-asserted-by":"crossref","unstructured":"Mahdabi P, Jalili S, Abadi M (2008) A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems. In: (GECCO \u201908) Proceedings of the 10th annual conference on genetic and evolutionary computation, pp 613\u2013614","DOI":"10.1145\/1389095.1389218"},{"key":"162_CR45","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/s10015-007-0457-5","volume":"12","author":"T Imabeppu","year":"2008","unstructured":"Imabeppu T, Nakayama S, Ono S (2008) A study on a quantum-inspired evolutionary algorithm based on pair swap. Artif Life Robot 12:148\u2013152","journal-title":"Artif Life Robot"},{"key":"162_CR46","unstructured":"Pisinger D (2012) David Pisinger\u2019s optimization codes. [Internet]. [cited 2012 November 2]. http:\/\/www.diku.dk\/pisinger\/codes.html"},{"key":"162_CR47","unstructured":"Boyer V, Baz D, Elkihel M. Knapsack Problems. [Internet]. http:\/\/www.laas.fr\/CDA-EN\/45-31329-Knapsack-problems.php"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0162-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-015-0162-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0162-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T20:47:34Z","timestamp":1566593254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-015-0162-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,21]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["162"],"URL":"https:\/\/doi.org\/10.1007\/s12293-015-0162-1","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,21]]}}}