{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:59:40Z","timestamp":1763665180934,"version":"3.45.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Institute of Information & Communications Technology Planning & Evaluation"},{"name":"Information Technology Research Center"},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["IITP-2025-RS-2024-00437268"],"award-info":[{"award-number":["IITP-2025-RS-2024-00437268"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korea Government","award":["RS-2024-00334171"],"award-info":[{"award-number":["RS-2024-00334171"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1109\/lra.2025.3632724","type":"journal-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T18:51:27Z","timestamp":1763146287000},"page":"137-144","source":"Crossref","is-referenced-by-count":0,"title":["A Multi-View Attention-Based Encoder-Decoder Framework for Clustered Traveling Salesman Problem"],"prefix":"10.1109","volume":"11","author":[{"given":"Jimin","family":"Park","sequence":"first","affiliation":[{"name":"Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8931-9768","authenticated-orcid":false,"given":"Inguk","family":"Choi","sequence":"additional","affiliation":[{"name":"Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7190-3264","authenticated-orcid":false,"given":"Hyun-Jung","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102834"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CASE56687.2023.10260631"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2950626"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(75)90015-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2876191"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600746"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.07.022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CAC53003.2021.9727313"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90309-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00127356"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S1007-0214(07)70068-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.12.018"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.1.45"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3334976"},{"key":"ref16","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kool","year":"2019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref18","first-page":"21188","article-title":"POMO: Policy optimization with multiple optima for reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Kwon","year":"2020"},{"key":"ref19","first-page":"1936","article-title":"Sym-NCO: Leveraging symmetricity for neural combinatorial optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Kim","year":"2022"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.25982"},{"key":"ref21","first-page":"8845","article-title":"Neural combinatorial optimization with heavy decoder: Toward large scale generalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Luo","year":"2023"},{"key":"ref22","article-title":"Boosting neural combinatorial optimization for large-scale vehicle routing problems","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Luo","year":"2025"},{"key":"ref23","article-title":"Rethinking light decoder-based solvers for vehicle routing problems","volume-title":"Proc. 13th Int. Conf. Learn. Representations","author":"Huang","year":"2025"},{"key":"ref24","first-page":"61804","article-title":"MVMoE: Multi-task vehicle routing solver with mixture-of-experts","volume-title":"Int. Conf. Mach. Learn.","author":"Zhou","year":"2024"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3672040"},{"key":"ref26","article-title":"How attentive are graph attention networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Brody","year":"2022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045167"},{"article-title":"Neural combinatorial optimization with reinforcement learning","year":"2016","author":"Bello","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342080"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA57147.2024.10610858"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2025.3534682"},{"issue":"4","key":"ref33","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/11250609\/11248888.pdf?arnumber=11248888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:43:53Z","timestamp":1763664233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11248888\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":33,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/lra.2025.3632724","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2026,1]]}}}