{"id":"https://openalex.org/W2028566496","doi":"https://doi.org/10.1002/net.3230150407","title":"A heuristic circulation\u2010network approach to solve the multi\u2010traveling salesman problem","display_name":"A heuristic circulation\u2010network approach to solve the multi\u2010traveling salesman problem","publication_year":1985,"publication_date":"1985-12-01","ids":{"openalex":"https://openalex.org/W2028566496","doi":"https://doi.org/10.1002/net.3230150407","mag":"2028566496"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230150407","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150407","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5113550414","display_name":"Alberto Garcia\u2010Diaz","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alberto Garcia\u2010Diaz","raw_affiliation_strings":["Department of Industrial Engineering, Texas A&M University, College Station, Texas 77843","Department of Industrial Engineering Texas A&M University College Station, Texas 77843"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Texas A&M University, College Station, Texas 77843","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Industrial Engineering Texas A&M University College Station, Texas 77843","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113550414"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.24527363,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"15","issue":"4","first_page":"455","last_page":"467"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9947999715805054,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9919000267982483,"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.847952663898468},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6784382462501526},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5976718664169312},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5883323550224304},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5825513601303101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5291374325752258},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5261568427085876},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5261428356170654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42985448241233826}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.847952663898468},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6784382462501526},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5976718664169312},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5883323550224304},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5825513601303101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5291374325752258},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5261568427085876},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5261428356170654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42985448241233826},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230150407","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150407","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1970135106","https://openalex.org/W1985278890","https://openalex.org/W1992249619","https://openalex.org/W2029392610","https://openalex.org/W2037455079","https://openalex.org/W2044154434","https://openalex.org/W2057718356","https://openalex.org/W2068343681","https://openalex.org/W2123241324","https://openalex.org/W2238466830","https://openalex.org/W3118260104","https://openalex.org/W6664732303"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W4297427155","https://openalex.org/W3136451934","https://openalex.org/W3025823153","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269","https://openalex.org/W1828750805","https://openalex.org/W836555340"],"abstract_inverted_index":{"Abstract":[0],"The":[1,15,32,40,83],"overall":[2],"methodology":[3],"developed":[4],"in":[5,70],"this":[6],"paper":[7],"can":[8],"be":[9,68],"organized":[10],"into":[11],"two":[12],"major":[13],"parts.":[14],"first":[16],"part":[17,34],"consists":[18],"of":[19,22,43,51,61,73,81,91,120],"a":[20,28,36,52,118],"representation":[21,42],"the":[23,44,49,57,62,71,74,79,89,105],"Multi\u2010Traveling":[24,45],"Salesman":[25,46],"Problem":[26,47],"as":[27],"network":[29,85],"circulation":[30],"model.":[31],"second":[33],"is":[35],"subtour":[37],"elimination":[38],"procedure.":[39],"circulation\u2010network":[41],"allows":[48],"generation":[50],"starting":[53],"solution":[54],"which":[55,65],"satisfies":[56],"optimality":[58,112],"LP":[59,111],"conditions":[60],"network,":[63],"but":[64],"may":[66],"not":[67],"feasible":[69],"context":[72],"original":[75],"problem":[76],"due":[77],"to":[78],"existence":[80],"subtours.":[82],"proposed":[84],"algorithm":[86],"iteratively":[87],"reduces":[88],"set":[90],"solutions":[92],"with":[93],"subtours":[94],"by":[95],"eliminating":[96],"one":[97],"link":[98],"and":[99],"then":[100],"rerouting":[101],"its":[102],"flow,":[103],"using":[104],"remaining":[106],"arcs":[107],"without":[108],"violating":[109],"their":[110],"conditions.":[113],"Computational":[114],"results":[115],"based":[116],"on":[117],"sample":[119],"91":[121],"randomly":[122],"generated":[123],"problems":[124],"are":[125],"reported.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}