{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:06:29Z","timestamp":1777921589954,"version":"3.51.4"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Project of China","award":["2020YFA0714300"],"award-info":[{"award-number":["2020YFA0714300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62473098"],"award-info":[{"award-number":["62473098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62203108"],"award-info":[{"award-number":["62203108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62576098"],"award-info":[{"award-number":["62576098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62473216"],"award-info":[{"award-number":["62473216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12326311"],"award-info":[{"award-number":["12326311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Southeast University Interdisciplinary Research Program for Young Scholars, the Fundamental Research Funds for the Central Universities","award":["2242025F10002"],"award-info":[{"award-number":["2242025F10002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/tai.2025.3630620","type":"journal-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T18:51:47Z","timestamp":1762800707000},"page":"2908-2919","source":"Crossref","is-referenced-by-count":0,"title":["MGLAN: A Mamba-Like Gated Linear Attention With Normalization for Solving CTSP"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-8626-9931","authenticated-orcid":false,"given":"Chengda","family":"Wen","sequence":"first","affiliation":[{"name":"School of Cyber Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8676-0195","authenticated-orcid":false,"given":"Xiangping","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Mathematics, Hohai University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4443-608X","authenticated-orcid":false,"given":"Xinli","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering and the National Center for Applied Mathematics in Jiangsu, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3133-7119","authenticated-orcid":false,"given":"Jinde","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Mathematics, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7739-3733","authenticated-orcid":false,"given":"Liang","family":"Hua","sequence":"additional","affiliation":[{"name":"Purple Mountain Laboratories, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"The Traveling Salesman Problem and Its Variations","volume":"12","author":"Gutin","year":"2006"},{"key":"ref2","first-page":"75","article-title":"Combinatorial optimization","volume":"10","author":"Cook","year":"1994","journal-title":"Unpublished Manuscript"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3087666"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3008612"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCPMT.2013.2252429"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2021.102359"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.3.628"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2013.112"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2371918"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2706720"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2022.105677"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.2972389"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2023.3337248"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2024.3476696"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3147924"},{"key":"ref17","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Vinyals","year":"2015"},{"key":"ref18","first-page":"1","article-title":"Neural combinatorial optimization with reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Bello","year":"2017"},{"key":"ref19","first-page":"1","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kool","year":"2018"},{"key":"ref20","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":"ref21","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0141"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17430"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.05.003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i7.25982"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26120"},{"key":"ref26","first-page":"61804","article-title":"MVMoE: Multi-task vehicle routing solver with mixture-of-experts","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhou","year":"2024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1851"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30009"},{"key":"ref29","first-page":"465","article-title":"Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning","volume-title":"Proc. Asian Conf. Mach. Learn.","author":"D O Costa","year":"2020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17476"},{"key":"ref31","first-page":"7472","article-title":"NeuroLKH: Combining deep learning model with Lin-Kernighan-Helsgaun heuristic for solving the traveling salesman problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Xin","year":"2021"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"ref33","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":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF00339943"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(88)90002-0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2024.3461630"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1049\/cim2.12072"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.52202\/079017-4039"},{"key":"ref41","first-page":"9099","article-title":"Transformer quality in linear time","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hua","year":"2022"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.emnlp-main.473"},{"key":"ref43","article-title":"TransNormerLLM: A faster and better large language model with improved transnormer","author":"Qin","year":"2023"},{"key":"ref44","first-page":"2211","article-title":"The reversible residual network: Backpropagation without storing activations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Gomez","year":"2017"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref46","article-title":"Instance normalization: The missing ingredient for fast stylization","author":"Ulyanov","year":"2016"},{"key":"ref47","article-title":"Gaussian error linear units (GELUs)","author":"Hendrycks","year":"2016"},{"key":"ref48","first-page":"5156","article-title":"Transformers are RNNs: Fast autoregressive transformers with linear attention","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Katharopoulos","year":"2020"},{"key":"ref49","first-page":"1","article-title":"Cosformer: Rethinking softmax in attention","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Qin","year":"2022"},{"key":"ref50","first-page":"1","article-title":"Mamba: Linear-time sequence modeling with selective state spaces","volume-title":"Proc. 1st Conf. Language Model.","author":"Gu","year":"2024"},{"key":"ref51","first-page":"10041","article-title":"Transformers are SSMs: Generalized models and efficient algorithms through structured state space duality","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dao","year":"2024"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref53","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"key":"ref54","article-title":"Gurobi optimizer reference manual","year":"2021"},{"key":"ref55","article-title":"Cardinal optimizer (COPT) user guide","author":"Ge","year":"2022"},{"key":"ref56","article-title":"OR-Tools CP-SAT solver","author":"Perron","year":"2023"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9078688\/11503071\/11235972.pdf?arnumber=11235972","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T19:57:10Z","timestamp":1777665430000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11235972\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":56,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tai.2025.3630620","relation":{},"ISSN":["2691-4581"],"issn-type":[{"value":"2691-4581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}