{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:41Z","timestamp":1725701681934},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"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,8]]},"DOI":"10.1109\/rcar47638.2019.9044008","type":"proceedings-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T03:20:28Z","timestamp":1585020028000},"page":"124-129","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient 2-opt Operator for the Robotic Task Sequencing Problem"],"prefix":"10.1109","author":[{"given":"Hong","family":"Li","sequence":"first","affiliation":[]},{"given":"Si-Yang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yan-Wei","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Yong-Quan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zhang-Hua","family":"Fu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2013.05.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.005"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2018.8665242"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-015-0190-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2556742"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISDA.2013.6920757"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCNT.2010.75"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CCAA.2015.7148514"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICWT.2018.8527878"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2010.938844"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","author":"applegate","year":"2007","journal-title":"The Traveling Salesman Problem A Computational Study"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460581"}],"event":{"name":"2019 IEEE International Conference on Real-time Computing and Robotics (RCAR)","start":{"date-parts":[[2019,8,4]]},"location":"Irkutsk, Russia","end":{"date-parts":[[2019,8,9]]}},"container-title":["2019 IEEE International Conference on Real-time Computing and Robotics (RCAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9034064\/9043918\/09044008.pdf?arnumber=9044008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:11:10Z","timestamp":1657854670000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9044008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/rcar47638.2019.9044008","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}