{"id":"https://openalex.org/W2040865164","doi":"https://doi.org/10.1007/s13676-012-0010-0","title":"Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison","display_name":"Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison","publication_year":2012,"publication_date":"2012-05-14","ids":{"openalex":"https://openalex.org/W2040865164","doi":"https://doi.org/10.1007/s13676-012-0010-0","mag":"2040865164"},"language":"en","primary_location":{"id":"doi:10.1007/s13676-012-0010-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13676-012-0010-0","pdf_url":null,"source":{"id":"https://openalex.org/S2764539693","display_name":"EURO Journal on Transportation and Logistics","issn_l":"2192-4376","issn":["2192-4376","2192-4384"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Transportation and Logistics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13676-012-0010-0","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024400368","display_name":"Roberto Roberti","orcid":"https://orcid.org/0000-0002-2987-1593"},"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":true,"raw_author_name":"Roberto Roberti","raw_affiliation_strings":["DEIS, University of Bologna, Viale Risorgimento, 2, 40136 Bologna (BO), Italy","DEIS, University of Bologna, Bologna (BO), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIS, University of Bologna, Viale Risorgimento, 2, 40136 Bologna (BO), Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"DEIS, University of Bologna, Bologna (BO), Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084320669","display_name":"Paolo Toth","orcid":"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":true,"raw_author_name":"Paolo Toth","raw_affiliation_strings":["DEIS, University of Bologna, Viale Risorgimento, 2, 40136 Bologna (BO), Italy","DEIS, University of Bologna, Bologna (BO), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIS, University of Bologna, Viale Risorgimento, 2, 40136 Bologna (BO), Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"DEIS, University of Bologna, Bologna (BO), Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024400368","https://openalex.org/A5084320669"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":11.1064,"has_fulltext":false,"cited_by_count":103,"citation_normalized_percentile":{"value":0.98236374,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"1","issue":"1-2","first_page":"113","last_page":"133"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9911999702453613,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8711960315704346},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7222357392311096},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.6932093501091003},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6643015146255493},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5844435095787048},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.580436110496521},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5597126483917236},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5491363406181335},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5216941237449646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49324196577072144},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.47381699085235596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4603452682495117},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4103374183177948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35029634833335876}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8711960315704346},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7222357392311096},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.6932093501091003},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6643015146255493},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5844435095787048},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.580436110496521},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5597126483917236},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5491363406181335},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5216941237449646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49324196577072144},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.47381699085235596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4603452682495117},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4103374183177948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35029634833335876},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s13676-012-0010-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13676-012-0010-0","pdf_url":null,"source":{"id":"https://openalex.org/S2764539693","display_name":"EURO Journal on Transportation and Logistics","issn_l":"2192-4376","issn":["2192-4376","2192-4384"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Transportation and Logistics","raw_type":"journal-article"},{"id":"pmh:oai:cris.unibo.it:11585/399140","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/399140","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,"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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s13676-012-0010-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13676-012-0010-0","pdf_url":null,"source":{"id":"https://openalex.org/S2764539693","display_name":"EURO Journal on Transportation and Logistics","issn_l":"2192-4376","issn":["2192-4376","2192-4384"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Transportation and Logistics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":65,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W92685995","https://openalex.org/W153120622","https://openalex.org/W626292722","https://openalex.org/W1532625697","https://openalex.org/W1533818411","https://openalex.org/W1561337940","https://openalex.org/W1563568831","https://openalex.org/W1571087346","https://openalex.org/W1652378708","https://openalex.org/W1717440967","https://openalex.org/W1968429519","https://openalex.org/W1970025200","https://openalex.org/W1974443370","https://openalex.org/W1978038344","https://openalex.org/W1982444996","https://openalex.org/W1984451472","https://openalex.org/W1985322505","https://openalex.org/W1986985656","https://openalex.org/W1988615825","https://openalex.org/W1990021722","https://openalex.org/W1991119408","https://openalex.org/W2001994662","https://openalex.org/W2004882088","https://openalex.org/W2005944337","https://openalex.org/W2006054213","https://openalex.org/W2008200956","https://openalex.org/W2009803313","https://openalex.org/W2013048621","https://openalex.org/W2013561074","https://openalex.org/W2020898729","https://openalex.org/W2023721044","https://openalex.org/W2033789385","https://openalex.org/W2035850032","https://openalex.org/W2040481750","https://openalex.org/W2044280739","https://openalex.org/W2049287714","https://openalex.org/W2054177169","https://openalex.org/W2058748455","https://openalex.org/W2058937865","https://openalex.org/W2062749672","https://openalex.org/W2066356146","https://openalex.org/W2067802172","https://openalex.org/W2075524116","https://openalex.org/W2077053998","https://openalex.org/W2084839533","https://openalex.org/W2092353499","https://openalex.org/W2092481826","https://openalex.org/W2095454340","https://openalex.org/W2107612355","https://openalex.org/W2111622332","https://openalex.org/W2123241324","https://openalex.org/W2125690626","https://openalex.org/W2126847028","https://openalex.org/W2140784080","https://openalex.org/W2144931885","https://openalex.org/W2163428398","https://openalex.org/W2324108981","https://openalex.org/W2561675875","https://openalex.org/W4245394219","https://openalex.org/W4246185962","https://openalex.org/W4285719527","https://openalex.org/W6606240765","https://openalex.org/W6619920785","https://openalex.org/W6633526748"],"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/W2125126715","https://openalex.org/W2392203420","https://openalex.org/W2035850032"],"abstract_inverted_index":{"This":[0],"paper":[1],"surveys":[2],"the":[3,14,18,53,68],"most":[4,54],"effective":[5,55],"mathematical":[6],"models":[7],"and":[8,36,52,57,73,78],"exact":[9],"algorithms":[10,59,77],"proposed":[11,32,66],"for":[12,67],"finding":[13],"optimal":[15],"solution":[16],"of":[17,87],"well-known":[19],"Asymmetric":[20],"Traveling":[21],"Salesman":[22],"Problem":[23],"(ATSP).":[24],"The":[25,62,75],"fundamental":[26],"Integer":[27],"Linear":[28],"Programming":[29],"(ILP)":[30],"model":[31],"by":[33],"Dantzig,":[34],"Fulkerson":[35],"Johnson":[37],"is":[38],"first":[39],"presented,":[40],"its":[41],"classical":[42],"(assignment,":[43],"shortest":[44],"spanning":[45],"r-arborescence,":[46],"linear":[47],"programming)":[48],"relaxations":[49],"are":[50,60,70,80],"derived,":[51],"branch-and-bound":[56],"branch-and-cut":[58],"described.":[61],"polynomial":[63],"ILP":[64],"formulations":[65,79],"ATSP":[69],"then":[71],"presented":[72],"analyzed.":[74],"considered":[76],"finally":[81],"experimentally":[82],"compared":[83],"on":[84],"a":[85],"set":[86],"benchmark":[88],"instances.":[89]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-10T08:33:47.465468","created_date":"2025-10-10T00:00:00"}