{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:42:44Z","timestamp":1781829764088,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T00:00:00Z","timestamp":1530489600000},"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":[[2018,7,2]]},"DOI":"10.1145\/3205455.3205545","type":"proceedings-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T12:30:37Z","timestamp":1530621037000},"page":"340-346","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["A two-level diploid genetic based algorithm for solving the family traveling salesman problem"],"prefix":"10.1145","author":[{"given":"Petric\u0103","family":"Pop","sequence":"first","affiliation":[{"name":"Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oliviu","family":"Matei","sequence":"additional","affiliation":[{"name":"Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Camelia","family":"Pintea","sequence":"additional","affiliation":[{"name":"Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"R. Bernardino and A. Paias. 2017. Solving the family traveling salesman problem. European Journal of Operational Research (2017)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(75)90015-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.11.022"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00404-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/42512.42521"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0480"},{"key":"e_1_3_2_1_7_1","volume-title":"The record balancing problem: A dynamic programming solution of a generalized travelling salesman problem. RIRO","author":"Henry-Labordere A.L.","year":"1969","unstructured":"A.L. Henry-Labordere. 1969. The record balancing problem: A dynamic programming solution of a generalized travelling salesman problem. RIRO (1969)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/522098"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12026"},{"key":"e_1_3_2_1_10_1","volume-title":"The generalized traveling salesman problem solved with ant algorithms. Complex Adaptive Systems Modeling 5, 1 (07","author":"Pintea M.","year":"2017","unstructured":"Camelia-M. Pintea, Petric\u0103 C. Pop, and Camelia Chira. 2017. The generalized traveling salesman problem solved with ant algorithms. Complex Adaptive Systems Modeling 5, 1 (07 Aug 2017), 8."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.11.018"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59650-1_13"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.08.015"},{"key":"e_1_3_2_1_14_1","volume-title":"The Generalized Minimum Spanning Tree Problem","author":"Pop P. C.","unstructured":"P. C. Pop. 2002. The Generalized Minimum Spanning Tree Problem. Twente University Press, the Netherlands."},{"key":"e_1_3_2_1_15_1","volume-title":"Generalized Network Design Problems. Modeling and Optimization","author":"Pop P. C.","unstructured":"P. C. Pop. 2012. Generalized Network Design Problems. Modeling and Optimization. De Gruyter, Germany."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001643"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"P. C. Pop O. Matei and C. Sabo. 2010. A New Approach for Solving the Generalized Traveling Salesman Problem. In Hybrid Metaheuristics Mar\u00eda J. Blesa Christian Blum G\u00fcnther Raidl Andrea Roli and Michael Sampels (Eds.). Springer Berlin Heidelberg Berlin Heidelberg 62--72.","DOI":"10.5555\/1926965.1926970"},{"key":"e_1_3_2_1_18_1","volume-title":"The Clustered Traveling Salesman Problem: A Genetic Approach","author":"Potvin Jean-Yves","unstructured":"Jean-Yves Potvin and Fran\u00e7ois Guertin. 1996. The Clustered Traveling Salesman Problem: A Genetic Approach. Springer US, Boston, MA, 619--631."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.08.057"},{"key":"e_1_3_2_1_20_1","unstructured":"S.S. Srivastava S. Kumar R.C. Garg and P. Sen. 1969. Generalized travelling salesman problem through n sets of nodes. CORS."}],"event":{"name":"GECCO '18: Genetic and Evolutionary Computation Conference","location":"Kyoto Japan","acronym":"GECCO '18","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205455.3205545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:45Z","timestamp":1750212465000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205455.3205545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,2]]},"references-count":20,"alternative-id":["10.1145\/3205455.3205545","10.1145\/3205455"],"URL":"https:\/\/doi.org\/10.1145\/3205455.3205545","relation":{},"subject":[],"published":{"date-parts":[[2018,7,2]]},"assertion":[{"value":"2018-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}