{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T11:29:01Z","timestamp":1776338941896,"version":"3.51.2"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772344"],"award-info":[{"award-number":["61772344"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61732011"],"award-info":[{"award-number":["61732011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province of China","doi-asserted-by":"publisher","award":["2020B1515310008"],"award-info":[{"award-number":["2020B1515310008"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Educational Commission of Guangdong Province of China","award":["2019KZDZX1007"],"award-info":[{"award-number":["2019KZDZX1007"]}]},{"DOI":"10.13039\/501100009019","name":"Interdisciplinary Innovation Team of Shenzhen University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009019","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1109\/tevc.2021.3080683","type":"journal-article","created":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T22:22:02Z","timestamp":1621290122000},"page":"1133-1147","source":"Crossref","is-referenced-by-count":16,"title":["Set Theory-Based Operator Design in Evolutionary Algorithms for Solving Knapsack Problems"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2586-5604","authenticated-orcid":false,"given":"Ran","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zichao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23247-3_7"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-356-1.50016-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.07.045"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2507785"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969492"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.037"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90049-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90033-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-5764-9"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/0471394882.ch1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477916"},{"key":"ref27","first-page":"915","article-title":"An improved particle swarm optimization algorithm for solving 0–1 knapsack problem","author":"zhang","year":"2008","journal-title":"Proc Int Conf Mach Learn Cybern"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"ref2","first-page":"486","article-title":"On the partition of numbers","volume":"28","author":"mathews","year":"1987","journal-title":"Proc London Math Soc"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.07.006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.06.076"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477908"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2925358"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2925358"},{"key":"ref26","author":"xu","year":"2004","journal-title":"Computation Intelligence Simulation Evolutionary Computation"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2918140"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9249-2"},{"key":"ref51","article-title":"Heuristic and exact algorithms for discounted knapsack problems","author":"guldan","year":"2007"},{"key":"ref52","author":"chen","year":"1995","journal-title":"Genetic algorithms and its applications"},{"key":"ref10","author":"martello","year":"1990","journal-title":"Knapsack Problems Algorithms and Computer Implementations"},{"key":"ref11","first-page":"2655","article-title":"Greedy genetic algorithm for solving knapsack problems and its application","volume":"28","author":"he","year":"2007","journal-title":"Comput Eng Design"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2000.886461"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.07.013"},{"key":"ref13","first-page":"1","article-title":"A novel multi-mutation binary particle swarm optimization for 0\/1 knapsack problem","author":"li","year":"2009","journal-title":"Proc Chin Control Decis Conf"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2017.7969524"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2017.07.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2015.01.010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"ref3","first-page":"843","article-title":"NUMBERS: The language of science","volume":"77","author":"stephenson","year":"1931","journal-title":"Brit J Psychiat"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2546340"},{"key":"ref5","first-page":"1586","article-title":"A genetic algorithm for the unbounded knapsack problem","author":"k -l -li","year":"2003","journal-title":"Proc Int Conf Mach Learn Cybern"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2940538"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113224"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/4235.887234"},{"key":"ref9","first-page":"2614","article-title":"Research on genetic algorithms for the discounted 0–1 knapsack problem","volume":"38","author":"he","year":"2016","journal-title":"Chin J Comput"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.047"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281502"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.019"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TCSET.2016.7452101"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.915539"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688593"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.11.025"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2163638"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/9629433\/09432406.pdf?arnumber=9432406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:51:17Z","timestamp":1652194277000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9432406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":52,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2021.3080683","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]}}}