{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:09:02Z","timestamp":1740100142025,"version":"3.37.3"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100019370","name":"Foundation for Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019370","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,28]]},"DOI":"10.1109\/cec45853.2021.9504930","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T21:57:06Z","timestamp":1628546226000},"page":"1688-1695","source":"Crossref","is-referenced-by-count":1,"title":["A Multi-task Approach For Maximum Survival Ratio Problem In Large-Scale Wireless Rechargeable Sensor Networks"],"prefix":"10.1109","author":[{"given":"Le Van","family":"Cuong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tran","family":"Thi Huong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Thi","family":"Thanh Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/CEC48606.2020.9185750"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TMC.2020.2973979"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TSUSC.2020.3003014"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/JIOT.2019.2918837"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ACCESS.2019.2949284"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/2898357"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TVT.2015.2496971"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1016\/j.jnca.2018.02.017"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/j.asoc.2018.11.022"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.future.2017.09.051"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1126\/science.1143254"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1504\/IJAISC.2014.059280"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1016\/j.compeleceng.2014.06.009"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TNET.2018.2841420"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TMC.2017.2703094"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/GLOCOM.2018.8648027"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TNET.2017.2723605"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1007\/978-3-319-17656-7"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/WCNC45663.2020.9120800"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1201\/b13092"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.3390\/math9080864"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/j.knosys.2019.05.015"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/s10489-019-01599-x"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/978-3-030-29746-6_3"},{"key":"ref23","first-page":"1","article-title":"Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem","author":"binh","year":"2018","journal-title":"2018 IEEE Congress on Evolutionary Computation (CEC)"},{"key":"ref26","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"deb","year":"1995","journal-title":"Complex Systems"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1016\/j.ejor.2004.09.057"}],"event":{"name":"2021 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2021,6,28]]},"location":"Krak\u00f3w, Poland","end":{"date-parts":[[2021,7,1]]}},"container-title":["2021 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9504682\/9504683\/09504930.pdf?arnumber=9504930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:44:32Z","timestamp":1652197472000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9504930\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/cec45853.2021.9504930","relation":{},"subject":[],"published":{"date-parts":[[2021,6,28]]}}}