{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:38Z","timestamp":1750220858672,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T00:00:00Z","timestamp":1569542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Research, Technology and Higher Education of the Republic of Indonesia","award":["NKB-1782\/UN2.R3.1\/HKP.05.00\/2019"],"award-info":[{"award-number":["NKB-1782\/UN2.R3.1\/HKP.05.00\/2019"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,9,27]]},"DOI":"10.1145\/3364335.3364388","type":"proceedings-article","created":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T13:35:31Z","timestamp":1574343331000},"page":"87-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Composite Algorithm Based on Clarke - Wright and Local Search for the Traveling Salesman Problem"],"prefix":"10.1145","author":[{"family":"Komarudin","sequence":"first","affiliation":[{"name":"Universitas Indonesia, Depok, Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandiego F.","family":"Parhusip","sequence":"additional","affiliation":[{"name":"Universitas Indonesia, Depok, Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"e_1_3_2_1_2_1","unstructured":"Hougardy S. & Schroeder R. T. (2013.). Edge Elimination in TSP Instances 1--14  Hougardy S. & Schroeder R. T. (2013.). Edge Elimination in TSP Instances 1--14"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1033004"},{"volume-title":"Hybrid Algorithm Based on Chemical Reaction Optimization and Lin-Kernighan Local Search for the Traveling Salesman Problem. 2011 Seventh International Conference on Natural Computation, 3, 1518--1521","year":"2011","author":"Sun J.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.04.052"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00033-I"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.07.006"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2008.01.023"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2003.11.008"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.03.010"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.1.82.15157"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"M. Gendreau A. Hertz G. Laporte New insertion and 0post-optimization procedures for the traveling salesman problem Oper. Res. 40(1992)1086--1094.  M. Gendreau A. Hertz G. Laporte New insertion and 0post-optimization procedures for the traveling salesman problem Oper. Res. 40(1992)1086--1094.","DOI":"10.1287\/opre.40.6.1086"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_2_1_15_1","unstructured":"Wright J. W. (1962). Scheduling of vehicles from a central depot to a number of delivery points 6  Wright J. W. (1962). Scheduling of vehicles from a central depot to a number of delivery points 6"},{"key":"e_1_3_2_1_16_1","unstructured":"Rohe Andre. (2013 May 2013). VLSI Data Sets. Retrieved from http:\/\/www.math.uwaterloo.ca\/tsp\/vlsi\/index.html  Rohe Andre. (2013 May 2013). VLSI Data Sets. Retrieved from http:\/\/www.math.uwaterloo.ca\/tsp\/vlsi\/index.html"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Dumitrescu A. & Mitchell J. S. (2003). Approximation algorithms for TSP with neighborhoods in the plane. Journal of Algorithms 48(1) 135--159.  Dumitrescu A. & Mitchell J. S. (2003). Approximation algorithms for TSP with neighborhoods in the plane. Journal of Algorithms 48(1) 135--159.","DOI":"10.1016\/S0196-6774(03)00047-6"},{"issue":"1","key":"e_1_3_2_1_18_1","first-page":"95","article-title":"(2018)","volume":"1","author":"Tin","journal-title":"Efficient Recombination in the Salesman Heuristic"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Wang Y. & Remmel J. B. (2018). An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution Eliminating edges for TSP 4470--4484.  Wang Y. & Remmel J. B. (2018). An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution Eliminating edges for TSP 4470--4484.","DOI":"10.1007\/s10489-018-1222-2"}],"event":{"name":"ICIBE 2019: 2019 The 5th International Conference on Industrial and Business Engineering","sponsor":["The Hong Kong Polytechnic The Hong Kong Polytechnic University"],"location":"Hong Kong Hong Kong","acronym":"ICIBE 2019"},"container-title":["Proceedings of the 2019 5th International Conference on Industrial and Business Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3364335.3364388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3364335.3364388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:29Z","timestamp":1750202609000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3364335.3364388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,27]]},"references-count":19,"alternative-id":["10.1145\/3364335.3364388","10.1145\/3364335"],"URL":"https:\/\/doi.org\/10.1145\/3364335.3364388","relation":{},"subject":[],"published":{"date-parts":[[2019,9,27]]},"assertion":[{"value":"2019-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}