{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:33:26Z","timestamp":1772120006716,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T00:00:00Z","timestamp":1735171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T00:00:00Z","timestamp":1735171200000},"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":["SIViP"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s11760-024-03709-w","type":"journal-article","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T11:31:18Z","timestamp":1735212678000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving method of traveling salesman problem based on performer graph self-attention mechanism"],"prefix":"10.1007","volume":"19","author":[{"given":"Han","family":"Li","sequence":"first","affiliation":[]},{"given":"Duan","family":"Qianqian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,26]]},"reference":[{"key":"3709_CR1","doi-asserted-by":"crossref","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial optimization (1997)","DOI":"10.1002\/9781118033142"},{"key":"3709_CR2","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity (1981)"},{"key":"3709_CR3","unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, Two Volume Set (1995)"},{"key":"3709_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02604639","volume":"38","author":"A Bouchet","year":"1987","unstructured":"Bouchet, A.: Greedy algorithm and symmetric matroids. Math. Program. 38, 147\u2013159 (1987)","journal-title":"Math. Program."},{"key":"3709_CR5","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M.: Ant Colony Optimization. Handbook of Machine Learning (2001)"},{"key":"3709_CR6","doi-asserted-by":"crossref","unstructured":"Botsal\u0131, A.R., Alaykiran, K.: Analysis of TSP: Simulated Annealing and Genetic Algorithm Approaches (2020)","DOI":"10.22399\/ijcesen.637445"},{"key":"3709_CR7","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine Learning for Combinatorial Optimization: a Methodological Tour d\u2019Horizon. ArXiv, abs\/1811.06128 (2018)"},{"key":"3709_CR8","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural Combinatorial Optimization with Reinforcement Learning. ArXiv, abs\/1611.09940 (2016)"},{"key":"3709_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield, J.J., Tank, D.W.: \u201cNeural\u201d computation of decisions in optimization problems. Biol. Cybern. 52, 141\u2013152 (1985)","journal-title":"Biol. Cybern."},{"key":"3709_CR10","unstructured":"Khalil, E.B., Dai, H., Zhang, Y., Dilkina, B.N., Song, L.: Learning Combinatorial Optimization Algorithms over Graphs. ArXiv, abs\/1704.01665 (2017)"},{"key":"3709_CR11","unstructured":"Dai, H., Dai, B., Song, L.: Discriminative Embeddings of Latent Variable Models for Structured Data. ArXiv, abs\/1603.05629 (2016)"},{"key":"3709_CR12","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A.A., Veness, J., Bellemare, M.G., Graves, A., Riedmiller, M.A., Fidjeland, A.K., Ostrovski, G., Petersen, S., Beattie, C., Sadik, A., Antonoglou, I., King, H., Kumaran, D., Wierstra, D., Legg, S., Hassabis, D.: Human-level control through deep reinforcement learning. Nature 518, 529\u2013533 (2015)","journal-title":"Nature"},{"key":"3709_CR13","unstructured":"Vaswani, A., Shazeer, N.M., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is All you Need. Neural Information Processing Systems (2017)"},{"key":"3709_CR14","doi-asserted-by":"crossref","unstructured":"Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., Rousseau, L.: Learning Heuristics for the TSP by Policy Gradient. Integration of AI and OR Techniques in Constraint Programming (2018)","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"3709_CR15","unstructured":"Kool, W., Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (2018)"},{"key":"3709_CR16","unstructured":"Bresson, X., Laurent, T.: The Transformer Network for the Traveling Salesman Problem. ArXiv, abs\/2103.03012 (2021)"},{"key":"3709_CR17","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem. ArXiv, abs\/1906.01227 (2019)"},{"key":"3709_CR18","unstructured":"Ma, Q., Ge, S., He, D., Thaker, D.D., Drori, I.: Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning. ArXiv, abs\/1911.04936 (2019)"},{"key":"3709_CR19","unstructured":"Pan, X., Jin, Y., Ding, Y., Feng, M., Zhao, L., Song, L., Bian, J.: H-TSP: Hierarchically Solving the Large-Scale Travelling Salesman Problem. ArXiv, abs\/2304.09395 (2023)"},{"key":"3709_CR20","unstructured":"Cheng, H., Zheng, H., Cong, Y., Jiang, W., Pu, S.: Select and Optimize: Learning to aolve large-scale TSP instances. International Conference on Artificial Intelligence and Statistics (2023)"},{"key":"3709_CR21","unstructured":"Fu, Z., Qiu, K., Zha, H.: Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances. ArXiv, abs\/2012.10658 (2020)"},{"key":"3709_CR22","unstructured":"Lu, H., Zhang, X., Yang, S.: A Learning-based Iterative Method for Solving Vehicle Routing Problems. International Conference on Learning Representations (2020)"},{"key":"3709_CR23","doi-asserted-by":"publisher","first-page":"13142","DOI":"10.1109\/TCYB.2021.3103811","volume":"52","author":"K Li","year":"2021","unstructured":"Li, K., Zhang, T., Wang, R., Wang, Y., Han, Y.: Deep reinforcement learning for combinatorial optimization: covering salesman problems. IEEE Trans. Cybern. 52, 13142\u201313155 (2021)","journal-title":"IEEE Trans. Cybern."},{"key":"3709_CR24","unstructured":"Qiu, R., Sun, Z., Yang, Y.: DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems. ArXiv, abs\/2210.04123 (2022)"},{"key":"3709_CR25","doi-asserted-by":"crossref","unstructured":"Jin, Y., Ding, Y., Pan, X., He, K., Zhao, L., Qin, T., Song, L., Bian, J.: Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem. AAAI Conference on Artificial Intelligence (2023)","DOI":"10.1609\/aaai.v37i7.25982"},{"key":"3709_CR26","unstructured":"Zhou, C., Lin, X., Wang, Z., Tong, X., Yuan, M., Zhang, Q.: Instance-Conditioned Adaptation for Large-scale Generalization of Neural Combinatorial Optimization. ArXiv, abs\/2405.01906 (2024)"},{"key":"3709_CR27","unstructured":"Park, W., Chang, W., Lee, D., Kim, J.: Graph Self-Attention for learning graph representation with Transformer. ArXiv, abs\/2201.12787 (2022)"},{"key":"3709_CR28","unstructured":"Choromanski, K., Likhosherstov, V., Dohan, D., Song, X., Gane, A., Sarl\u00f3s, T., Hawkins, P., Davis, J., Mohiuddin, A., Kaiser, L., Belanger, D., Colwell, L.J., Weller, A.: Rethinking Attention with Performers. ArXiv, abs\/2009.14794 (2020)"},{"key":"3709_CR29","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1057\/palgrave.jors.2602160","volume":"58","author":"G Babin","year":"2007","unstructured":"Babin, G., Deneault, S., Laporte, G.: Improvements to the Or-opt heuristic for the symmetric travelling salesman problem. J. Oper. Res. Soc. 58, 402\u2013407 (2007)","journal-title":"J. Oper. Res. Soc."},{"key":"3709_CR30","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Lio\u2019, P., Bengio, Y.: Graph Attention Networks. ArXiv, abs\/1710.10903 (2017)"},{"key":"3709_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"2004","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8, 229\u2013256 (2004)","journal-title":"Mach. Learn."},{"key":"3709_CR32","unstructured":"Kingma, D.P., Ba, J.: Adam: A Method for Stochastic Optimization. CoRR, abs\/1412.6980 (2014)"},{"key":"3709_CR33","unstructured":"Kwon, Y., Choo, J., Kim, B., Yoon, I., Min, S., Gwon, Y.: POMO: Policy Optimization with Multiple Optima for Reinforcement Learning. ArXiv, abs\/2010.16011 (2020)"},{"key":"3709_CR34","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W. J.: On the solution of traveling salesman problems. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn (1998)"},{"key":"3709_CR35","unstructured":"Johnson, D.S.: Local Optimization and the Traveling Salesman Problem. International Colloquium on Automata, Languages and Programming (1990)"},{"key":"3709_CR36","unstructured":"Joshi, S.K., Kaur, S.: Nearest Neighbor Insertion Algorithm for solving capacitated vehicle routing problem. In: 2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom), pp. 86\u201388 (2015)"},{"key":"3709_CR37","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1017\/S096354830000119X","volume":"3","author":"Y Azar","year":"1994","unstructured":"Azar, Y.: Lower bounds for insertion methods for TSP. Comb. Probab. Comput. 3, 285\u2013292 (1994)","journal-title":"Comb. Probab. Comput."},{"key":"3709_CR38","doi-asserted-by":"crossref","unstructured":"Aarts, E.H., Lenstra, J.K.: Local search in combinatorial optimization (2nd revised edition) (2003)","DOI":"10.1515\/9780691187563"}],"container-title":["Signal, Image and Video Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-024-03709-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11760-024-03709-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11760-024-03709-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T09:57:15Z","timestamp":1738317435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11760-024-03709-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,26]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["3709"],"URL":"https:\/\/doi.org\/10.1007\/s11760-024-03709-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4778453\/v1","asserted-by":"object"}]},"ISSN":["1863-1703","1863-1711"],"issn-type":[{"value":"1863-1703","type":"print"},{"value":"1863-1711","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,26]]},"assertion":[{"value":"22 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"154"}}