{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:01:27Z","timestamp":1780416087209,"version":"3.54.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004377","name":"Hong Kong Polytechnic University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004377","id-type":"DOI","asserted-by":"publisher"}]},{"name":"School of Electrical, Electronic and Computer Engineering"},{"name":"The University of Western Australia"},{"name":"Department of Manufacturing, Materials and Mechatronics, RMIT University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Ind. Inf."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/tii.2018.2889740","type":"journal-article","created":{"date-parts":[[2018,12,27]],"date-time":"2018-12-27T19:47:43Z","timestamp":1545940063000},"page":"2277-2287","source":"Crossref","is-referenced-by-count":30,"title":["An ACO-Based Tool-Path Optimizer for 3-D Printing Applications"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1450-3410","authenticated-orcid":false,"given":"Kai-Yin","family":"Fok","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3306-6148","authenticated-orcid":false,"given":"Chi-Tsun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7381-9493","authenticated-orcid":false,"given":"Nuwan","family":"Ganganath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0687-4038","authenticated-orcid":false,"given":"Herbert Ho-Ching","family":"Iu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chi K.","family":"Tse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/17452759.2013.830939"},{"key":"ref32","article-title":"GCodeAnalysor-1.1 by kyfok—Thingiverse","author":"fok","year":"2017"},{"key":"ref31","article-title":"Hole Test by magramo—Thingiverse","author":"flrez","year":"2018"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782657"},{"key":"ref34","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/M2VIP.2016.7827341"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2198665"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2416435"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2010.2048290"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/41.937403"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2011.2158836"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2440173"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCPMT.2014.2338791"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/07408170208928874"},{"key":"ref19","first-page":"241","author":"p\u00e9rez-delgado","year":"2010","journal-title":"Solving an Arc-routing Problem Using Artificial Ants with a Graph Transformation"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/opre.51.2.281.12790"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1108\/13552540610637255"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CyberC.2016.80"},{"key":"ref3","year":"2017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2011.06.010"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2015.2413355"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1108\/13552549610732034"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2015.7408327"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-014-6530-z"},{"key":"ref2","year":"2017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2655523"},{"key":"ref1","year":"15"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2007.914769"},{"key":"ref22","first-page":"326","article-title":"On the solutions to the travelling salesman problem using nature inspired computing techniques","volume":"8","author":"afaq","year":"2011","journal-title":"Int J Comput Sci Issues"},{"key":"ref21","first-page":"434","article-title":"Solving traveling salesman problem (TSP) using ants colony (ACO) algorithm and comparing with Tabu search, simulated annealing and genetic algorithm","volume":"8","author":"alhamdy","year":"2012","journal-title":"J Appl Sci Res"},{"key":"ref24","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"christofides","year":"1976"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322150"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.5784\/21-1-17"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"}],"container-title":["IEEE Transactions on Industrial Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9424\/8681658\/08590761.pdf?arnumber=8590761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:42:59Z","timestamp":1657744979000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8590761\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":34,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tii.2018.2889740","relation":{},"ISSN":["1551-3203","1941-0050"],"issn-type":[{"value":"1551-3203","type":"print"},{"value":"1941-0050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}