{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:08:50Z","timestamp":1730232530557,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T00:00:00Z","timestamp":1718668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T00:00:00Z","timestamp":1718668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,18]]},"DOI":"10.1109\/icca62789.2024.10591802","type":"proceedings-article","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T17:19:13Z","timestamp":1721927953000},"page":"785-790","source":"Crossref","is-referenced-by-count":0,"title":["Research on Collaborative Task Planning Method for Split Delivery Vehicle Routing Problem"],"prefix":"10.1109","author":[{"given":"Jia","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Automation, Beijing Institute of Technology,Beijing,China,100081"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Hong","sequence":"additional","affiliation":[{"name":"School of Automation, Beijing Institute of Technology,Beijing,China,100081"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qichen","family":"Dong","sequence":"additional","affiliation":[{"name":"School of Automation, Beijing Institute of Technology,Beijing,China,100081"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnlssr.2023.06.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.123691"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800370304"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1100.0363"},{"issue":"2","key":"ref5","first-page":"668","article-title":"Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost[J]","volume":"51","author":"Luo","year":"2014","journal-title":"Computer Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2011.00811.x"},{"issue":"1","key":"ref7","first-page":"96","article-title":"Research on Vehicle Routing Problem with Split Delivery: Literature Review[J]","volume":"36","author":"Liu","year":"2017","journal-title":"Technology Economics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2014.11.002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12250"},{"issue":"4","key":"ref10","first-page":"328","article-title":"Enhanced Evolutionary Local Search for the Split Delivery Vehicle Routing Problem[J]","volume":"4","author":"An","year":"2017","journal-title":"Kharazmi University"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICSAI48974.2019.9010082"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3020728"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107720"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3390\/en15103546"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1504\/IJLSM.2023.131421"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2022.0085"},{"issue":"1","key":"ref17","first-page":"57","article-title":"Discussing the Timeliness Value of Earthquake Rescue in Disaster Relief [J]","volume":"29","author":"He","year":"2009","journal-title":"Chinese Journal of Critical Care Medicine"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.23.2.141"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0084"},{"issue":"11","key":"ref20","first-page":"2553","article-title":"Solving watt-hour meter distribution vehicle routing problem based on hybrid simulated annealing algorithm[J]","volume":"23","author":"Qian","year":"2017","journal-title":"Computer Integrated Manufacturing Systems"},{"issue":"11","key":"ref21","first-page":"77","article-title":"Simulated Annealing with Variable Neighborhood for Time-Dependent Vehicle Routing Problem with Time Window [J]","volume":"28","author":"Zhang","year":"2019","journal-title":"Operations Research and Management Science"},{"issue":"5","key":"ref22","first-page":"78","article-title":"A Tabu Search Algorithm for the Vehicle Routing Problem with Soft Time Windows and Split Deliveries by Order[J]","volume":"25","author":"Zhuo","year":"2017","journal-title":"Chinese Journal of Management Science"}],"event":{"name":"2024 IEEE 18th International Conference on Control & Automation (ICCA)","start":{"date-parts":[[2024,6,18]]},"location":"Reykjav\u00edk, Iceland","end":{"date-parts":[[2024,6,21]]}},"container-title":["2024 IEEE 18th International Conference on Control & Automation (ICCA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10591777\/10591797\/10591802.pdf?arnumber=10591802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T05:18:32Z","timestamp":1721971112000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10591802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,18]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icca62789.2024.10591802","relation":{},"subject":[],"published":{"date-parts":[[2024,6,18]]}}}