{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T21:53:08Z","timestamp":1730238788191,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/icdim.2017.8244657","type":"proceedings-article","created":{"date-parts":[[2018,1,9]],"date-time":"2018-01-09T21:18:26Z","timestamp":1515532706000},"page":"21-26","source":"Crossref","is-referenced-by-count":0,"title":["Shortest path deliveries using density-based clustering"],"prefix":"10.1109","author":[{"given":"Lixin","family":"Fu","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"125","article-title":"A hybrid search method for the vehicle routing problem with time windows","volume":"180","author":"de oliveira","year":"2008","journal-title":"Annals of Operations Research"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.10.014"},{"key":"ref12","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"christofides","year":"1976","journal-title":"Report 388"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2818310"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2014.13"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.5220\/0005353500970107"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2016.0075"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(88)90002-0"},{"key":"ref5","first-page":"523","article-title":"Optimization by simulated annealing: A preliminary computational study for the TSP","volume":"2","author":"ski?cim","year":"1983","journal-title":"Proceedings of the 15th conference on Winter Simulation-Volume 2 (WSC '83)"},{"journal-title":"The Vehicle Routing Problem","year":"2002","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3758\/BF03211820"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"journal-title":"The Traveling Salesman Problem A Computational Study","year":"2006","author":"applegate","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"}],"event":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","start":{"date-parts":[[2017,9,12]]},"location":"Fukuoka","end":{"date-parts":[[2017,9,14]]}},"container-title":["2017 Twelfth International Conference on Digital Information Management (ICDIM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8231152\/8244639\/08244657.pdf?arnumber=8244657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,26]],"date-time":"2018-01-26T10:22:25Z","timestamp":1516962145000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8244657\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/icdim.2017.8244657","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}