{"id":"https://openalex.org/W47562258","doi":null,"title":"A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem.","display_name":"A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem.","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W47562258","mag":"47562258"},"language":"en","primary_location":{"id":"pmh:oai:cris.unibo.it:11585/73201","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/73201","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5008620974","display_name":"Valentina Cacchiani","orcid":"https://orcid.org/0000-0002-6269-7136","observed_orcids":["https://orcid.org/0000-0002-6269-7136"]},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Valentina Cacchiani","raw_affiliation_strings":["University of Bologna, Bologna, Italy"],"raw_orcid":"https://orcid.org/0000-0002-6269-7136","affiliations":[{"raw_affiliation_string":"University of Bologna, Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055907730","display_name":"Albert Einstein Fernandes Muritiba","orcid":"https://orcid.org/0000-0003-0528-9248","observed_orcids":["https://orcid.org/0000-0003-0528-9248"]},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Albert Einstein Fernandes Muritiba","raw_affiliation_strings":["University of Bologna, Bologna, Italy"],"raw_orcid":"https://orcid.org/0000-0003-0528-9248","affiliations":[{"raw_affiliation_string":"University of Bologna, Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091776727","display_name":"Marcos Negreiros","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marcos Negreiros","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5084320669","display_name":"Paolo Toth","orcid":"https://orcid.org/0000-0001-6846-5814","observed_orcids":["https://orcid.org/0000-0001-6846-5814"]},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo Toth","raw_affiliation_strings":["University of Bologna, Bologna, Italy"],"raw_orcid":"https://orcid.org/0000-0001-6846-5814","affiliations":[{"raw_affiliation_string":"University of Bologna, Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00394737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"136","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9878000020980835,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9878000020980835,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.008799999952316284,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0017999999690800905,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/generalized-traveling-salesman-problem","display_name":"generalized traveling salesman problem","score":0.9449999928474426},{"id":"https://openalex.org/keywords/multi-start-heuristic","display_name":"multi-start heuristic","score":0.8849999904632568},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"decomposition method","score":0.4970000088214874},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.7239999771118164},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6539999842643738},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.6600000262260437},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.46700000762939453},{"id":"https://openalex.org/keywords/improvement-procedure","display_name":"improvement procedure","score":0.47600001096725464}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8761870861053467},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6358654499053955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5819749236106873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5586971044540405},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5547663569450378},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5495962500572205},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5381631851196289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4332914650440216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30873361229896545}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:cris.unibo.it:11585/73201","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/73201","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:47562258","doi":null,"is_oa":false,"landing_page_url":"https://cris.unibo.it/handle/11585/73201","pdf_url":null,"source":{"id":"https://openalex.org/S4306417910","display_name":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1855192063","https://openalex.org/W1975856156","https://openalex.org/W2163082612","https://openalex.org/W7098407727","https://openalex.org/W7095531405","https://openalex.org/W2018269848","https://openalex.org/W2156273071","https://openalex.org/W7099221828","https://openalex.org/W2323158896","https://openalex.org/W7100734223"],"abstract_inverted_index":{"We":[0,19,83,234],"study":[1],"the":[2,13,30,36,74,77,80,86,93,110,114,118,123,132,138,146,167,177,180,183,196,204,215,227,231,256,266,275,289,296,308,316,320,327,337,342,367,371,379,387,413,424,427,431,446,470,474,477,488,495,498,501,504,511,520,558,564,568,572,618,628,631,634,645],"Generalized":[3,184],"Traveling":[4,15],"Salesman":[5,16],"Problem":[6,17],"(GTSP),":[7],"which":[8,92,223,240,319,449,465],"is":[9,29,50,58,106,134,268,293,313,389,429,439,506,561,588],"a":[10,22,107,160,236,244,252,263,304,353,362,374,407,419,435,460,483,492,532,549,585,598,605,650],"variant":[11],"of":[12,32,38,47,76,79,109,137,230,248,287,340,370,386,426,463,476,497,503,534,600,630],"well-known":[14],"(TSP).":[18],"are":[20,125,179,224,284,322,623,642],"given":[21],"graph":[23],"G":[24],"=":[25],"(V,E),":[26],"where":[27,121],"V":[28,49],"set":[31,37,46,247,462,533,560,599],"nodes,":[33,464,535],"and":[34,72,162,187,192,250,280,301,324,344,373,404],"E":[35],"edges,":[39],"each":[40,70,102,402,455,543,555],"with":[41,243,259,396,531,538,552,644],"an":[42,61,516],"associated":[43],"cost.":[44],"The":[45,104,171,383,593,636],"nodes":[48,249,297],"partitioned":[51],"into":[52,270],"m":[53],"clusters":[54,124,321,372,388,428,505],"V(1),":[55],"...,V(m).":[56],"GTSP":[57,89,105,133,178],"to":[59,96,149,165,169,255,274,294,298,314,351,365,377,487,567,615,626],"find":[60,378],"elementary":[62],"cycle":[63,94,305,448],"visiting":[64,368,384],"at":[65,226,473],"least":[66],"one":[67,99,129,399,452,471,541],"node":[68,100,229,400,453,556,565],"for":[69,101,144,176,633],"cluster,":[71],"minimizing":[73],"sum":[75],"costs":[78],"traveled":[81],"edges.":[82],"focus":[84],"on":[85,141,597],"so-called":[87],"Equality":[88],"(E-GTSP),":[90],"in":[91,117,154,318,349,401,443,454,494,515,557,571],"has":[95],"visit":[97],"exactly":[98,451],"cluster.":[103,456,544],"generalization":[108],"TSP:":[111],"we":[112,393,481,508,528,546],"obtain":[113],"traditional":[115],"TSP":[116,408],"particular":[119],"case":[120],"all":[122],"composed":[126],"by":[127,190,200,209,218,278,411,418,563,604,609,639,649],"just":[128],"node.":[130],"Thus":[131],"NP-Hard.":[135],"Most":[136],"literature":[139],"focuses":[140],"heuristic":[142,174,216,238],"approaches":[143],"solving":[145],"problem,":[147],"due":[148],"its":[150],"high":[151],"complexity.":[152],"However,":[153,545],"[FSGT97]":[155],"Fischetti":[156,219,610],"et":[157,211,220,611],"al.":[158,212,221,612],"present":[159],"Branch":[161],"Cut":[163],"algorithm":[164,189,438,514,594],"solve":[166],"problem":[168,257,267,343],"optimality.":[170],"best":[172,573],"state-of-the-art":[173],"algorithms":[175,217,632],"following:":[181],"-":[182,195,203,214],"Initialization,":[185],"Insertion":[186,415],"Improvement":[188],"Renaud":[191,279],"Boctor":[193,281],"([RB98]);":[194],"Nearest":[197],"Neighbor":[198],"approach":[199,254,360,579,641],"Noon":[201],"([N88]);":[202],"Reinforcing":[205],"Ant":[206],"Colony":[207],"System":[208],"Pintea":[210],"([PPC07]);":[213],"([FSGT97]),":[222],"computed":[225],"root":[228],"branch-decision":[232],"tree.":[233],"propose":[235],"multi-start":[237],"algorithm,":[239,265],"iteratively":[241,580],"starts":[242],"randomly":[245,394,536],"chosen":[246,537,559],"applies":[251],"decomposition":[253,264],"combined":[258],"improvement":[260,421,485],"procedures.":[261],"In":[262,357],"subdivided":[269],"two":[271,285,334,338],"subproblems.":[272],"According":[273],"classification":[276],"introduced":[277,608],"([RB98]),":[282],"there":[283],"ways":[286,339],"decomposing":[288,341],"problem.":[290],"One":[291],"possibility":[292,312],"select":[295],"be":[299,467,524],"visited,":[300,323],"then":[302,325,405],"construct":[303,326],"that":[306],"visits":[307,450],"selected":[309],"nodes;":[310],"another":[311],"determine":[315,366],"order":[317,350,369,385,425,496,502],"optimal":[328,646],"cycle.":[329,382],"Our":[330,578],"method":[331],"combines":[332],"these":[333,582],"approaches,":[335],"alternating":[336],"introducing":[345],"also":[346,547],"some":[347],"randomness":[348],"explore":[352],"greater":[354],"solution":[355,410,522,574],"space.":[356],"particular,":[358],"our":[359,640],"considers":[361],"first":[363,478],"phase":[364,376,433,458],"second":[375,432],"minimum":[380],"cost":[381],"obtained":[390,472,603,638,648],"as":[391],"follows:":[392],"choose,":[395],"uniform":[397,539],"probability,":[398,540],"cluster":[403,570],"compute":[406],"feasible":[409],"using":[412],"Farthest":[414],"approach,":[416],"followed":[417],"2-opt":[420,484],"procedure.":[422],"Once":[423],"fixed,":[430],"starts:":[434],"Dynamic":[436,512],"Programming":[437,513],"applied.":[440],"It":[441],"computes,":[442],"polynomial":[444],"time,":[445],"shortest":[447],"This":[457],"gives":[459],"new":[461,489],"can":[466],"different":[468],"from":[469,542,617],"end":[475],"phase.":[479],"Thus,":[480],"apply":[482,509,548],"procedure":[486,607],"sequence,":[490],"allowing":[491],"change":[493],"clusters.":[499],"If":[500],"changed,":[507],"again":[510,530],"iterative":[517],"way.":[518],"Otherwise":[519],"current":[521],"cannot":[523],"further":[525],"improved,":[526],"so":[527,576],"start":[529],"probabilistic":[550],"step:":[551],"probability":[553],"p":[554],"substituted":[562],"corresponding":[566],"same":[569],"found":[575],"far.":[577],"repeats":[581],"steps":[583],"until":[584],"stop":[586],"condition":[587],"reached":[589],"(e.g.,":[590],"time":[591],"limit).":[592],"was":[595],"tested":[596],"benchmark":[601],"instances":[602,616,622],"clustering":[606],"([FSGT97])":[613],"applied":[614],"TSPLIB":[619],"library.":[620],"These":[621],"generally":[624],"used":[625],"test":[627],"efficiency":[629],"GTSP.":[635],"results":[637],"compared":[643],"solutions":[647],"Branch-and-Cut":[651],"al...":[652]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2016-06-24T00:00:00"}