{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:21:32Z","timestamp":1778592092068,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,20]],"date-time":"2015-08-20T00:00:00Z","timestamp":1440028800000},"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":["Neural Process Lett"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11063-015-9465-y","type":"journal-article","created":{"date-parts":[[2015,8,19]],"date-time":"2015-08-19T10:20:19Z","timestamp":1439979619000},"page":"407-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["A Complex-valued Encoding Bat Algorithm for Solving 0\u20131 Knapsack Problem"],"prefix":"10.1007","volume":"44","author":[{"given":"Yongquan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liangliang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingzhi","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,20]]},"reference":[{"key":"9465_CR1","volume-title":"Knapsack problems","author":"H Kellerer","year":"2005","unstructured":"Kellerer H, Pferschy U, Pisinger D (2005) Knapsack problems. Springer, Berlin"},{"key":"9465_CR2","doi-asserted-by":"crossref","unstructured":"Shen W, Xu B, Huang J (2011) An improved genetic algorithm for 0-1 knapsack problems. In: Second international conference on networking and distributed computing (ICNDC), pp 32\u201335","DOI":"10.1109\/ICNDC.2011.14"},{"issue":"1","key":"9465_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ejor.2006.12.046","volume":"185","author":"F-T Lin","year":"2008","unstructured":"Lin F-T (2008) Solving the knapsack problem with imprecise weight coefficients using genetic algorithms. Eur J Oper Re 185(1):133\u2013145","journal-title":"Eur J Oper Re"},{"issue":"11","key":"9465_CR4","first-page":"2656","volume":"28","author":"Y He","year":"2007","unstructured":"He Y, Liu K, Zhang C, Zhang W (2007) Greedy genetic algorithm for solving knapsack problems and its applications. Comput Eng Des 28(11):2656\u20132657","journal-title":"Comput Eng Des"},{"key":"9465_CR5","doi-asserted-by":"crossref","unstructured":"Shi H (2006) Solution to 0\/1 knapsack problem based on improved ant colony algorithm. In: IEEE international conference on information acquisition, pp 1062\u20131066","DOI":"10.1109\/ICIA.2006.305887"},{"key":"9465_CR6","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of the IEEE international conference on neural networks. IEEE Press, Piscataway, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"9465_CR7","unstructured":"Li ZK, Li N (2009) A novel multi-mutation binary particle swarm optimization for 0\/1 knapsack problem. In: Control and decision conference, pp 3042\u20133047"},{"issue":"11","key":"9465_CR8","first-page":"32","volume":"22","author":"X LI","year":"2002","unstructured":"LI X, SHAO Z, QIAN J (2002) An Optimizing method based on autonomous animals: fish-swarm algorithm. Syst Eng-Theory Pract 22(11):32\u201338","journal-title":"Syst Eng-Theory Pract"},{"key":"9465_CR9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.swevo.2013.09.002","volume":"14","author":"MAK Azada","year":"2014","unstructured":"Azada MAK, Rocha AMAC, Fernandes EMGP (2014) Improved binary artificial fish swarm algorithm for the 0\u20131 multidimensional knapsack problems. Swarm Evol Comput 14:66\u201375","journal-title":"Swarm Evol Comput"},{"key":"9465_CR10","doi-asserted-by":"crossref","unstructured":"Yang XS (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010), pp 65\u201374","DOI":"10.1007\/978-3-642-12538-6_6"},{"issue":"5","key":"9465_CR11","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1108\/02644401211235834","volume":"29","author":"XS Yang","year":"2012","unstructured":"Yang XS, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization. Eng Comput 29(5):464\u2013483","journal-title":"Eng Comput"},{"key":"9465_CR12","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Appl Soft Comput 11:1556\u20131564","journal-title":"Appl Soft Comput"},{"key":"9465_CR13","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1007\/s00521-012-1028-9","volume":"22","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yang X-S, Alavi AH (2013) Bat algorithm for constrained optimization tasks. Neural Comput Appl 22:1239\u20131255","journal-title":"Neural Comput Appl"},{"key":"9465_CR14","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.jocs.2013.10.002","volume":"5","author":"AH Gandomi","year":"2014","unstructured":"Gandomi AH, Yang X-S (2014) Chaotic bat algorithm. J Comput Sci 5:224\u2013232","journal-title":"J Comput Sci"},{"issue":"12","key":"9465_CR15","doi-asserted-by":"crossref","first-page":"4831","DOI":"10.1016\/j.cnsns.2012.05.010","volume":"17","author":"AH Gandomi","year":"2012","unstructured":"Gandomi AH, Alavi AH (2012) Krill Herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831\u20134845","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"9465_CR16","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1016\/j.asoc.2012.11.048","volume":"13","author":"TK Truong","year":"2013","unstructured":"Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0\u20131 knapsack problem. Appl Soft Comput 13:1774\u20131780","journal-title":"Appl Soft Comput"},{"issue":"4","key":"9465_CR17","first-page":"50","volume":"48","author":"Z Li","year":"2012","unstructured":"Li Z, MA L, Zhang H (2012) Genetic mutation bat algorithm for 0\u20131 knapsack problem. Comput Eng Appl 48(4):50\u201353","journal-title":"Comput Eng Appl"},{"issue":"10","key":"9465_CR18","first-page":"59","volume":"45","author":"D Chen","year":"2009","unstructured":"Chen D, Li H, Li Z (2009) Particle swarm optimization based on complex-valued encoding and application in function optimization. Comput Eng Appl 45(10):59\u201361","journal-title":"Comput Eng Appl"},{"issue":"1","key":"9465_CR19","first-page":"97","volume":"20","author":"Z Zheng","year":"2003","unstructured":"Zheng Z, Zhang Y, Qiu Y (2003) Genetic algorithm based on complex-valued encoding. Control Theory Appl 20(1):97\u2013100","journal-title":"Control Theory Appl"},{"issue":"1","key":"9465_CR20","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das S, Suganthan PN (2011) Differential evolution: a survey of the state-of-the-art. IEEE Trans Evol Comput 15(1):4\u201331","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-015-9465-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11063-015-9465-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-015-9465-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:34:11Z","timestamp":1559363651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11063-015-9465-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,20]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9465"],"URL":"https:\/\/doi.org\/10.1007\/s11063-015-9465-y","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"value":"1370-4621","type":"print"},{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,20]]}}}