{"id":"https://openalex.org/W4399526333","doi":"https://doi.org/10.1109/access.2024.3412075","title":"A&I-ED-TSP: Association and Integration Encoder\u2013Decoder for Traveling Shortest Path Planning","display_name":"A&I-ED-TSP: Association and Integration Encoder\u2013Decoder for Traveling Shortest Path Planning","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4399526333","doi":"https://doi.org/10.1109/access.2024.3412075"},"language":"en","primary_location":{"id":"doi:10.1109/access.2024.3412075","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3412075","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2024.3412075","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101627306","display_name":"Bin Hu","orcid":"https://orcid.org/0000-0003-3400-407X"},"institutions":[{"id":"https://openalex.org/I4403386774","display_name":"Hebei Petroleum University of Technology","ror":"https://ror.org/02t67p115","country_code":null,"type":"education","lineage":["https://openalex.org/I4403386774"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bin Hu","raw_affiliation_strings":["Science and Technology Department, Hebei Petroleum University of Technology, Chengde, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Science and Technology Department, Hebei Petroleum University of Technology, Chengde, China","institution_ids":["https://openalex.org/I4403386774"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089468520","display_name":"Renjun Zhang","orcid":"https://orcid.org/0009-0002-3734-4766"},"institutions":[{"id":"https://openalex.org/I184843921","display_name":"Hebei University of Technology","ror":"https://ror.org/018hded08","country_code":"CN","type":"education","lineage":["https://openalex.org/I184843921"]},{"id":"https://openalex.org/I4403386774","display_name":"Hebei Petroleum University of Technology","ror":"https://ror.org/02t67p115","country_code":null,"type":"education","lineage":["https://openalex.org/I4403386774"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Renjun Zhang","raw_affiliation_strings":["Department of Foreign Languages and Tourism, Hebei Petroleum University of Technology, Chengde, China"],"raw_orcid":"https://orcid.org/0009-0002-3734-4766","affiliations":[{"raw_affiliation_string":"Department of Foreign Languages and Tourism, Hebei Petroleum University of Technology, Chengde, China","institution_ids":["https://openalex.org/I184843921","https://openalex.org/I4403386774"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.4087,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57678096,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"12","issue":null,"first_page":"129601","last_page":"129610"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9968000054359436,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9926999807357788,"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/T12707","display_name":"Vehicle License Plate Recognition","score":0.9628999829292297,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6902012825012207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6611417531967163},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5365427136421204},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4971306622028351},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42600440979003906},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4221789240837097},{"id":"https://openalex.org/keywords/association","display_name":"Association (psychology)","score":0.4145583510398865},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.362781822681427},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.30945152044296265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25373873114585876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21024200320243835},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20175597071647644},{"id":"https://openalex.org/keywords/psychology","display_name":"Psychology","score":0.06075340509414673},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.057190775871276855}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6902012825012207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6611417531967163},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5365427136421204},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4971306622028351},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42600440979003906},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4221789240837097},{"id":"https://openalex.org/C142853389","wikidata":"https://www.wikidata.org/wiki/Q744778","display_name":"Association (psychology)","level":2,"score":0.4145583510398865},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.362781822681427},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.30945152044296265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25373873114585876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21024200320243835},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20175597071647644},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.06075340509414673},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.057190775871276855},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2024.3412075","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3412075","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:a45c9beb566d456892386b215b487f5d","is_oa":true,"landing_page_url":"https://doaj.org/article/a45c9beb566d456892386b215b487f5d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 12, Pp 129601-129610 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2024.3412075","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2024.3412075","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1983172855","https://openalex.org/W2069323107","https://openalex.org/W2510569111","https://openalex.org/W2607264901","https://openalex.org/W2754599614","https://openalex.org/W2798467024","https://openalex.org/W2800649041","https://openalex.org/W2943857514","https://openalex.org/W2948433391","https://openalex.org/W2998057994","https://openalex.org/W3040879766","https://openalex.org/W3113123584","https://openalex.org/W3199469541","https://openalex.org/W3203460037","https://openalex.org/W4211046864","https://openalex.org/W4214813201","https://openalex.org/W4214849974","https://openalex.org/W4225013347","https://openalex.org/W4285037282","https://openalex.org/W4286982079","https://openalex.org/W4311475647","https://openalex.org/W4313444949","https://openalex.org/W4316467706","https://openalex.org/W4321113880","https://openalex.org/W4377223525","https://openalex.org/W4379057384","https://openalex.org/W4379117181","https://openalex.org/W4384831806","https://openalex.org/W4385539489","https://openalex.org/W4388627140","https://openalex.org/W4392413243","https://openalex.org/W6763838503","https://openalex.org/W6810575512","https://openalex.org/W6840458449"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"Traveling":[0,6,120],"shortest":[1],"path":[2],"planning,":[3],"encompassing":[4,59],"the":[5,20,56,63,71,95,119,130,143,163,167,180,185,192,196,200,221,243,286,311,317,329],"Salesman":[7,121],"Problem":[8],"(TSP)":[9],"in":[10,27,51,62,100,339],"graph":[11],"theory,":[12],"holds":[13],"profound":[14],"significance.":[15],"The":[16,156,172,234,264,291],"motivation":[17],"for":[18,117,253],"addressing":[19],"TSP":[21,254],"stems":[22],"from":[23],"its":[24],"critical":[25],"application":[26],"real-world":[28],"scenarios,":[29],"such":[30,344],"as":[31,345],"logistics,":[32],"where":[33],"optimal":[34,57],"routing":[35],"can":[36],"substantially":[37],"reduce":[38],"costs":[39],"and":[40,68,85,104,139,161,215,228,251,261,273,283,303,321,334],"improve":[41],"service":[42],"efficiency.":[43],"Furthermore,":[44],"TSP-like":[45],"challenges":[46],"play":[47],"a":[48,91,324],"pivotal":[49],"role":[50],"assisting":[52],"travelers":[53],"to":[54,327],"chart":[55],"itinerary,":[58],"all":[60],"landmarks":[61],"least":[64],"distance":[65],"or":[66],"time":[67,84],"concluding":[69],"at":[70],"departure":[72],"site.":[73],"This":[74],"optimization":[75,194],"not":[76],"only":[77],"streamlines":[78],"travel":[79],"routes":[80],"but":[81],"also":[82],"economizes":[83],"energy,":[86],"ensuring":[87],"maximal":[88],"sightseeing":[89],"within":[90],"confined":[92],"timeframe.":[93],"Recognizing":[94],"limitations":[96,330],"of":[97,166,188,195,246,256,278,331],"current":[98,176],"solutions":[99],"achieving":[101],"high":[102],"efficiency":[103],"accuracy":[105,320],"simultaneously,":[106],"we":[107,203],"propose":[108],"an":[109],"innovative":[110],"Association":[111],"&":[112],"Integration-based":[113],"Encoder\u2013Decoder":[114],"structure":[115,126,241,314],"tailored":[116],"solving":[118,340],"Problem,":[122],"i.e.,":[123],"A&I-ED-TSP.The":[124],"proposed":[125,222,312],"comprises":[127],"four":[128],"blocks:":[129],"information":[131,144,151],"linkage":[132,145],"space,":[133],"dual-path":[134,157],"integration":[135,158],"encoder,":[136,138],"node":[137,173],"representation":[140,181],"decoder.":[141],"Specifically,":[142],"space":[146],"constructs":[147],"associations":[148],"among":[149],"hidden":[150],"between":[152],"input":[153],"sequence":[154,168,177,189],"samples.":[155],"encoder":[159,174],"extracts":[160,175],"merges":[162],"original":[164],"representations":[165],"with":[169,224],"associated":[170],"representations.":[171],"representations,":[178],"while":[179],"decoder":[182],"block":[183],"computes":[184],"probability":[186],"distribution":[187],"samples,":[190],"completing":[191],"combinatorial":[193,342],"entire":[197],"sequence.":[198],"In":[199],"experimental":[201,235],"evaluation,":[202],"utilized":[204],"three":[205],"different":[206],"metrics:":[207],"Average":[208],"Tour":[209],"Length":[210],"(ATL),":[211],"Optimality":[212],"Gap":[213],"(OG),":[214],"Evaluation":[216],"Time":[217],"(ET).":[218],"We":[219],"compared":[220],"method":[223],"classical":[225],"approximation":[226],"methods":[227],"various":[229],"state-of-the-art":[230],"deep":[231],"learning":[232,337],"approaches.":[233],"results":[236,308],"show":[237],"that":[238,310],"our":[239],"A&I-ED-TSP":[240,313],"achieved":[242],"best":[244,266,287,292],"ATLs":[245],"5.704,":[247],"12.770,":[248],"17.981,":[249],"21.979,":[250],"25.293":[252],"instances":[255],"TSP50,":[257],"TSP250,":[258],"TSP500,":[259],"TSP750,":[260],"TSP1000,":[262],"respectively.":[263,306],"corresponding":[265],"OGs":[267],"were":[268,294],"0.06%,":[269],"8.09%,":[270],"8.57%,":[271],"9.17%,":[272],"9.41%,":[274],"respectively,":[275],"representing":[276],"improvements":[277],"2.83%,":[279],"0.68%,":[280],"2.47%,":[281],"2.91%,":[282],"3.63%":[284],"over":[285],"previous":[288],"comprehensive":[289],"method.":[290],"ETs":[293],"2.15":[295],"seconds,":[296,298,300,302,305],"19.24":[297],"45.81":[299],"97.03":[301],"213.97":[304],"Experimental":[307],"demonstrate":[309],"significantly":[315],"enhances":[316],"model\u2019s":[318],"solution":[319],"efficiency,":[322],"offering":[323],"promising":[325],"approach":[326],"overcoming":[328],"traditional":[332],"algorithms":[333],"recent":[335],"machine":[336],"models":[338],"complex":[341],"problems":[343],"TSP.":[346]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2024-06-12T00:00:00"}