{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:18:39Z","timestamp":1761988719522,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,12]],"date-time":"2014-07-12T00:00:00Z","timestamp":1405123200000},"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":[[2014,7,12]]},"DOI":"10.1145\/2576768.2598367","type":"proceedings-article","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T12:10:42Z","timestamp":1405080642000},"page":"421-428","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Socially inspired algorithms for the travelling thief problem"],"prefix":"10.1145","author":[{"given":"Mohammad Reza","family":"Bonyadi","sequence":"first","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]},{"given":"Zbigniew","family":"Michalewicz","sequence":"additional","affiliation":[{"name":"The University of Adelaide, Adelaide, Australia"}]},{"given":"Michal Roman","family":"Przybylek","sequence":"additional","affiliation":[{"name":"Polish-Japanese Institute of Information Technology, Warsaw, Poland"}]},{"given":"Adam","family":"Wierzbicki","sequence":"additional","affiliation":[{"name":"Polish-Japanese Institute of Information Technology, Warsaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A computer code for tsp. http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html.  A computer code for tsp. http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html."},{"key":"e_1_3_2_1_2_1","unstructured":"An effective implementation of the lk-heuristic. http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH.  An effective implementation of the lk-heuristic. http:\/\/www.akira.ruc.dk\/~keld\/research\/LKH."},{"key":"e_1_3_2_1_3_1","unstructured":"Millennium problems. http:\/\/www.claymath.org\/millenium-problems\/p-vs-np-problem.  Millennium problems. http:\/\/www.claymath.org\/millenium-problems\/p-vs-np-problem."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.1.82.15157"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.80"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214038"},{"key":"e_1_3_2_1_7_1","volume-title":"abs\/1211.0391","author":"Bj\u00f6rklund A.","year":"2012","unstructured":"A. Bj\u00f6rklund . Below all subsets for permutational counting problems. CoRR , abs\/1211.0391 , 2012 . A. Bj\u00f6rklund. Below all subsets for permutational counting problems. CoRR, abs\/1211.0391, 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2151171.2151181"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557681"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800029.808532"},{"key":"e_1_3_2_1_14_1","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"Lawler E. L.","year":"1985","unstructured":"E. L. Lawler , J. K. Lenstra , A. R. Kan , and D. B. Shmoys . The traveling salesman problem: a guided tour of combinatorial optimization , volume 3 . Wiley Chichester , 1985 . E. L. Lawler, J. K. Lenstra, A. R. Kan, and D. B. Shmoys. The traveling salesman problem: a guided tour of combinatorial optimization, volume 3. Wiley Chichester, 1985."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30687-7_6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/354337"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.03.002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598249"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/3-540-58484-6_269","volume-title":"Parallel Problem Solving from Nature-PPSN III","author":"Potter M. A.","year":"1994","unstructured":"M. A. Potter and K. A. De Jong . A cooperative coevolutionary approach to function optimization . In Parallel Problem Solving from Nature-PPSN III , pages 249 -- 257 . Springer , 1994 . M. A. Potter and K. A. De Jong. A cooperative coevolutionary approach to function optimization. In Parallel Problem Solving from Nature-PPSN III, pages 249--257. Springer, 1994."},{"issue":"2","key":"e_1_3_2_1_21_1","first-page":"107","article-title":"Connectivity of random nets","volume":"13","author":"Rapoprt A.","year":"1951","unstructured":"A. Rapoprt and R. Solomonof . Connectivity of random nets . Bulletin of Mathematical Biology , 13 ( 2 ): 107 -- 117 , 1951 . A. Rapoprt and R. Solomonof. Connectivity of random nets. Bulletin of Mathematical Biology, 13(2):107--117, 1951.","journal-title":"Bulletin of Mathematical Biology"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"Toth P.","year":"2002","unstructured":"P. Toth and D. Vigo . The vehicle routing problem , volume 9 . Siam , 2002 . P. Toth and D. Vigo. The vehicle routing problem, volume 9. Siam, 2002."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"T.\n      Weise M.\n      Zapf R.\n      Chiong and \n      A.\n      Nebro\n  . \n  Why is optimization difficult? In R\n  . Chiong editor Nature-Inspired Algorithms for Optimisation volume \n  193\n   of \n  Studies in Computational Intelligence pages \n  1\n  --\n  50\n  . \n  Springer Berlin Heidelberg 2009\n  .  T. Weise M. Zapf R. Chiong and A. Nebro. Why is optimization difficult? In R. Chiong editor Nature-Inspired Algorithms for Optimisation volume 193 of Studies in Computational Intelligence pages 1--50. Springer Berlin Heidelberg 2009.","DOI":"10.1007\/978-3-642-00267-0_1"}],"event":{"name":"GECCO '14: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Vancouver BC Canada","acronym":"GECCO '14"},"container-title":["Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598367","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2576768.2598367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:54Z","timestamp":1750230054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2576768.2598367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,12]]},"references-count":21,"alternative-id":["10.1145\/2576768.2598367","10.1145\/2576768"],"URL":"https:\/\/doi.org\/10.1145\/2576768.2598367","relation":{},"subject":[],"published":{"date-parts":[[2014,7,12]]},"assertion":[{"value":"2014-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}