{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:24Z","timestamp":1740107844724,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00500-015-1880-5","type":"journal-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T06:00:22Z","timestamp":1443679222000},"page":"1765-1784","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards the right amount of randomness in quantum-inspired evolutionary algorithms"],"prefix":"10.1007","volume":"21","author":[{"given":"C.","family":"Patvardhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4993-8879","authenticated-orcid":false,"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,10,1]]},"reference":[{"key":"1880_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford"},{"key":"1880_CR2","unstructured":"Billionet A, Soutif E (2004) QKP instances. [Online] http:\/\/cedric.cnam.fr\/soutif\/QKP\/QKP.html . Accessed 15 February 2013"},{"issue":"2","key":"1880_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1999","unstructured":"Caprara A, Pisinger D, Toth P (1999) Exact solution of the quadratic knapsack problem. Inf J Comput 11(2):125\u2013137","journal-title":"Inf J Comput"},{"key":"1880_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(93)90097-7","volume":"69","author":"G Dijkhuijen","year":"1993","unstructured":"Dijkhuijen G, Faigle U (1993) A cutting-plane approach to he edge-weighted maximal clique problem. Eur J Oper Res 69:121\u2013130","journal-title":"Eur J Oper Res"},{"key":"1880_CR5","unstructured":"Engebretsen L, Holmerin J (2000) Clique is hard to approximate within n1-o(1). In: Proceedings of 27th international colloquium, ICALP 2000, vol 1853. Springer, Berlin, pp 2\u201312"},{"key":"1880_CR6","first-page":"247","volume":"74","author":"CE Ferreira","year":"1996","unstructured":"Ferreira CE, Martin A, deSouza CC (1996) Formulations and valid inequalities for node capacitated graph partitioning. Math Program 74:247\u2013266","journal-title":"Math Program"},{"key":"1880_CR7","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G Gallo","year":"1980","unstructured":"Gallo G, Hammer P, Simeone B (1980) Quadratic knapsack problems. Math Program Study 12:132\u2013149","journal-title":"Math Program Study"},{"key":"1880_CR8","unstructured":"Han K-H (2006) On the analysis of the quantum-inspired evolutionary algorithm with a single individual. In: Proceedings of CEC\u201906, Vancouver, Canada, pp 2622\u20132629"},{"issue":"6","key":"1880_CR9","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"K-H Han","year":"2002","unstructured":"Han K-H, Kim J-H (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evolut Comput 6(6):580\u2013593","journal-title":"IEEE Trans Evolut Comput"},{"key":"1880_CR10","unstructured":"Han K-H, Kim J-H (2003) On setting the parameters of quantum-inspired evolutionary algorithm for practical application. In: Proceedings of CEC 2003, vol 1, pp 178\u2013194"},{"issue":"2","key":"1880_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1109\/TEVC.2004.823467","volume":"8","author":"K-H Han","year":"2004","unstructured":"Han K-H, Kim J-H (2004) Quantum-inspired evolutionary algorithms with a new termination criterion, h-epsilon gate, and two-phase scheme. IEEE Trans Evolut Comput 8(2):156\u2013169","journal-title":"IEEE Trans Evolut Comput"},{"key":"1880_CR12","unstructured":"Han K, Park K, Lee C, Kim J (2001) Parallel quantum-inspired genetic algorithm for combinatorial optimization problem. In: Proceedings of CEC 2001, vol 2, pp 1422\u20131429"},{"key":"1880_CR13","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":"1880_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E Johnson","year":"1993","unstructured":"Johnson E, Mehrotra A, Nemhauser G (1993) Min-cut clustering. Math Program 62:133\u2013151","journal-title":"Math Program"},{"key":"1880_CR15","doi-asserted-by":"crossref","unstructured":"Julstorm BA (2005) Greedy, genetic and greedy genetic algorithms for the quadratic knapsack problem. In: Proceedings of GECCO 2005, Washingtom DC, USA, pp 607\u2013614","DOI":"10.1145\/1068009.1068111"},{"key":"1880_CR16","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, Berlin"},{"key":"1880_CR17","unstructured":"Kim Y, Kim JH, Han KH (2006) Quantum-inspired multiobjective evolutionary algorithm for multiobjective 0\/1 knapsack problems. In: Proceedings of CEC 2006, pp 2601\u20132606"},{"key":"1880_CR18","doi-asserted-by":"crossref","unstructured":"Laghhunn DL (1970) Quadratic binary programming with applications to capital budgetting problems. Oper Res 18:454\u2013461","DOI":"10.1287\/opre.18.3.454"},{"key":"1880_CR19","doi-asserted-by":"crossref","first-page":"1843","DOI":"10.1016\/j.camwa.2008.10.046","volume":"57","author":"Z Li","year":"2009","unstructured":"Li Z, Rudolph G, Li K (2009) Convergence performance comparison of quantum-inspired multi-objective evolutionary algorithms. Comput Math Appl 57:1843\u20131854","journal-title":"Comput Math Appl"},{"key":"1880_CR20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ins.2013.04.018","volume":"243","author":"TC Lu","year":"2013","unstructured":"Lu TC, Yu GR (2013) An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0\/1 knapsack problems. Inf Sci 243:39\u201356","journal-title":"Inf Sci"},{"key":"1880_CR21","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 GECCO \u201908, pp 613\u2013614","DOI":"10.1145\/1389095.1389218"},{"issue":"2","key":"1880_CR22","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 Pol Acad Sci Tech Sci 60(2):323\u2013330","journal-title":"Bull Pol Acad Sci Tech Sci"},{"key":"1880_CR23","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","volume":"95","author":"K Park","year":"1996","unstructured":"Park K, Lee K, Park S (1996) An extended formulation approach to the edge weighted maximal cliqur problem. Eur J Oper Res 95:671\u2013682","journal-title":"Eur J Oper Res"},{"key":"1880_CR24","doi-asserted-by":"crossref","unstructured":"Patvardhan C, Narayan A, Srivastav A (2007) Enhanced quantum evolutionary algorithms for difficult knapsack problems. In: Proceedings of PReMI\u201907. Springer, Berlin, pp 252\u2013260","DOI":"10.1007\/978-3-540-77046-6_31"},{"issue":"2","key":"1880_CR25","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1504\/IJMOR.2012.046373","volume":"4","author":"C Patvardhan","year":"2012","unstructured":"Patvardhan C, Prakash P, Srivastav A (2012) A novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. Int J Math Oper Res 4(2):114\u2013127","journal-title":"Int J Math Oper Res"},{"issue":"1","key":"1880_CR26","doi-asserted-by":"crossref","first-page":"52","DOI":"10.4018\/ijaec.2014010104","volume":"5","author":"C Patvardhan","year":"2014","unstructured":"Patvardhan C, Bansal S, Srivastav A (2014a) Solution of \u201cHard\u201d knapsack instances using quantum inspired evolutionary algorithm. Int J Appl Evolut Comput 5(1):52\u201368","journal-title":"Int J Appl Evolut Comput"},{"key":"1880_CR27","first-page":"1","volume":"11","author":"C Patvardhan","year":"2014","unstructured":"Patvardhan C, Bansal S, Srivastav A (2014b) Balanced quantum-inspired evolutionary algorithm for multiple knapsack problem. Int J Intell Syst Appl 11:1\u201311","journal-title":"Int J Intell Syst Appl"},{"key":"1880_CR28","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger D (2007) The quadratic knapsack problem\u2014a survey. Discrete Appl Math 155:623\u2013648","journal-title":"Discrete Appl Math"},{"key":"1880_CR29","unstructured":"Platel M D, Schliebs S, Kasabov N (2007) A versatile quantum-inspired evolutionary algorithm. In: Proceedings of CEC\u201907, pp 423\u2013430"},{"issue":"6","key":"1880_CR30","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 Evolut Comput 13(6):1218\u20131232","journal-title":"IEEE Trans Evolut Comput"},{"key":"1880_CR31","doi-asserted-by":"crossref","unstructured":"Qin Y, Zhang G, Li Y, Zhang H (2012) A comprehensive learning quantum-inspired evolutionary algorithm. In: Qu X, Yang Y (eds) LNCS, IBI 2011, Part-II, CCIS 268, pp 151\u2013157","DOI":"10.1007\/978-3-642-29087-9_22"},{"key":"1880_CR32","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","volume":"17","author":"J Rhys","year":"1970","unstructured":"Rhys J (1970) A selection problem of shared fixed costs and network flows. Manag Sci 17:200\u2013207","journal-title":"Manag Sci"},{"key":"1880_CR33","doi-asserted-by":"crossref","unstructured":"Tayarani-N M-H, Akbarzadeh-T M-R (2008) A sinusoid size ring structure quantum evolutionary algorithm. In: Proceedings of IEEE conference on cybernetics and intelligent systems, pp 1165\u20131170","DOI":"10.1109\/ICCIS.2008.4670952"},{"key":"1880_CR34","doi-asserted-by":"crossref","unstructured":"Witzall C (1975) Mathematical methods of site selection for electronic message system (EMS). In: Technical report, NBS internal report Washington, DC. Operational Research Section","DOI":"10.6028\/NBS.IR.75-737"},{"key":"1880_CR35","doi-asserted-by":"crossref","unstructured":"Xie X, Liu J (2007) A mini-swarm for the quadratic knapsack problem. In: Proceedings of IEEE swarm intelligence symposium, Honolulu, USA, pp 190\u2013197","DOI":"10.1109\/SIS.2007.368045"},{"issue":"1","key":"1880_CR36","first-page":"93","volume":"87","author":"G Zhang","year":"2008","unstructured":"Zhang G, 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"},{"issue":"3","key":"1880_CR37","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":"1880_CR38","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/s11047-012-9320-2","volume":"11","author":"G Zhang","year":"2012","unstructured":"Zhang G, Gheorghe M, Li Y (2012) A membrane algorithm with quantum-inspired subalgorithms and its application to image processing. Nat Comput 11:701\u2013707","journal-title":"Nat Comput"},{"key":"1880_CR39","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, Hangzho, pp 203\u2013206"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1880-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1880-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1880-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1880-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T14:14:19Z","timestamp":1653228859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1880-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,1]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1880"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1880-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2015,10,1]]}}}