{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:51:42Z","timestamp":1770295902585,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":32,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819665846","type":"print"},{"value":"9789819665853","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-6585-3_7","type":"book-chapter","created":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T14:41:51Z","timestamp":1750689711000},"page":"89-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fusion of\u00a0Multi-level Information: Solve Large-Scale Traveling Salesman Problem with\u00a0an\u00a0Efficient Framework"],"prefix":"10.1007","author":[{"given":"Wenzhao","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Congying","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiande","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoran","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zicheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,24]]},"reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.ejor.2004.06.040","volume":"169","author":"TP Bagchi","year":"2006","unstructured":"Bagchi, T.P., Gupta, J., Sriskandarajah, C.: A review of TSP based approaches for flowshop scheduling. Eur. J. Oper. Res. 169(3), 816\u2013854 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Anbuudayasankar, S.P.,\u00a0Ganesh, K., Mohapatra, S.: Models for practical routing problems in logistics. Design and Practices Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-05035-5"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/abe665","volume":"6","author":"A Paler","year":"2021","unstructured":"Paler, A., Zulehner, A., Wille, R.: NISQ circuit compilation is the travelling salesman problem on a torus. Quant. Sci. Technol. 6(2), 025016 (2021)","journal-title":"Quant. Sci. Technol."},{"key":"7_CR4","unstructured":"Fekete, S.P.: Simplicity and hardness of the maximum traveling salesman problem under geometric distances. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 337\u2013345 (1999)"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.orl.2008.09.006","volume":"37","author":"DL Applegate","year":"2009","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W., Espinoza, D.G., Goycoolea, M., Helsgaun, K.: Certification of an optimal tsp tour through 85,900 cities. Oper. Res. Lett. 37(1), 11\u201315 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"7_CR6","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JJ Bentley","year":"1992","unstructured":"Bentley, J.J.: Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4(4), 387\u2013411 (1992)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"7_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-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR9","first-page":"966","volume":"12","author":"K Helsgaun","year":"2017","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Roskilde Roskilde Univ. 12, 966\u2013980 (2017)","journal-title":"Roskilde Roskilde Univ."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2009.10.002","volume":"204","author":"T Garaix","year":"2010","unstructured":"Garaix, T., Artigues, C., Feillet, D., Josselin, D.: Vehicle routing problems with alternative paths: an application to on-demand transportation. Eur. J. Oper. Res. 204(1), 62\u201375 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/TMECH.2015.2493980","volume":"21","author":"X Li","year":"2015","unstructured":"Li, X., Sun, Z., Cao, D., He, Z., Zhu, Q.: Real-time trajectory planning for autonomous urban driving: framework, algorithms, and verifications. IEEE\/ASME Trans. Mechatron. 21(2), 740\u2013753 (2015)","journal-title":"IEEE\/ASME Trans. Mechatron."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Guo, T., Han, C., Tang, S., Ding, M.: Solving combinatorial problems with machine learning methods. In: Nonlinear Combinatorial Optimization, pp. 207\u2013229 (2019)","DOI":"10.1007\/978-3-030-16194-1_9"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR14","unstructured":"Lu, H., Zhang, X., Yang, S.: A learning-based iterative method for solving vehicle routing problems. In: International Conference on Learning Representations (2019)"},{"key":"7_CR15","unstructured":"Costa, P.R.d.O., Rhuggenaath, J., Zhang, Y., Akcay, A.: Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning. In: Asian Conference on Machine Learning, pp. 465\u2013480. PMLR (2020)"},{"key":"7_CR16","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":"7_CR17","unstructured":"Kool, W., Van\u00a0Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Zhang-Hua, F., Qiu, K.-B., Zha, H.: Generalize a small pre-trained model to arbitrarily large tsp instances. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 7474\u20137482 (2021)","DOI":"10.1609\/aaai.v35i8.16916"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s43069-021-00101-z","volume":"3","author":"N Christofides","year":"1976","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Oper. Res. Forum 3, 20 (1976)","journal-title":"Oper. Res. Forum"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Jiang, J., Gao, J., Li, G., Wu, C., Pei, Z.: Hierarchical solving method for large scale TSP problems. In: Zeng, Z., Li, Y., King, I. (eds.) Advances in Neural Networks \u2013 ISNN 2014, pp. 252\u2013261. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-12436-0_28"},{"key":"7_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106548","volume":"165","author":"VV Romanuke","year":"2024","unstructured":"Romanuke, V.V.: Deep clustering of the traveling salesman problem to parallelize its solution. Comput. Oper. Res. 165, 106548 (2024)","journal-title":"Comput. Oper. Res."},{"key":"7_CR23","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. Adv. Neural Inf. Process. Syst. 28 (2015)"},{"key":"7_CR24","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B.,\u00a0Song, L.: Learning combinatorial optimization algorithms over graphs. Adv. Neural Inf. Process. Syst. 30 (2017)"},{"key":"7_CR25","first-page":"21188","volume":"33","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. Adv. Neural. Inf. Process. Syst. 33, 21188\u201321198 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"7_CR26","unstructured":"Bresson, X., Laurent, T.: The transformer network for the traveling salesman problem. arXiv preprint arXiv:2103.03012 (2021)"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8, 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Ouyang, W., Wang, Y., Han, S., Jin, Z., Weng, P.: Improving generalization of deep reinforcement learning-based TSP solvers. In: 2021 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 01\u201308. IEEE (2021)","DOI":"10.1109\/SSCI50451.2021.9659970"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Jin, Y., et al.: PointerFormer: deep reinforced multi-pointer transformer for the traveling salesman problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, pp. 8132\u20138140 (2023)","DOI":"10.1609\/aaai.v37i7.25982"},{"key":"7_CR30","first-page":"23609","volume":"34","author":"Y Ma","year":"2021","unstructured":"Ma, Y., et al.: A hierarchical reinforcement learning based optimization framework for large-scale dynamic pickup and delivery problems. Adv. Neural. Inf. Process. Syst. 34, 23609\u201323620 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Pan, X., et al.: H-TSP: hierarchically solving the large-scale traveling salesman problem. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, pp. 9345\u20139353 (2023)","DOI":"10.1609\/aaai.v37i8.26120"},{"issue":"9","key":"7_CR32","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1109\/TPAMI.2015.2389824","volume":"37","author":"K He","year":"2015","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Spatial pyramid pooling in deep convolutional networks for visual recognition. IEEE Trans. Pattern Anal. Mach. Intell. 37(9), 1904\u20131916 (2015)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-6585-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T14:41:57Z","timestamp":1750689717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-6585-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819665846","9789819665853"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-6585-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"24 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Auckland","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iconip2024.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}