{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:20:13Z","timestamp":1781104813692,"version":"3.54.1"},"reference-count":80,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,10]]},"abstract":"<jats:p>Quantum-inspired evolutionary algorithms (QIEAs) like all evolutionary algorithms (EAs) perform well on many problems but cannot perform equally better than random for all problems due to the No Free Lunch theorem. However, a framework providing near-optimal solutions on reasonably hard instances of a large variety of problems is feasible. It has an effective general strategy for easy incorporation of domain information along with effective control on the randomness in the search process to balance the exploration and exploitation. Moreover, its effective parallel implementation is desired in the current age. Such a Generalized Parallel QIEA framework designed for the solution of Subset Selection Problems is presented here. The computational performance results demonstrate its effectiveness in the solution of different large-sized hard SSPs like the Difficult Knapsack Problem, the Quadratic Knapsack Problem and the Multiple Knapsack problem. This is the first such a generalized framework and is a major step towards creating an adaptive search framework for combinatorial optimization problems.<\/jats:p>","DOI":"10.4018\/ijaec.2019100101","type":"journal-article","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T13:45:02Z","timestamp":1568900702000},"page":"1-38","source":"Crossref","is-referenced-by-count":0,"title":["A Generalized Parallel Quantum Inspired Evolutionary Algorithm Framework for Hard Subset Selection Problems"],"prefix":"10.4018","volume":"10","author":[{"given":"Sulabh","family":"Bansal","sequence":"first","affiliation":[{"name":"School of Computing and Information Technology, Manipal University Jaipur, Jaipur, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Patvardhan","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Dayalbagh Educational Institute, Agra, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJAEC.2019100101-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.07.017"},{"key":"IJAEC.2019100101-1","doi-asserted-by":"crossref","unstructured":"Azad, M. A., Rocha, M. A., & Fernandes, E. M. (2013). A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems. Journal of Computational and Applied Mathematics. Retrieved from http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377042713005074","DOI":"10.1016\/j.cam.2013.09.052"},{"key":"IJAEC.2019100101-2","doi-asserted-by":"publisher","DOI":"10.1887\/0750308958"},{"key":"IJAEC.2019100101-3","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585888"},{"key":"IJAEC.2019100101-4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1130"},{"key":"IJAEC.2019100101-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.05.001"},{"key":"IJAEC.2019100101-6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00244-3"},{"key":"IJAEC.2019100101-7","unstructured":"Billionet, A., & Soutif, E. (2004b). QKP Instances. Retrieved from http:\/\/cedric.cnam.fr\/~soutif\/QKP\/QKP.html"},{"key":"IJAEC.2019100101-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.03.014"},{"key":"IJAEC.2019100101-9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.2.125"},{"key":"IJAEC.2019100101-10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382820"},{"key":"IJAEC.2019100101-11","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060401020030"},{"key":"IJAEC.2019100101-12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580448"},{"key":"IJAEC.2019100101-13","unstructured":"Fomeni, F. D., & Letchford, A. N. (2012). A Dynamic Programming Heuristic for the Quadratic Knapsack Problem. Retrieved from http:\/\/www.optimization-online.org\/DB_HTML\/2012\/03\/3392.html"},{"key":"IJAEC.2019100101-14","author":"D. E.Goldberg","year":"1989","journal-title":"Genetic algorithms in search, optimization and machine learning"},{"key":"IJAEC.2019100101-15","first-page":"179","article-title":"Efficient Methods for solving quadratic 0-1 knapsack problem.","volume":"35","author":"P. L.Hammer","year":"1997","journal-title":"INFOR"},{"key":"IJAEC.2019100101-16","unstructured":"Han, K., & Kim, J. (2003). On setting the parameters of quantum-inspired evolutionary algorithm for practical application. In Proc. CEC (Vol. 1, pp. 178-194). Academic Press."},{"key":"IJAEC.2019100101-17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823467"},{"key":"IJAEC.2019100101-18","unstructured":"Han, K., Park, K., Lee, C., & Kim, J. (2001). Parallel quantum-inspired genetic algorithm for combinatorial optimization problem. In Proc. CEC (Vol. 2, pp. 1422-1429). Academic Press."},{"key":"IJAEC.2019100101-19","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688636"},{"key":"IJAEC.2019100101-20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804320"},{"key":"IJAEC.2019100101-21","doi-asserted-by":"publisher","DOI":"10.1049\/cce:19990303"},{"key":"IJAEC.2019100101-22","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800250316"},{"key":"IJAEC.2019100101-23","doi-asserted-by":"publisher","DOI":"10.1007\/s10015-007-0457-5"},{"issue":"4","key":"IJAEC.2019100101-24","first-page":"665","article-title":"Parameterized approximation scheme for the multiple knapsack problem.","volume":"39","author":"K.Jansen","year":"2009","journal-title":"SIAM Journal on Computing"},{"key":"IJAEC.2019100101-25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27660-6_26"},{"key":"IJAEC.2019100101-26","doi-asserted-by":"crossref","unstructured":"Julstrom, B. A. (2005). Greedy, genetic and greedy genetic algorithms for the quadratic knapsack problem. In Genetic and evolutionary computation conference (pp. 607-614). ACM.","DOI":"10.1145\/1068009.1068111"},{"key":"IJAEC.2019100101-27","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). Academic Press."},{"key":"IJAEC.2019100101-28","first-page":"67","article-title":"A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.","volume":"2013","author":"L.Kliemann","year":"2013","journal-title":"SEA"},{"key":"IJAEC.2019100101-29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.12.051"},{"key":"IJAEC.2019100101-30","doi-asserted-by":"publisher","DOI":"10.1504\/IJMOR.2012.046684"},{"key":"IJAEC.2019100101-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.10.027"},{"key":"IJAEC.2019100101-32","doi-asserted-by":"publisher","DOI":"10.1007\/11539902_25"},{"key":"IJAEC.2019100101-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.04.018"},{"key":"IJAEC.2019100101-34","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 Proceedings of the 10th annual conference on Genetic and evolutionary computation(GECCO '08) (pp. 613-614).","DOI":"10.1145\/1389095.1389218"},{"key":"IJAEC.2019100101-35","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-2010-0115"},{"key":"IJAEC.2019100101-36","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(77)90024-8"},{"key":"IJAEC.2019100101-37","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(80)90112-5"},{"key":"IJAEC.2019100101-38","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90005-6"},{"key":"IJAEC.2019100101-39","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.34.5.633"},{"key":"IJAEC.2019100101-40","author":"S.Martello","year":"1990","journal-title":"Knapsack Problems: Algorithms and Computer Implementations"},{"key":"IJAEC.2019100101-41","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00260-X"},{"key":"IJAEC.2019100101-42","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.3.414"},{"key":"IJAEC.2019100101-43","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","author":"M.Mitchell","year":"1996","journal-title":"An Introduction to Genetic Algorithms"},{"key":"IJAEC.2019100101-44","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSIT.2009.5234668"},{"key":"IJAEC.2019100101-45","doi-asserted-by":"crossref","unstructured":"Narayanan, A., & Moore, M. (1996). Quantum-inspired genetic algorithms. In Proc. CEC (pp. 61-66). Academic Press.","DOI":"10.1109\/ICEC.1996.542334"},{"key":"IJAEC.2019100101-46","doi-asserted-by":"publisher","DOI":"10.2478\/v10175-012-0043-4"},{"key":"IJAEC.2019100101-47","doi-asserted-by":"crossref","unstructured":"Patvardhan, C., Narayan, A., & Srivastav, A. (2007). Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems. In Proceedings of the 2nd international conference on Pattern recognition and machine intelligencePReMI'07 (pp. 252-260). Springer-Verlag Berlin.","DOI":"10.1007\/978-3-540-77046-6_31"},{"key":"IJAEC.2019100101-48","doi-asserted-by":"publisher","DOI":"10.1504\/IJMOR.2012.046373"},{"key":"IJAEC.2019100101-49","doi-asserted-by":"crossref","unstructured":"Pelikan, M., Goldberg, D., & Lobo, F. (1999). A survey of optimization by building and using probabilistic model. IlliGAL.","DOI":"10.1109\/ACC.2000.879173"},{"key":"IJAEC.2019100101-50","author":"D.Pisinger","year":"1995","journal-title":"Algorithms for Knapsack Problems"},{"key":"IJAEC.2019100101-51","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00013-3"},{"key":"IJAEC.2019100101-52","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.5.758"},{"key":"IJAEC.2019100101-53","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00120-9"},{"key":"IJAEC.2019100101-54","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.03.002"},{"key":"IJAEC.2019100101-55","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.08.007"},{"key":"IJAEC.2019100101-56","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1050.0172"},{"key":"IJAEC.2019100101-57","unstructured":"Platel, M. D., Schliebs, S., & Kasabov, N. (2007). A versatile quantum-inspired evolutionary algorithm. In Proc. CEC (pp. 423-430). Academic Press."},{"key":"IJAEC.2019100101-58","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.2003010"},{"key":"IJAEC.2019100101-59","first-page":"196","article-title":"An artificial bee colony algorithm for the quadratic knapsack problem.","author":"S.Pulikanti","year":"2009","journal-title":"Proceedings of the International Conference on Neural Information Processing"},{"key":"IJAEC.2019100101-60","first-page":"151","article-title":"A comprehensive learning quantum-inspired evolutionary algorithm.","author":"Y.Qin","year":"2011","journal-title":"Proceedings of the International Conference on Information and Business Intelligence"},{"key":"IJAEC.2019100101-61","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0330"},{"key":"IJAEC.2019100101-62","doi-asserted-by":"publisher","DOI":"10.1049\/iet-gtd:20060495"},{"key":"IJAEC.2019100101-63","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIS.2008.4670952"},{"key":"IJAEC.2019100101-64","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.013"},{"key":"IJAEC.2019100101-65","doi-asserted-by":"publisher","DOI":"10.1007\/11539117_99"},{"key":"IJAEC.2019100101-66","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"IJAEC.2019100101-67","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.12.017"},{"key":"IJAEC.2019100101-68","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2007.368045"},{"key":"IJAEC.2019100101-69","unstructured":"Yang, S. Y., Wang, M., & Jiao, L. C. (2004a). A novel quantum evolutionary algorithm and its application. In Proc CEC (pp. 820-826). Academic Press."},{"key":"IJAEC.2019100101-70","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.11.023"},{"key":"IJAEC.2019100101-71","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9136-0"},{"key":"IJAEC.2019100101-72","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1007\/978-3-540-72458-2_61","article-title":"Parameter setting of quantum-inspired genetic algorithm based on real observation.","author":"G.Zhang","year":"2007","journal-title":"Proceedings of the International Conference on Rough Sets and Knowledge Technology"},{"issue":"1","key":"IJAEC.2019100101-73","first-page":"93","article-title":"A quantum-inspired evolutionary algorithm based on p systems for knapsack problem.","volume":"87","author":"G.Zhang","year":"2008"},{"key":"IJAEC.2019100101-74","doi-asserted-by":"publisher","DOI":"10.1007\/s11460-005-0014-8"},{"key":"IJAEC.2019100101-75","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2010.5584179"},{"key":"IJAEC.2019100101-76","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2007.4370753"},{"key":"IJAEC.2019100101-77","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, China (pp. 203-206). Academic Press."},{"key":"IJAEC.2019100101-78","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.03.001"},{"key":"IJAEC.2019100101-79","doi-asserted-by":"publisher","DOI":"10.1007\/11539902_17"}],"container-title":["International Journal of Applied Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=237972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T15:44:53Z","timestamp":1721749493000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAEC.2019100101"}},"subtitle":["A GPQIEA for Subset Selection"],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":80,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.4018\/ijaec.2019100101","relation":{},"ISSN":["1942-3594","1942-3608"],"issn-type":[{"value":"1942-3594","type":"print"},{"value":"1942-3608","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}