{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T04:41:55Z","timestamp":1751258515034,"version":"3.28.0"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"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,11]]},"DOI":"10.1109\/cis-ram47153.2019.9095547","type":"proceedings-article","created":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T21:09:55Z","timestamp":1589922595000},"page":"404-409","source":"Crossref","is-referenced-by-count":4,"title":["Planning Method of Near-Minimum-Time Task Tour for Industrial Point-to-Point Robot"],"prefix":"10.1109","author":[{"given":"Kosuke","family":"Nemoto","sequence":"first","affiliation":[]},{"given":"Yasumichi","family":"Aiyama","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"91","article-title":"Invitation to Traveling Salesman Problem II","volume":"39","author":"kubo","year":"1994","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"ref3","first-page":"25","article-title":"Invitation to Traveling Salesman Problem I","volume":"39","author":"kubo","year":"1994","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0205"},{"key":"ref5","first-page":"156","article-title":"Invitation to Traveling Salesman Problem III","volume":"39","author":"kubo","year":"1994","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"ref7","first-page":"965","article-title":"Local search Algorithm for Traveling Salesman Problem","author":"ye","year":"2013","journal-title":"Proc 2013 Nihon Univ Faculty of Sci and Engg Conf"},{"key":"ref2","first-page":"107","article-title":"Application of the Traveling Salesman Problem in Manufactoring industories","author":"mison","year":"1994","journal-title":"Proc 48th Annual Conf on Information Processing Society of Japan"},{"year":"2019","key":"ref1","article-title":"Travelling salesman problem"}],"event":{"name":"2019 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM)","start":{"date-parts":[[2019,11,18]]},"location":"Bangkok, Thailand","end":{"date-parts":[[2019,11,20]]}},"container-title":["2019 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9094049\/9095541\/09095547.pdf?arnumber=9095547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T14:48:27Z","timestamp":1658155707000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9095547\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/cis-ram47153.2019.9095547","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}