{"id":"https://openalex.org/W2736141764","doi":"https://doi.org/10.1145/3067695.3076028","title":"A novel reduction algorithm for the generalized traveling salesman problem","display_name":"A novel reduction algorithm for the generalized traveling salesman problem","publication_year":2017,"publication_date":"2017-07-11","ids":{"openalex":"https://openalex.org/W2736141764","doi":"https://doi.org/10.1145/3067695.3076028","mag":"2736141764"},"language":"en","primary_location":{"id":"doi:10.1145/3067695.3076028","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3067695.3076028","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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 Companion","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/A5084201218","display_name":"Mehdi El Krari","orcid":"https://orcid.org/0000-0001-7936-9430"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Mehdi El Krari","raw_affiliation_strings":["Mohammed V University in Rabat"],"affiliations":[{"raw_affiliation_string":"Mohammed V University in Rabat","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081271044","display_name":"Bela\u00efd Ahiod","orcid":"https://orcid.org/0009-0005-4499-4259"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Bela\u00efd Ahiod","raw_affiliation_strings":["Mohammed V University in Rabat"],"affiliations":[{"raw_affiliation_string":"Mohammed V University in Rabat","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044261019","display_name":"Bouazza Elbenani","orcid":"https://orcid.org/0000-0002-1655-672X"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Bouazza El Benani","raw_affiliation_strings":["Mohammed V University in Rabat"],"affiliations":[{"raw_affiliation_string":"Mohammed V University in Rabat","institution_ids":["https://openalex.org/I126477371"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084201218"],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04089219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"106"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9775999784469604,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9667626619338989},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7172244787216187},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.7118297219276428},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6764253973960876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6001467108726501},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5726370811462402},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.5173553824424744},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5075646638870239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49732068181037903},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.453476220369339},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4479066729545593},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.43441537022590637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34059804677963257},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08753854036331177},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05013135075569153}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9667626619338989},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7172244787216187},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.7118297219276428},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6764253973960876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6001467108726501},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5726370811462402},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.5173553824424744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5075646638870239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49732068181037903},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.453476220369339},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4479066729545593},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.43441537022590637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34059804677963257},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08753854036331177},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05013135075569153},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3067695.3076028","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3067695.3076028","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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 Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7300000190734863}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1571401318","https://openalex.org/W2018269848","https://openalex.org/W2019741214","https://openalex.org/W2032950184","https://openalex.org/W2163428398","https://openalex.org/W2283408570","https://openalex.org/W2405668439","https://openalex.org/W4389399242"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W8433631"],"abstract_inverted_index":{"The":[0,22,82],"Generalized":[1],"Traveling":[2,19],"Salesman":[3,20],"Problem":[4,10],"(GTSP)":[5],"is":[6,25,84],"a":[7,13,48,75],"Combinatorial":[8],"Optimization":[9],"considered":[11],"as":[12],"generalization":[14],"of":[15,30,42],"the":[16,61,71,98],"well":[17],"known":[18],"Problem.":[21],"GTSP,":[23],"which":[24],"an":[26,43],"NP-Hard":[27],"problem,":[28],"consists":[29],"visiting":[31],"only":[32],"one":[33,88],"city/node":[34],"from":[35,38,56,70,78],"each":[36],"region/cluster":[37],"all":[39],"given":[40],"clusters":[41,58],"instance.":[44],"This":[45],"paper":[46],"introduces":[47],"new":[49],"reduction":[50,76],"method":[51],"that":[52],"removes":[53],"\"farthest\"":[54],"cities":[55],"other":[57],"and":[59,93],"keeps":[60],"nearest":[62],"ones.":[63,100],"Experimental":[64],"tests":[65],"done":[66],"on":[67],"81":[68],"instances":[69,92],"TSPLIB":[72],"benchmark":[73],"present":[74],"rate":[77],"9":[79],"to":[80],"73%.":[81],"runtime":[83],"almost":[85],"less":[86],"than":[87],"second":[89],"for":[90,97],"most":[91],"doesn't":[94],"exceed":[95],"7":[96],"larger":[99]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}