{"id":"https://openalex.org/W2003113703","doi":"https://doi.org/10.1002/net.3230170405","title":"Accelerated branch exchange heuristics for symmetric traveling salesman problems","display_name":"Accelerated branch exchange heuristics for symmetric traveling salesman problems","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2003113703","doi":"https://doi.org/10.1002/net.3230170405","mag":"2003113703"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170405","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/A5030949998","display_name":"William R. Stewart","orcid":"https://orcid.org/0000-0002-3744-8322"},"institutions":[{"id":"https://openalex.org/I16285277","display_name":"William & Mary","ror":"https://ror.org/03hsf0573","country_code":"US","type":"education","lineage":["https://openalex.org/I16285277"]},{"id":"https://openalex.org/I4210136924","display_name":"Colonial Williamsburg Foundation","ror":"https://ror.org/03w0tq079","country_code":"US","type":"archive","lineage":["https://openalex.org/I4210136924"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"William R. Stewart","raw_affiliation_strings":["School of Business Administration, College of William and Mary; Williamsburg, Virginia 23185","Williamsburg, Virginia 23185","School of Business Administration, College of William and Mary"],"affiliations":[{"raw_affiliation_string":"School of Business Administration, College of William and Mary; Williamsburg, Virginia 23185","institution_ids":["https://openalex.org/I16285277"]},{"raw_affiliation_string":"Williamsburg, Virginia 23185","institution_ids":["https://openalex.org/I4210136924"]},{"raw_affiliation_string":"School of Business Administration, College of William and Mary","institution_ids":["https://openalex.org/I16285277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030949998"],"corresponding_institution_ids":["https://openalex.org/I16285277","https://openalex.org/I4210136924"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1592,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.80160575,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"17","issue":"4","first_page":"423","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9957000017166138,"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.9400047063827515},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8270319104194641},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6464292407035828},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.623801052570343},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.5542308688163757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4867429733276367},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.476455956697464},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4727626442909241},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4510660469532013},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.4345599412918091},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.43349263072013855},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4287838637828827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3667764365673065},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.04759037494659424}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9400047063827515},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8270319104194641},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6464292407035828},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.623801052570343},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.5542308688163757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4867429733276367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.476455956697464},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4727626442909241},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4510660469532013},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4345599412918091},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.43349263072013855},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4287838637828827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3667764365673065},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.04759037494659424}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170405","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170405","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1972385709","https://openalex.org/W1985278890","https://openalex.org/W1992928037","https://openalex.org/W1994029369","https://openalex.org/W2010632883","https://openalex.org/W2016290942","https://openalex.org/W2029392610","https://openalex.org/W2042986967","https://openalex.org/W2106378689","https://openalex.org/W2114552889","https://openalex.org/W2117235989","https://openalex.org/W2140318223","https://openalex.org/W2148673189","https://openalex.org/W2167679255","https://openalex.org/W3036211873"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W4246557197","https://openalex.org/W2758988501","https://openalex.org/W2653294936","https://openalex.org/W3013791021","https://openalex.org/W2592065458","https://openalex.org/W996280192","https://openalex.org/W2469984263","https://openalex.org/W2072699573"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"method":[2],"for":[3,12,91],"accelerating":[4],"the":[5,41,44,47,50,80,83,87,111],"computational":[6],"performance":[7,23],"of":[8,35,43,52,82,86],"branch":[9],"exchange":[10],"heuristics":[11],"symmetric":[13,113],"traveling":[14],"salesman":[15],"problems":[16],"(TSP's)":[17],"is":[18,24,96],"presented.":[19],"The":[20],"improvement":[21],"in":[22,79],"obtained":[25],"by":[26],"considering":[27],"only":[28],"exchanges":[29],"that":[30,98,100],"have":[31],"a":[32,37,57,61,76],"good":[33,58],"chance":[34],"producing":[36],"better":[38],"solution.":[39,84],"In":[40],"instance":[42],"3\u2013optimal":[45],"heuristic,":[46],"approach":[48],"reduces":[49],"number":[51],"operations":[53],"required":[54],"to":[55,60,70,110],"obtain":[56],"solution":[59],"TSP":[62],"with":[63],"N":[64],"nodes":[65],"from":[66],"O(N":[67,71],"3":[68],")":[69,73],"2":[72],",":[74],"without":[75],"corresponding":[77],"degradation":[78],"quality":[81],"Most":[85],"results":[88,102],"are":[89],"produced":[90],"Euclidean":[92],"TSP's,":[93],"but":[94],"evidence":[95],"presented":[97],"indicates":[99],"thes":[101],"apply":[103],"equally":[104],"well":[105],"if":[106],"not":[107],"more":[108],"strongly":[109],"general":[112],"TSP.":[114]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}