{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T12:21:03Z","timestamp":1768566063899,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2930638","type":"journal-article","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T20:32:06Z","timestamp":1563913926000},"page":"104982-104991","source":"Crossref","is-referenced-by-count":32,"title":["A Discrete Improved Artificial Bee Colony Algorithm for 0\u20131 Knapsack Problem"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4893-9565","authenticated-orcid":false,"given":"Song","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","first-page":"23","article-title":"Research on the algorithm for 0\/1 knapsack problem","volume":"5","author":"li","year":"2008","journal-title":"Digital Computer Engineering"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2008.02207"},{"key":"ref30","first-page":"25","article-title":"Nonlinear reductive dimension approximate algorithm for 0–1 knapsack problem","volume":"36","author":"zhao","year":"2007","journal-title":"J Inner Mongolia Normal Univ Natural Sci Ed"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SIS.2011.5952562"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.08.038"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INISTA.2012.6247029"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.08.049"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.104"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/129271"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2006.14.1.119"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.872133"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2014613"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2000.886461"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.05.001"},{"key":"ref27","first-page":"10","article-title":"Study of greedy-policy-based algorithm for 0\/1 knapsack problem","volume":"4","author":"you","year":"2007","journal-title":"Computer& Modernization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICIA.2006.305887"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/573731"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580448"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","article-title":"Solving 0–1 knapsack problem by a novel global harmony search algorithm","volume":"11","author":"zou","year":"2011","journal-title":"Appl Soft Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2013.09.052"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.02.010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/WGEC.2009.43"},{"key":"ref9","article-title":"An idea based on honey bee swarm for numerical optimization","author":"karaboga","year":"2005"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.927706"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826071"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826074"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2021465"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"key":"ref26","first-page":"10","article-title":"On the sequential combination tree algorithm for 0–1 knapsack problem","volume":"29","author":"an","year":"2008","journal-title":"J Ofwenzhou Univ Natural Sci"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2052054"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08769945.pdf?arnumber=8769945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:04:53Z","timestamp":1662667493000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8769945\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2930638","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}