{"id":"https://openalex.org/W3199951936","doi":"https://doi.org/10.1109/ijcnn52387.2021.9533472","title":"Extended Attention Mechanism for TSP Problem","display_name":"Extended Attention Mechanism for TSP Problem","publication_year":2021,"publication_date":"2021-07-18","ids":{"openalex":"https://openalex.org/W3199951936","doi":"https://doi.org/10.1109/ijcnn52387.2021.9533472","mag":"3199951936"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn52387.2021.9533472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn52387.2021.9533472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5113044822","display_name":"Hua Yang","orcid":"https://orcid.org/0000-0003-0351-355X"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hua Yang","raw_affiliation_strings":["School of Software Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Software Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113044822"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":1.0878,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79044727,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9940999746322632,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9901999831199646,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.922160267829895},{"id":"https://openalex.org/keywords/mechanism","display_name":"Mechanism (biology)","score":0.6569963693618774},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6543436050415039},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5871455669403076},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5768641829490662},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.5654873847961426},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5405967831611633},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5096769332885742},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.494730681180954},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.4824834167957306},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.46938273310661316},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.41148704290390015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27462294697761536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24341246485710144},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.18923106789588928},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08191695809364319}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.922160267829895},{"id":"https://openalex.org/C89611455","wikidata":"https://www.wikidata.org/wiki/Q6804646","display_name":"Mechanism (biology)","level":2,"score":0.6569963693618774},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6543436050415039},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5871455669403076},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5768641829490662},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.5654873847961426},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5405967831611633},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5096769332885742},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.494730681180954},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.4824834167957306},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.46938273310661316},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.41148704290390015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27462294697761536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24341246485710144},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.18923106789588928},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08191695809364319},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn52387.2021.9533472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn52387.2021.9533472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.8399999737739563}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W307896644","https://openalex.org/W1571087346","https://openalex.org/W1593916827","https://openalex.org/W1596059437","https://openalex.org/W1597286183","https://openalex.org/W1902237438","https://openalex.org/W1990313671","https://openalex.org/W2053913299","https://openalex.org/W2069323107","https://openalex.org/W2078744297","https://openalex.org/W2117666205","https://openalex.org/W2121863487","https://openalex.org/W2130942839","https://openalex.org/W2133564696","https://openalex.org/W2507756961","https://openalex.org/W2566505556","https://openalex.org/W2607264901","https://openalex.org/W2912555327","https://openalex.org/W2948268323","https://openalex.org/W2951846985","https://openalex.org/W2952332632","https://openalex.org/W2962979969","https://openalex.org/W2963403868","https://openalex.org/W2964308564","https://openalex.org/W2987288550","https://openalex.org/W3034214690","https://openalex.org/W3040484737","https://openalex.org/W3097400948","https://openalex.org/W4214717370","https://openalex.org/W4295138992","https://openalex.org/W4385245566","https://openalex.org/W6679434410","https://openalex.org/W6679436768","https://openalex.org/W6725207838","https://openalex.org/W6730742100","https://openalex.org/W6739901393","https://openalex.org/W6748487558","https://openalex.org/W6758687306","https://openalex.org/W6763777643","https://openalex.org/W6769975600","https://openalex.org/W6779874303"],"related_works":["https://openalex.org/W2946024655","https://openalex.org/W4200179302","https://openalex.org/W2758988501","https://openalex.org/W2189435634","https://openalex.org/W4246557197","https://openalex.org/W2081878758","https://openalex.org/W3013791021","https://openalex.org/W2123233098","https://openalex.org/W1987671593","https://openalex.org/W2146364482"],"abstract_inverted_index":{"The":[0,121],"attention":[1,64,127,138],"mechanism":[2,65,128,142],"has":[3],"shown":[4],"good":[5],"performance":[6],"in":[7,53],"many":[8],"aspects":[9],"such":[10,71],"as":[11,72,105],"machine":[12],"translation.":[13],"But":[14],"it":[15],"is":[16,30],"not":[17,49],"completely":[18],"suitable":[19],"for":[20],"combinatorial":[21,68],"optimization":[22,69],"problems.":[23],"In":[24],"the":[25,35,44,54,63,73,92,106,111,114,125,136],"Traveling":[26],"Salesman":[27],"Problem(TSP),":[28],"there":[29],"no":[31],"need":[32],"to":[33,52,66,83,132,150],"consider":[34],"city":[36,45,89,98],"nodes":[37],"that":[38,47,124],"have":[39,48],"been":[40,50],"traveled,":[41],"but":[42],"only":[43],"ones":[46],"traveled":[51],"future.":[55],"To":[56],"address":[57],"this":[58,60],"problem,":[59],"paper":[61],"extends":[62],"solve":[67],"problems":[70],"traveling":[74],"salesman":[75],"problem.":[76],"We":[77],"train":[78],"a":[79,85,95,117],"Gated":[80],"Recurrent":[81],"Unit(GRU)":[82],"predict":[84],"distribution":[86],"over":[87],"different":[88],"permutations":[90],"with":[91,148],"input":[93],"of":[94,97,113],"set":[96],"coordinates,":[99],"and":[100,109,139],"use":[101],"negative":[102],"tour":[103],"length":[104],"reward":[107],"signal,":[108],"optimize":[110],"parameters":[112],"GRU":[115],"using":[116],"policy":[118],"gradient":[119],"method.":[120],"experiments":[122],"demonstrate":[123],"extended":[126],"achieves":[129],"more":[130],"close":[131],"optimum":[133],"solutions":[134],"than":[135],"globe":[137],"local":[140],"attentional":[141],"on":[143],"two-dimension":[144],"planar":[145],"space":[146],"graphs":[147],"up":[149],"100":[151],"nodes.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}