{"id":"https://openalex.org/W2737622315","doi":"https://doi.org/10.1057/s41274-017-0261-0","title":"Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions","display_name":"Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions","publication_year":2017,"publication_date":"2017-07-18","ids":{"openalex":"https://openalex.org/W2737622315","doi":"https://doi.org/10.1057/s41274-017-0261-0","mag":"2737622315"},"language":"en","primary_location":{"id":"doi:10.1057/s41274-017-0261-0","is_oa":false,"landing_page_url":"https://doi.org/10.1057/s41274-017-0261-0","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-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/A5083159748","display_name":"Maichel M. Aguayo","orcid":"https://orcid.org/0000-0003-0905-1691"},"institutions":[{"id":"https://openalex.org/I172787465","display_name":"University of Concepci\u00f3n","ror":"https://ror.org/0460jpj73","country_code":"CL","type":"education","lineage":["https://openalex.org/I172787465"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Maichel M. Aguayo","raw_affiliation_strings":["Departamento de Ingenieria Industrial, Universidad de Concepcion, Concepcion, Chile"],"affiliations":[{"raw_affiliation_string":"Departamento de Ingenieria Industrial, Universidad de Concepcion, Concepcion, Chile","institution_ids":["https://openalex.org/I172787465"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033566442","display_name":"Subhash C. Sarin","orcid":"https://orcid.org/0000-0002-1744-2281"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Subhash C. Sarin","raw_affiliation_strings":["Grado Department of Industrial and Systems Engineering, Virginia Tech., Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"Grado Department of Industrial and Systems Engineering, Virginia Tech., Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043357545","display_name":"Hanif D. Sherali","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hanif D. Sherali","raw_affiliation_strings":["Grado Department of Industrial and Systems Engineering, Virginia Tech., Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"Grado Department of Industrial and Systems Engineering, Virginia Tech., Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033566442"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":0.6112,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74386198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"69","issue":"5","first_page":"734","last_page":"746"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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.9993000030517578,"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.9959999918937683,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9940000176429749,"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.922348141670227},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.566094160079956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5634996891021729},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5633397102355957},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5628988742828369},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.5236473083496094},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5155632495880127},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5026204586029053},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4903426170349121},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4661131501197815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3667425513267517}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.922348141670227},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.566094160079956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5634996891021729},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5633397102355957},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5628988742828369},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.5236473083496094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5155632495880127},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5026204586029053},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4903426170349121},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4661131501197815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3667425513267517},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/s41274-017-0261-0","is_oa":false,"landing_page_url":"https://doi.org/10.1057/s41274-017-0261-0","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tjorxx:v:69:y:2018:i:5:p:734-746","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1057/s41274-017-0261-0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5199999809265137,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1478931920","https://openalex.org/W1504684182","https://openalex.org/W1823070989","https://openalex.org/W1965652713","https://openalex.org/W1970025200","https://openalex.org/W1970193303","https://openalex.org/W1984952615","https://openalex.org/W1989971830","https://openalex.org/W1992713772","https://openalex.org/W1999466794","https://openalex.org/W1999832757","https://openalex.org/W2003327526","https://openalex.org/W2007535918","https://openalex.org/W2009923570","https://openalex.org/W2033901094","https://openalex.org/W2034550441","https://openalex.org/W2038071774","https://openalex.org/W2040865164","https://openalex.org/W2042706779","https://openalex.org/W2044066061","https://openalex.org/W2049093006","https://openalex.org/W2049287714","https://openalex.org/W2065889460","https://openalex.org/W2070094803","https://openalex.org/W2086091870","https://openalex.org/W2086522200","https://openalex.org/W2092481826","https://openalex.org/W2107481047","https://openalex.org/W2140037720","https://openalex.org/W2174653384","https://openalex.org/W2331986476","https://openalex.org/W2783570779","https://openalex.org/W4245264104"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4220987199","https://openalex.org/W2766731260","https://openalex.org/W1966089951","https://openalex.org/W2362402143","https://openalex.org/W2361554335"],"abstract_inverted_index":{"In":[0],"this":[1,41],"paper,":[2],"we":[3,89],"present":[4],"a":[5,29],"single-commodity":[6],"flow-based":[7],"formulation":[8,42,51],"for":[9,52,62],"the":[10,22,48,53,78,86,102,111,129,137],"high-multiplicity":[11],"asymmetric":[12,23],"traveling":[13,24],"salesman":[14,25],"problem":[15,26],"(HMATSP),":[16],"which":[17,107],"is":[18,43,56],"an":[19,122],"extension":[20],"of":[21,77,101,124],"(ATSP)":[27],"wherein":[28],"city":[30],"can":[31,68],"be":[32,69],"visited":[33],"multiple":[34],"times.":[35],"We":[36],"show":[37],"that":[38,80,95],"even":[39],"though":[40],"not":[44,82],"as":[45,47],"tight":[46],"best":[49],"known":[50],"HMATSP,":[54],"it":[55],"faster":[57],"and":[58,67,104,115],"easier":[59],"to":[60,71,98,118,134],"use":[61],"direct":[63],"solution":[64],"by":[65],"CPLEX":[66],"used":[70],"model":[72],"several":[73],"variants":[74],"or":[75],"extensions":[76],"HMATSP":[79,103,131],"have":[81],"been":[83],"studied":[84],"in":[85,136],"literature.":[87,138],"Furthermore,":[88],"propose":[90],"effective":[91],"accelerated":[92],"Benders":[93],"algorithms":[94],"are":[96,108,128],"demonstrated":[97],"solve":[99],"instances":[100,132],"its":[105],"extensions,":[106],"derived":[109],"from":[110],"well-known":[112],"ATSP":[113],"libraries":[114],"involve":[116],"up":[117],"1001":[119],"cities,":[120],"within":[121],"hour":[123],"CPU":[125],"time.":[126],"These":[127],"largest-sized":[130],"solved":[133],"optimality":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-14T08:43:22.919905","created_date":"2025-10-10T00:00:00"}