{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:05:15Z","timestamp":1725753915169},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"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,3]]},"DOI":"10.1109\/rivf.2019.8713655","type":"proceedings-article","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:27:30Z","timestamp":1558027650000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Metaheuristic for the Traveling Repairman Problem with Time Window Constraints"],"prefix":"10.1109","author":[{"given":"Ha Bang","family":"Ban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duc Nghia","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1050.0145"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-011-0153-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.03.044"},{"key":"ref13","first-page":"215","author":"johnson","year":"0","journal-title":"The traveling salesman problem A case study in local optimization in Local Search in Combinatorial Optimization"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.09.009"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195125"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2017-1596"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.11.015"},{"key":"ref7","first-page":"152","article-title":"An improved approximation ratio for the minimum latency problem","author":"goemans","year":"1996","journal-title":"Proc SIAM SODA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2201\/NiiPi.2013.10.10"},{"key":"ref1","first-page":"9","article-title":"Improved genetic algorithm for minimum latency problem","author":"ban","year":"2010","journal-title":"Proc SOICT"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"}],"event":{"name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","start":{"date-parts":[[2019,3,20]]},"location":"Danang, Vietnam","end":{"date-parts":[[2019,3,22]]}},"container-title":["2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8705149\/8713612\/08713655.pdf?arnumber=8713655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:18:40Z","timestamp":1658247520000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8713655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/rivf.2019.8713655","relation":{},"subject":[],"published":{"date-parts":[[2019,3]]}}}