{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T07:04:47Z","timestamp":1784012687974,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819234431","type":"print"},{"value":"9789819234448","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-981-92-3444-8_46","type":"book-chapter","created":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T06:18:13Z","timestamp":1784009893000},"page":"559-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Neural TSP Solver with Translation-Invariant and Clustering-Aware Mechanisms"],"prefix":"10.1007","author":[{"given":"Jiangtao","family":"Ye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoping","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fengjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenhui","family":"Lou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenbo","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,15]]},"reference":[{"key":"46_CR1","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","author":"O Vinyals","year":"2015","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems (NeurIPS) (2015)"},{"key":"46_CR2","volume-title":"International Conference on Learning Representations (ICLR)","author":"W Kool","year":"2019","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (ICLR) (2019)"},{"key":"46_CR3","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","author":"Y-D Kwon","year":"2020","unstructured":"Kwon, Y.-D., Choo, J., Kim, B., Yoon, I., Gwon, Y., Min, S.: POMO: policy optimization with multiple optima for reinforcement learning. In: Advances in Neural Information Processing Systems (NeurIPS) (2020)"},{"issue":"2","key":"46_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1093\/oxfordjournals.aob.a083391","volume":"18","author":"B Hopkins","year":"1954","unstructured":"Hopkins, B., Skellam, J.G.: A new method for determining the type of distribution of plant individuals. Ann. Bot. 18(2), 213\u2013227 (1954)","journal-title":"Ann. Bot."},{"key":"46_CR5","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2006)"},{"key":"46_CR6","volume-title":"\"Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem,\" Management Sciences Research Report 388","author":"N Christofides","year":"1976","unstructured":"Christofides, N.: \"Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem,\" Management Sciences Research Report 388. Carnegie Mellon University (1976)"},{"issue":"2","key":"46_CR7","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"1","key":"46_CR8","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin\u2013Kernighan heuristic for the traveling salesman problem. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"46_CR9","volume-title":"An Extension of the Lin\u2013Kernighan\u2013Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems, Technical Report","author":"K Helsgaun","year":"2017","unstructured":"Helsgaun, K.: An Extension of the Lin\u2013Kernighan\u2013Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems, Technical Report. Roskilde University (2017)"},{"issue":"5","key":"46_CR10","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM. 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"46_CR11","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940. (2016)"},{"key":"46_CR12","unstructured":"Vaswani, A., et al.: Attention is all you need. arXiv preprint arXiv:1706.03762. (2017)"},{"key":"46_CR13","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","author":"M Kim","year":"2022","unstructured":"Kim, M., Park, J., Park, J.: Sym-NCO: leveraging symmetricity for neural combinatorial optimization. In: Advances in Neural Information Processing Systems (NeurIPS) (2022)"},{"key":"46_CR14","unstructured":"Bresson, X., Laurent, T.: The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03123. (2021)"},{"key":"46_CR15","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","author":"Y Ma","year":"2021","unstructured":"Ma, Y., et al.: Learning to iteratively solve routing problems with dual-aspect collaborative transformer. In: Advances in Neural Information Processing Systems (NeurIPS) (2021)"},{"key":"46_CR16","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the traveling salesman problem. arXiv preprint arXiv:1906.01227. (2019)"},{"key":"46_CR17","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","author":"Z Li","year":"2018","unstructured":"Li, Z., Chen, Q., Koltun, V.: Combinatorial optimization with graph convolutional networks and guided tree search. In: Advances in Neural Information Processing Systems (NeurIPS) (2018)"},{"key":"46_CR18","volume-title":"NeurIPS","author":"L Xin","year":"2021","unstructured":"Xin, L., Song, W., Cao, Z., Zhang, J.: NeuroLKH: combining deep learning model with Lin\u2013Kernighan\u2013Helsgaun heuristic for solving the traveling salesman problem. In: NeurIPS (2021)"},{"key":"46_CR19","volume-title":"International Conference on Learning Representations (ICLR)","author":"B Hudson","year":"2022","unstructured":"Hudson, B., Li, Q., Malencia, M., Prorok, A.: Graph neural network guided local search for the traveling salesperson problem. In: International Conference on Learning Representations (ICLR). Poster (2022)"},{"key":"46_CR20","volume-title":"Proceedings of the Asian Conference on Machine Learning (ACML)","author":"PRO da Costa","year":"2020","unstructured":"da Costa, P.R.O., Rhuggenaath, J., Zhang, Y., Akcay, A.: Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning. In: Proceedings of the Asian Conference on Machine Learning (ACML), vol. 129. PMLR (2020)"},{"key":"46_CR21","doi-asserted-by":"publisher","first-page":"7982","DOI":"10.1007\/s10489-024-05603-x","volume":"54","author":"M Jung","year":"2024","unstructured":"Jung, M., Lee, J., Kim, J.: A lightweight CNN\u2013transformer model for learning traveling salesman problems. Appl. Intell. 54, 7982\u20137993 (2024). https:\/\/doi.org\/10.1007\/s10489-024-05603-x","journal-title":"Appl. Intell."},{"key":"46_CR22","volume-title":"CPAIOR Workshop","author":"M Deudon","year":"2018","unstructured":"Deudon, M., Cournut, A., Vidal, A., Mairal, L., de Almeida, N.R., Joshi, J.: Learning heuristics for the TSP by policy gradient. In: CPAIOR Workshop (2018)"},{"key":"46_CR23","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)","author":"C Gao","year":"2024","unstructured":"Gao, C., Cao, Z., Nazari, M., Pavone, M.: Towards generalizable neural solvers for vehicle routing problems via ensemble with transferable local policy. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) (2024)"},{"key":"46_CR24","volume-title":"Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)","author":"YL Goh","year":"2024","unstructured":"Goh, Y.L., Cao, Z., Ma, Y., Dong, Y., Dupty, M.H., Lee, W.S.: Hierarchical neural constructive solver for real-world TSP scenarios. In: Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (2024)"},{"issue":"3\u20134","key":"46_CR25","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1022672621406","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8(3\u20134), 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"issue":"4","key":"46_CR26","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014A traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991). https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J. Comput."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-3444-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T06:18:16Z","timestamp":1784009896000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3444-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,15]]},"ISBN":["9789819234431","9789819234448"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3444-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,15]]},"assertion":[{"value":"15 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2026a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2026\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}