{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:31:42Z","timestamp":1781105502349,"version":"3.54.1"},"reference-count":37,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,1,1]]},"abstract":"<p>Knapsack Problem (KP) is a popular combinatorial optimization problem having application in many technical and economic areas. Several attempts have been made in past to solve the problem. Various exact and non-exact approaches exist to solve KP. Exact algorithms for KP are based on either branch and bound or dynamic programming technique. Heuristics exist which solve KP non-exactly in lesser time. Heuristic approaches do not provide any guarantee regarding the quality of solution whereas exact approaches have high worst case complexities. Quantum-inspired Evolutionary Algorithm (QEA) is a subclass of Evolutionary Algorithm, a naturally inspired population based search technique. QEA uses concepts of quantum computing. An engineered Quantum-inspired Evolutionary Algorithm (QEA-E), an improved version of QEA, is presented which quickly solves extremely large spanner problem instances (e.g. 290,000 items) that are very difficult for the state of the art exact algorithm as well as the original QEA.<\/p>","DOI":"10.4018\/ijaec.2014010104","type":"journal-article","created":{"date-parts":[[2014,6,17]],"date-time":"2014-06-17T10:29:12Z","timestamp":1403000952000},"page":"52-68","source":"Crossref","is-referenced-by-count":3,"title":["Solution of \u201cHard\u201d Knapsack Instances Using Quantum Inspired Evolutionary Algorithm"],"prefix":"10.4018","volume":"5","author":[{"given":"C.","family":"Patvardhan","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sulabh","family":"Bansal","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t zu Kiel, Kiel, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijaec.2014010104-0","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1130"},{"key":"ijaec.2014010104-1","author":"R. E.Bellman","year":"1957","journal-title":"Dynamic programming"},{"key":"ijaec.2014010104-2","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060401020030"},{"key":"ijaec.2014010104-3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580448"},{"key":"ijaec.2014010104-4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02241754"},{"key":"ijaec.2014010104-5","unstructured":"Han, K., & Kim, J. (2003). On setting the parameters of quantum-inspired evolutionary algorithm for practical application. In Proc. CEC (pp. 178-184)."},{"key":"ijaec.2014010104-6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823467"},{"key":"ijaec.2014010104-7","unstructured":"Han, K., Park, K., Lee, C., & Kim, J. (2001). Parallel quantum-inspired genetic algorithm for combinatorial optimization prblem. Proc. CEC, 2, 1422-1429."},{"key":"ijaec.2014010104-8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804320"},{"key":"ijaec.2014010104-9","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321823"},{"key":"ijaec.2014010104-10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"ijaec.2014010104-11","unstructured":"Kim, Y., Kim, J. H., & Han, K. H. (2006). Quantum-inspired multiobjective evolutionary algorithm for multiobjective 0\/1 knapsack problems. In Proc. CEC (pp. 2601-2606)."},{"key":"ijaec.2014010104-12","doi-asserted-by":"publisher","DOI":"10.1007\/11539902_25"},{"key":"ijaec.2014010104-13","unstructured":"Li, Y., Zhang, Y. N., Zhao, R. C., & Jiao, L. C. (2004). The immune quantum-inspired evolutionary algorithm. In Proceedings of the IEEE ICSMC (pp. 3301-3305)."},{"key":"ijaec.2014010104-14","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00260-X"},{"key":"ijaec.2014010104-15","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.3.414"},{"key":"ijaec.2014010104-16","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(77)90024-8"},{"key":"ijaec.2014010104-17","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.5.633"},{"key":"ijaec.2014010104-18","doi-asserted-by":"crossref","unstructured":"Mohanty, S. N., & Satapathy, R. (2009). An evolutionary multiobjective genetic algorithm to solve 0\/1 knapsack problem. In Proc. 2nd IEEE Int. Conf. on Computer Science and Information Technology (ICCSIT 2009) (pp. 397-399).","DOI":"10.1109\/ICCSIT.2009.5234668"},{"key":"ijaec.2014010104-19","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.1.27"},{"issue":"2","key":"ijaec.2014010104-20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.2478\/v10175-012-0043-4","article-title":"GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem.","volume":"60","author":"R.Nowotniak","year":"2012","journal-title":"Bulletin Of The Polish Academy Of Sciences: Technical Sciences"},{"key":"ijaec.2014010104-21","doi-asserted-by":"crossref","unstructured":"Patvardhan, C., Narayan, A., & Srivastav, A. (2007). Enhanced quantum evolutionary algorithms for difficult knapsack problems. In Proc. 2nd Int. Conf. on PATTERN recognition and Machine Intelligence (PReMI'07) (pp. 252-260). Springer-Verlag Berlin.","DOI":"10.1007\/978-3-540-77046-6_31"},{"key":"ijaec.2014010104-22","unstructured":"Patvardhan, C., Prakash, P., & Srivastav, A. (2009). A novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. In Proc. Int. Conf. on Operationas Research Applications In Engineering and Management, Tiruchirapalli, India (pp. 2061-2064)."},{"key":"ijaec.2014010104-23","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00013-3"},{"key":"ijaec.2014010104-24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.5.758"},{"key":"ijaec.2014010104-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.03.002"},{"key":"ijaec.2014010104-26","first-page":"277","article-title":"A hybrid method for the 0-1 knapsack problem.","volume":"49","author":"G.Plateau","year":"1985","journal-title":"Methods of Operations Research"},{"key":"ijaec.2014010104-27","unstructured":"Platel, M. D., Schliebs, S., & Kasabov, N. (2007). A versatile quantum-inspired evolutionary algorithm. In Proc. CEC (pp. 423-430)."},{"key":"ijaec.2014010104-28","doi-asserted-by":"crossref","unstructured":"Spillman, R. (1995). Solving large knapsack problems with a genetic algorithm. In Proc. IEEE Int. Conf. Systems, Man, and Cybernetics, Vancouver, Canada (pp. 632-637).","DOI":"10.1109\/ICSMC.1995.537834"},{"key":"ijaec.2014010104-29","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2006.10.001"},{"key":"ijaec.2014010104-30","doi-asserted-by":"publisher","DOI":"10.1007\/11539117_99"},{"key":"ijaec.2014010104-31","unstructured":"Yang, S. Y., Wang, M., & Jiao, L. C. (2004a). A genetic algorithm based on quantum chromosome. In Proc. ICSP (pp. 1622-1625)."},{"key":"ijaec.2014010104-32","unstructured":"Yang, S. Y., Wang, M., & Jiao, L. C. (2004b). A novel quantum evolutionary algorithm and its application. In Proc CEC (pp. 820-826)."},{"key":"ijaec.2014010104-33","first-page":"239","author":"P.Yarlagadda","year":"2012","journal-title":"An improved quantum-inspired evolutionary algorithm based on P systems with a dynamic membrane structure for knapsack problems"},{"issue":"1","key":"ijaec.2014010104-34","first-page":"93","article-title":"A quantum-inspired evolutionary algorithm based on p systems for knapsack problem.","volume":"87","author":"G.Zhang","year":"2008","journal-title":"Fund. Inf."},{"key":"ijaec.2014010104-35","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 Proceedings of the Sixth Int. Conf. on Natural Computation (ICNC 2010), Hiroshima, Japan.","DOI":"10.1109\/ICNC.2010.5584179"},{"key":"ijaec.2014010104-36","doi-asserted-by":"crossref","unstructured":"Zhang, R., & Gao, H. (2007). Improved quantum evolutionary algorithm for combinatorial optimization problem. In Proc. ICMLC (pp. 3501-3505).","DOI":"10.1109\/ICMLC.2007.4370753"}],"container-title":["International Journal of Applied Evolutionary Computation"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=109614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T01:11:06Z","timestamp":1654132266000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijaec.2014010104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,1,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijaec.2014010104","relation":{},"ISSN":["1942-3594","1942-3608"],"issn-type":[{"value":"1942-3594","type":"print"},{"value":"1942-3608","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,1]]}}}