{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T08:31:36Z","timestamp":1773477096408,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3412075","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T18:38:04Z","timestamp":1718131084000},"page":"129601-129610","source":"Crossref","is-referenced-by-count":2,"title":["A&I-ED-TSP: Association and Integration Encoder\u2013Decoder for Traveling Shortest Path Planning"],"prefix":"10.1109","volume":"12","author":[{"given":"Bin","family":"Hu","sequence":"first","affiliation":[{"name":"Science and Technology Department, Hebei Petroleum University of Technology, Chengde, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3734-4766","authenticated-orcid":false,"given":"Renjun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Foreign Languages and Tourism, Hebei Petroleum University of Technology, Chengde, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2022.102710"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22127-9_1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/a16010058"},{"key":"ref4","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1998"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.07.022"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-023-01097-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/net.21864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.iswa.2023.200242"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105726"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3147924"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101056"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12767-1_5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2023.3277768"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2023.3282313"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.02.014"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3105905"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17476"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3000236"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8079-6_41"},{"key":"ref20","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"Joshi","year":"2019","journal-title":"arXiv:1906.01227"},{"key":"ref21","first-page":"1","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Khalil"},{"key":"ref22","article-title":"DAN: Decentralized attention-based neural network for the MinMax multiple traveling salesman problem","author":"Cao","year":"2021","journal-title":"arXiv:2109.04205"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2018.04.009"},{"key":"ref24","article-title":"Multi-objective pointer network for combinatorial optimization","author":"Gao","year":"2022","journal-title":"arXiv:2204.11860"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1153-7_1068"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110144"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2003.11.008"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799275"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.55606\/jurrimipa.v2i2.1614"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106244"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0260995"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10552761.pdf?arnumber=10552761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T05:38:34Z","timestamp":1727242714000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10552761\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3412075","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}