{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T01:35:28Z","timestamp":1769304928998,"version":"3.49.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T00:00:00Z","timestamp":1721952000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,26]]},"DOI":"10.1109\/iotaai62601.2024.10692621","type":"proceedings-article","created":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T18:15:36Z","timestamp":1727892936000},"page":"610-613","source":"Crossref","is-referenced-by-count":1,"title":["Ant-antlion Optimizer for Multi-objective Knapsack Problem"],"prefix":"10.1109","author":[{"given":"Yi","family":"Liu","sequence":"first","affiliation":[{"name":"Advanced Institute of Big Data, Beijing,Beijing,China"}]},{"given":"Yangsen","family":"Zhou","sequence":"additional","affiliation":[{"name":"Advanced Institute of Big Data, Beijing,Beijing,China"}]},{"given":"Qibin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Advanced Institute of Big Data, Beijing,Beijing,China"}]},{"given":"Guoli","family":"Yang","sequence":"additional","affiliation":[{"name":"Advanced Institute of Big Data, Beijing,Beijing,China"}]},{"given":"Kun","family":"Liu","sequence":"additional","affiliation":[{"name":"Advanced Institute of Big Data, Beijing,Beijing,China"}]},{"given":"Wei","family":"Qin","sequence":"additional","affiliation":[{"name":"Advanced Institute of Big Data, Beijing,Beijing,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105693"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-19-6581-4_32"},{"key":"ref3","first-page":"259","article-title":"Multi-objective baby search algorithm","volume-title":"2023 International Conference on Swarm Intelligence (ICSI 2023)","author":"Yi"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2020edl8055"},{"key":"ref5","volume-title":"SPEA2: improving the strength Pareto evolutioanry algorithm","author":"Zitzler","year":"2001"},{"issue":"1","key":"ref6","first-page":"27","article-title":"Flower pollination optimization for the multi-objective knapsack problem","volume":"9","author":"Yuta","year":"2020","journal-title":"Bulletin of Networking, Computing, Systems, and Software."},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1927","DOI":"10.1007\/s00500-019-04023-1","article-title":"Integer cat swarm optimization algorithm for multi-objective integer problems","volume":"24","author":"Shahid","year":"2020","journal-title":"Soft Computing."},{"issue":"1","key":"ref8","first-page":"260","article-title":"Solving single and multi-objective 01 knapsack problem using harmony search algorithm","volume":"64","author":"Amol","year":"2020","journal-title":"Journal of Scientific Research."},{"key":"ref9","first-page":"51","article-title":"A mixed-factor evolutionary algorithm for multi-objective knapsack problem","volume-title":"18th International Conference on Intelligent Computing Theories and Application","author":"Yanlian"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CEC55065.2022.9870377"},{"issue":"2","key":"ref11","first-page":"44","article-title":"Design of cooperative openmp-based metaheuristic approach for multi-objective knapsack problem","volume":"15","author":"Imen","year":"2021","journal-title":"IADIS International Journal on Computer Science and Information Systems."},{"key":"ref12","doi-asserted-by":"crossref","first-page":"107049","DOI":"10.1016\/j.knosys.2021.107049","article-title":"A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems","volume":"223","author":"Qinghua","year":"2021","journal-title":"Knowledge-Based Systems."},{"key":"ref13","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s12293-021-00344-7","article-title":"Solving binary multi-objective knapsack problems with novel greedy strategy","volume":"13","author":"Jiawei","year":"2021","journal-title":"Memetic Computing."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CANDARW57323.2022.00015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.5220\/0010865600003116"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1004388"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.procs.2015.08.165","article-title":"Indicator based ant colony optimization for multi-objective knapsack problem","volume":"60","author":"Imen","year":"2015","journal-title":"Procedia Computer Science."},{"issue":"24","key":"ref19","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1049\/el.2019.1933","article-title":"Ant colony optimisation algorithm for multi-objective subset selection problems","volume":"55","author":"Yi","year":"2019","journal-title":"Electronics Letters."}],"event":{"name":"2024 6th International Conference on Internet of Things, Automation and Artificial Intelligence (IoTAAI)","location":"Guangzhou, China","start":{"date-parts":[[2024,7,26]]},"end":{"date-parts":[[2024,7,28]]}},"container-title":["2024 6th International Conference on Internet of Things, Automation and Artificial Intelligence (IoTAAI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10691949\/10692319\/10692621.pdf?arnumber=10692621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T06:04:55Z","timestamp":1727935495000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10692621\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,26]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/iotaai62601.2024.10692621","relation":{},"subject":[],"published":{"date-parts":[[2024,7,26]]}}}