{"id":"https://openalex.org/W4416249579","doi":"https://doi.org/10.1109/ijcnn64981.2025.11227689","title":"A Novel Anchor-Based Supervised Learning Framework for Solving Traveling Salesman Problem","display_name":"A Novel Anchor-Based Supervised Learning Framework for Solving Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-06-30","ids":{"openalex":"https://openalex.org/W4416249579","doi":"https://doi.org/10.1109/ijcnn64981.2025.11227689"},"language":null,"primary_location":{"id":"doi:10.1109/ijcnn64981.2025.11227689","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11227689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-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/A5066353774","display_name":"Zebin Huang","orcid":"https://orcid.org/0000-0003-4547-2098"},"institutions":[{"id":"https://openalex.org/I75867142","display_name":"Xiamen University of Technology","ror":"https://ror.org/01285e189","country_code":"CN","type":"education","lineage":["https://openalex.org/I75867142"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zebin Huang","raw_affiliation_strings":["Xiamen University of Technology,School of Computer and Information Engineering,Xiamen,China"],"affiliations":[{"raw_affiliation_string":"Xiamen University of Technology,School of Computer and Information Engineering,Xiamen,China","institution_ids":["https://openalex.org/I75867142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101739319","display_name":"Huayi Yin","orcid":"https://orcid.org/0009-0008-2015-277X"},"institutions":[{"id":"https://openalex.org/I75867142","display_name":"Xiamen University of Technology","ror":"https://ror.org/01285e189","country_code":"CN","type":"education","lineage":["https://openalex.org/I75867142"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huayi Yin","raw_affiliation_strings":["Xiamen University of Technology,School of Computer and Information Engineering,Xiamen,China"],"affiliations":[{"raw_affiliation_string":"Xiamen University of Technology,School of Computer and Information Engineering,Xiamen,China","institution_ids":["https://openalex.org/I75867142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066353774"],"corresponding_institution_ids":["https://openalex.org/I75867142"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.46633815,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.7573999762535095,"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.7573999762535095,"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.11349999904632568,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.019200000911951065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7696999907493591},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6348999738693237},{"id":"https://openalex.org/keywords/supervised-learning","display_name":"Supervised learning","score":0.541700005531311},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.515500009059906},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4837999939918518},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.39989998936653137},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.3978999853134155},{"id":"https://openalex.org/keywords/semi-supervised-learning","display_name":"Semi-supervised learning","score":0.3562000095844269}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7696999907493591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6693000197410583},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6348999738693237},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.589900016784668},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.541700005531311},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.515500009059906},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4837999939918518},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4625000059604645},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3978999853134155},{"id":"https://openalex.org/C58973888","wikidata":"https://www.wikidata.org/wiki/Q1041418","display_name":"Semi-supervised learning","level":2,"score":0.3562000095844269},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32269999384880066},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30239999294281006},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C22367795","wikidata":"https://www.wikidata.org/wiki/Q7625208","display_name":"Structured prediction","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.27379998564720154},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.27129998803138733},{"id":"https://openalex.org/C52622490","wikidata":"https://www.wikidata.org/wiki/Q1026626","display_name":"Feature extraction","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26159998774528503}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn64981.2025.11227689","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11227689","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321878","display_name":"Natural Science Foundation of Fujian Province","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W2018660239","https://openalex.org/W2752782242","https://openalex.org/W2937718749","https://openalex.org/W3025860244","https://openalex.org/W3047863327","https://openalex.org/W3088853939","https://openalex.org/W3177337956","https://openalex.org/W4212819272","https://openalex.org/W4226363157","https://openalex.org/W4285037282","https://openalex.org/W4293107948","https://openalex.org/W4313122055","https://openalex.org/W4366779566","https://openalex.org/W4377099260","https://openalex.org/W4382203174","https://openalex.org/W4387503929","https://openalex.org/W4388627140","https://openalex.org/W4391847761","https://openalex.org/W4399447274","https://openalex.org/W4399665688","https://openalex.org/W4400747844","https://openalex.org/W4403238270","https://openalex.org/W4403318044","https://openalex.org/W4403863644"],"related_works":[],"abstract_inverted_index":{"The":[0,107,127],"Traveling":[1],"Salesman":[2],"Problem":[3],"(TSP)":[4],"is":[5,178],"a":[6,75],"famous":[7],"combinatorial":[8],"optimization":[9,138],"problem.":[10],"Recent":[11],"research":[12],"has":[13],"proposed":[14],"an":[15,47,169],"anchor-based":[16,77,86,164,184],"supervised":[17,78],"learning":[18,79],"approach.":[19,165,185],"This":[20],"approach":[21,53,87],"predicts":[22,150],"\"anchors\",":[23],"which":[24,82,177],"are":[25,40],"defined":[26],"as":[27],"nodes":[28],"connected":[29],"to":[30,43,60],"their":[31],"nearest":[32],"neighbors":[33],"in":[34,67],"the":[35,85,93,101,116,147,158,162,182],"optimal":[36],"path.":[37],"These":[38],"anchors":[39,153],"then":[41],"used":[42],"generate":[44],"solutions":[45],"through":[46],"anchor":[48],"insertion":[49],"algorithm.":[50,106],"However,":[51],"this":[52,71],"requires":[54],"large":[55,119],"datasets":[56,120],"and":[57,100,114],"often":[58],"leads":[59],"limited":[61],"path":[62,132,141],"quality,":[63],"reducing":[64],"its":[65],"practicality":[66],"complex":[68],"scenarios.":[69],"In":[70],"paper,":[72],"we":[73],"propose":[74],"new":[76],"framework":[80,149],"SEAP-DAI,":[81],"improves":[83,131],"upon":[84],"by":[88,121,135,161],"introducing":[89],"two":[90],"key":[91],"components:":[92],"Spatially":[94],"Enhanced":[95],"Anchor":[96,103],"Prediction":[97],"(SEAP)":[98],"model":[99,109],"Dynamic":[102],"Insertion":[104],"(DAI)":[105],"SEAP":[108],"enhances":[110],"feature":[111],"extraction":[112],"efficiency":[113],"reduces":[115],"reliance":[117],"on":[118,174],"leveraging":[122],"advanced":[123],"neural":[124],"network":[125],"architectures.":[126],"DAI":[128],"algorithm":[129],"further":[130],"generation":[133],"quality":[134],"combining":[136],"global":[137],"with":[139],"local":[140],"strategies.":[142],"Experimental":[143],"results":[144],"show":[145],"that":[146],"SEAP-DAI":[148],"89.5%":[151],"of":[152,157,172],"using":[154],"only":[155],"1/25":[156],"dataset":[159],"required":[160],"original":[163,183],"Additionally,":[166],"it":[167],"achieves":[168],"average":[170],"gap":[171],"5.38%":[173],"TSPLIB":[175],"instances,":[176],"58.18%":[179],"less":[180],"than":[181]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-14T00:00:00"}