{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T02:31:41Z","timestamp":1730255501863,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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":[[2019,5]]},"DOI":"10.1109\/icra.2019.8794257","type":"proceedings-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T01:26:12Z","timestamp":1565659572000},"page":"4531-4537","source":"Crossref","is-referenced-by-count":7,"title":["A Heuristic for Task Allocation and Routing of Heterogeneous Robots while Minimizing Maximum Travel Cost"],"prefix":"10.1109","author":[{"given":"Jungyun","family":"Bae","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jungho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Woojin","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24769-9_8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.11.005"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.11.029"},{"key":"ref13","first-page":"650660","article-title":"A general vehicle routing problem","volume":"191","author":"asvin goel","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.3.267"},{"key":"ref15","first-page":"387","article-title":"A team ant colony optimization algorithm for the multiple travelling salesmen problem with minmax objective","author":"vallivaara","year":"2008","journal-title":"Proceedings of the 27th IASTED International Conference on Modelling Identification and Control ser MIC ’08"},{"key":"ref16","first-page":"87100","article-title":"A hierarchical market solution to the minmax multiple depots vehicle routing problem","volume":"2","author":"kivelevitch","year":"2011","journal-title":"Unmanned Systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SSRR.2005.1501232"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/2720630"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.10.010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619118"},{"journal-title":"Algorithms for multiple vehicle routing problems","year":"2014","author":"bae","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.nahs.2013.03.001"},{"key":"ref6","first-page":"31","article-title":"Solving min-max multi-depot vehicle routing problem","author":"carlsson","year":"2007","journal-title":"Lectures on Global Optimization"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.05.005"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s12541-018-0205-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s12541-017-0095-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.12.007"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICUAS.2015.7152311"},{"journal-title":"Approximation Algorithms","year":"2004","author":"vazirani","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.12.017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.09.029"},{"journal-title":"Shortest paths for the Reeds-Shepp car a worked out example of the use of geometric techniques in nonlinear optimal control","year":"1991","author":"sussmann","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1990.145.367"},{"journal-title":"IBM ILOG CPLEX Optimization Studio","year":"2017","key":"ref26"},{"year":"2009","key":"ref25"}],"event":{"name":"2019 International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2019,5,20]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2019,5,24]]}},"container-title":["2019 International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8780387\/8793254\/08794257.pdf?arnumber=8794257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:17:26Z","timestamp":1657855046000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8794257\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/icra.2019.8794257","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}