{"id":"https://openalex.org/W2810043182","doi":"https://doi.org/10.1145/3205455.3205545","title":"A two-level diploid genetic based algorithm for solving the family traveling salesman problem","display_name":"A two-level diploid genetic based algorithm for solving the family traveling salesman problem","publication_year":2018,"publication_date":"2018-07-02","ids":{"openalex":"https://openalex.org/W2810043182","doi":"https://doi.org/10.1145/3205455.3205545","mag":"2810043182"},"language":"en","primary_location":{"id":"doi:10.1145/3205455.3205545","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205455.3205545","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054561530","display_name":"Petric\u0103 C. Pop","orcid":"https://orcid.org/0000-0002-0626-9284"},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Petric\u0103 Pop","raw_affiliation_strings":["Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania","institution_ids":["https://openalex.org/I158333966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071251605","display_name":"Oliviu Matei","orcid":"https://orcid.org/0000-0003-0319-8318"},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Oliviu Matei","raw_affiliation_strings":["Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania","institution_ids":["https://openalex.org/I158333966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020692087","display_name":"Camelia-M. Pintea","orcid":"https://orcid.org/0000-0003-2338-2454"},"institutions":[{"id":"https://openalex.org/I158333966","display_name":"Technical University of Cluj-Napoca","ror":"https://ror.org/03r8nwp71","country_code":"RO","type":"education","lineage":["https://openalex.org/I158333966"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Camelia Pintea","raw_affiliation_strings":["Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Cluj-Napoca and North University Center at Baia Mare, Baia Mare, Romania","institution_ids":["https://openalex.org/I158333966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7028,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.79648984,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"340","last_page":"346"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9836999773979187,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.903780460357666},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6178529262542725},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5309808850288391},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5154488682746887},{"id":"https://openalex.org/keywords/ploidy","display_name":"Ploidy","score":0.48052844405174255},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4621364176273346},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4587685167789459},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44216975569725037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34577956795692444},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.14867642521858215},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.13715201616287231}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.903780460357666},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6178529262542725},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5309808850288391},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5154488682746887},{"id":"https://openalex.org/C143191323","wikidata":"https://www.wikidata.org/wiki/Q118406","display_name":"Ploidy","level":3,"score":0.48052844405174255},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4621364176273346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4587685167789459},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44216975569725037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34577956795692444},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.14867642521858215},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.13715201616287231},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3205455.3205545","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3205455.3205545","pdf_url":null,"source":{"id":"https://openalex.org/S4363608932","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.47999998927116394}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1001602500","https://openalex.org/W1492852957","https://openalex.org/W1570270745","https://openalex.org/W1994512445","https://openalex.org/W2032789430","https://openalex.org/W2051579561","https://openalex.org/W2079125893","https://openalex.org/W2087858211","https://openalex.org/W2097571405","https://openalex.org/W2111415774","https://openalex.org/W2111685454","https://openalex.org/W2156273071","https://openalex.org/W2171867048","https://openalex.org/W2187883154","https://openalex.org/W2619911072","https://openalex.org/W2745422985","https://openalex.org/W2768260271","https://openalex.org/W2771232196"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2362402143"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"consider":[4],"the":[5,16,26,36,39,65,70,90,98,111,114,120,125,160,187,192],"Family":[6],"Traveling":[7,18],"Salesman":[8,19],"Problem":[9,20],"(FTSP),":[10],"which":[11,154],"is":[12,41,93,117,141,156],"a":[13,23,29,44,49,59,76,80,101,106,130,149,169],"variant":[14],"of":[15,25,32,38,52,89,113,133,173],"classical":[17,102],"(TSP).":[21],"Given":[22],"partition":[24],"nodes":[27,53,134],"into":[28,72,148],"predefined":[30],"number":[31,51,132],"clusters,":[33],"called":[34],"families,":[35],"aim":[37,112],"FTSP":[40,66],"to":[42,94,118,124,186],"find":[43,119],"minimum":[45],"cost":[46],"tour":[47,147],"visiting":[48,97,129],"given":[50,131],"from":[54,135],"each":[55,136,145],"family.":[56,137],"We":[57],"describe":[58],"novel":[60],"solution":[61,179],"approach":[62,180],"for":[63,190],"solving":[64,84,191],"obtained":[67],"by":[68,143],"decomposing":[69],"problem":[71,152],"two":[73],"smaller":[74],"subproblems:":[75],"macro-level":[77],"subproblem":[78,92,116,140],"and":[79,83,105],"micro-level":[81],"subproblem,":[82],"them":[85],"separately.":[86],"The":[87,138,164],"goal":[88],"first":[91],"provide":[95],"tours":[96],"families":[99],"using":[100,159],"genetic":[103,108],"algorithm":[104],"diploid":[107],"algorithm,":[109],"while":[110],"second":[115,139],"minimum-cost":[121],"tour,":[122],"corresponding":[123],"above":[126],"mentioned":[127],"tours,":[128],"solved":[142],"transforming":[144],"global":[146],"traveling":[150],"salesman":[151],"(TSP)":[153],"then":[155],"optimally":[157],"computed":[158],"Concorde":[161],"TSP":[162],"solver.":[163],"preliminary":[165],"computational":[166],"results":[167],"on":[168],"usually":[170],"used":[171],"set":[172],"benchmark":[174],"instances":[175],"prove":[176],"that":[177],"our":[178],"provides":[181],"competitive":[182],"solutions":[183],"in":[184],"comparison":[185],"existing":[188],"methods":[189],"FTSP.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}