{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:28Z","timestamp":1750306168939,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,9,26]],"date-time":"2016-09-26T00:00:00Z","timestamp":1474848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,9,26]]},"DOI":"10.1145\/2987491.2987525","type":"proceedings-article","created":{"date-parts":[[2016,10,11]],"date-time":"2016-10-11T18:16:29Z","timestamp":1476209789000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolving Construction Heuristics for the Symmetric Travelling Salesman Problem"],"prefix":"10.1145","author":[{"given":"Nomzamo","family":"Ntombela","sequence":"first","affiliation":[{"name":"School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Pietermaritzburg, South Africa"}]},{"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[{"name":"School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Pietermaritzburg, South Africa"}]}],"member":"320","published-online":{"date-parts":[[2016,9,26]]},"reference":[{"key":"e_1_3_2_1_1_1","article-title":"A comparative study between the nearest neighbour and genetic algorithms: A revisit to the traveling salesman problem","author":"Alsalibi B. A.","year":"2013","unstructured":"B. A. Alsalibi , M. B. Jelodar , and I. Venkat . A comparative study between the nearest neighbour and genetic algorithms: A revisit to the traveling salesman problem . International Journal of Computer Science and Electronics Engineering, 34--38 , 2013 . B. A. Alsalibi, M. B. Jelodar, and I. Venkat. A comparative study between the nearest neighbour and genetic algorithms: A revisit to the traveling salesman problem. International Journal of Computer Science and Electronics Engineering, 34--38, 2013.","journal-title":"International Journal of Computer Science and Electronics Engineering, 34--38"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-009-0022-y"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2429314"},{"issue":"10","key":"e_1_3_2_1_5_1","first-page":"1524","article-title":"Implementation of heuristics for solving travelling salesman problem using nearest neighbour and minimum spanning tree algorithms. International Journal of Mathematical, Computational, Physical","volume":"7","author":"Karkory F. A.","year":"2013","unstructured":"F. A. Karkory and A. A. Abudalmola . Implementation of heuristics for solving travelling salesman problem using nearest neighbour and minimum spanning tree algorithms. International Journal of Mathematical, Computational, Physical , Electrical and Computer Engineering , 7 ( 10 ): 1524 -- 1534 , 2013 . F. A. Karkory and A. A. Abudalmola. Implementation of heuristics for solving travelling salesman problem using nearest neighbour and minimum spanning tree algorithms. International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering, 7(10):1524--1534, 2013.","journal-title":"Electrical and Computer Engineering"},{"key":"e_1_3_2_1_6_1","volume-title":"MIT","author":"Koza J.","year":"1992","unstructured":"J. Koza . Genetic Programming : On the Programming of Computers by Means of Natural Selection, volume 1st . MIT , 1992 . J. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection, volume 1st. MIT, 1992."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7744354"},{"key":"e_1_3_2_1_9_1","volume-title":"http:\/\/comopt.ifi.uniheidelberg.de\/software\/TSPLIB95\/tsp95.pdf","author":"Reinelt G.","year":"1995","unstructured":"G. Reinelt . Tsplib 95. http:\/\/comopt.ifi.uniheidelberg.de\/software\/TSPLIB95\/tsp95.pdf , 1995 . G. Reinelt. Tsplib 95. http:\/\/comopt.ifi.uniheidelberg.de\/software\/TSPLIB95\/tsp95.pdf, 1995."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908942"},{"key":"e_1_3_2_1_11_1","unstructured":"G. Skorobohatyj. Vlsi benchmark set. http:\/\/elib.zib.de\/pub\/mptestdata\/tsp\/tsplib\/tsp\/index.html June 1995.  G. Skorobohatyj. Vlsi benchmark set. http:\/\/elib.zib.de\/pub\/mptestdata\/tsp\/tsplib\/tsp\/index.html June 1995."}],"event":{"name":"SAICSIT '16: Annual Conference of the South African Institute of Computer Scientists and Information Technologists","sponsor":["AWS Amazon Web Services","IBM IBM"],"location":"Johannesburg South Africa","acronym":"SAICSIT '16"},"container-title":["Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2987491.2987525","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2987491.2987525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:40:05Z","timestamp":1750218005000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2987491.2987525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,26]]},"references-count":10,"alternative-id":["10.1145\/2987491.2987525","10.1145\/2987491"],"URL":"https:\/\/doi.org\/10.1145\/2987491.2987525","relation":{},"subject":[],"published":{"date-parts":[[2016,9,26]]},"assertion":[{"value":"2016-09-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}