{"id":"https://openalex.org/W7127445062","doi":"https://doi.org/10.48550/arxiv.2602.00580","title":"Small Shifts, Large Gains: Unlocking Traditional TSP Heuristic Guided-Sampling via Unsupervised Neural Instance Modification","display_name":"Small Shifts, Large Gains: Unlocking Traditional TSP Heuristic Guided-Sampling via Unsupervised Neural Instance Modification","publication_year":2026,"publication_date":"2026-01-31","ids":{"openalex":"https://openalex.org/W7127445062","doi":"https://doi.org/10.48550/arxiv.2602.00580"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.00580","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124935995","display_name":"Wei Min Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Wei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062482783","display_name":"Hanchen Wang","orcid":"https://orcid.org/0000-0003-1286-5880"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Hanchen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124967241","display_name":"Dong Wen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wen, Dong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124969938","display_name":"Wenjie Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Wenjie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.652899980545044,"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.652899980545044,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0803999975323677,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.04639999940991402,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/heuristics","display_name":"Heuristics","score":0.7797999978065491},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7724999785423279},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7092999815940857},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.679099977016449},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.45500001311302185},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.4429999887943268},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4092000126838684},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.3968000113964081}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7797999978065491},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7724999785423279},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7179999947547913},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7092999815940857},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.679099977016449},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5180000066757202},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.45500001311302185},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.4429999887943268},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4092000126838684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4007999897003174},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.3968000113964081},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.3686999976634979},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3571999967098236},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.33239999413490295},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26089999079704285},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2549999952316284}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.00580","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.00580","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.00580","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.00580","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Traveling":[1],"Salesman":[2],"Problem":[3],"(TSP)":[4],"is":[5],"one":[6],"of":[7,72,196],"the":[8,70,125,138,154,163,176,194],"most":[9],"representative":[10],"NP-hard":[11],"problems":[12],"in":[13,20],"route":[14],"planning":[15],"and":[16,36,45,62,75,149,186],"a":[17,91,109],"long-standing":[18],"benchmark":[19],"combinatorial":[21],"optimization.":[22],"Traditional":[23],"heuristic":[24,54,100,128,207],"tour":[25,55,101,129,143,199,208],"constructors,":[26,200,209],"such":[27],"as":[28],"Farthest":[29],"or":[30],"Nearest":[31],"Insertion,":[32],"are":[33,134],"computationally":[34],"efficient":[35],"highly":[37],"practical,":[38],"but":[39,68,210],"their":[40,81],"deterministic":[41,99],"behavior":[42],"limits":[43],"exploration":[44],"often":[46],"leads":[47],"to":[48,118,137,145,205],"local":[49,151],"optima.":[50,152],"In":[51],"contrast,":[52],"neural-based":[53,110,164,206],"constructors":[56,102,144],"alleviate":[57],"this":[58,86],"issue":[59],"through":[60],"guided-sampling":[61,104],"typically":[63],"achieve":[64],"superior":[65],"solution":[66,202],"quality,":[67],"at":[69],"cost":[71],"extensive":[73],"training":[74,215],"reliance":[76],"on":[77,123,182],"ground-truth":[78,173],"supervision,":[79,174],"hindering":[80],"practical":[82],"use.":[83],"To":[84],"bridge":[85],"gap,":[87],"we":[88],"propose":[89],"TSP-MDF,":[90],"novel":[92],"instance":[93,111,160,165],"modification":[94,161],"framework":[95,177],"that":[96,113,133,190],"equips":[97],"traditional":[98,127,142,197],"with":[103,211],"capability.":[105],"Specifically,":[106],"TSP-MDF":[107,191],"introduces":[108],"modifier":[112,166],"strategically":[114],"shifts":[115],"node":[116],"coordinates":[117],"sample":[119],"multiple":[120],"modified":[121],"instances,":[122],"which":[124],"base":[126],"constructor":[130],"constructs":[131],"tours":[132,148],"mapped":[135],"back":[136],"original":[139],"instance,":[140],"allowing":[141],"explore":[146],"higher-quality":[147],"escape":[150],"At":[153],"same":[155],"time,":[156],"benefiting":[157],"from":[158],"our":[159],"formulation,":[162],"can":[167],"be":[168],"trained":[169],"efficiently":[170],"without":[171],"any":[172],"ensuring":[175],"maintains":[178],"practicality.":[179],"Extensive":[180],"experiments":[181],"large-scale":[183],"TSP":[184],"benchmarks":[185,188],"real-world":[187],"demonstrate":[189],"significantly":[192],"improves":[193],"performance":[195],"heuristics":[198],"achieving":[201],"quality":[203],"comparable":[204],"an":[212],"extremely":[213],"short":[214],"time.":[216]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-02-04T00:00:00"}