{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,2]],"date-time":"2026-09-02T04:55:06Z","timestamp":1788324906871,"version":"build-2803163510"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["32341013"],"award-info":[{"award-number":["32341013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12326614"],"award-info":[{"award-number":["12326614"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000148","name":"Canadian Anesthesiologists' Society","doi-asserted-by":"publisher","award":["YSBR-034"],"award-info":[{"award-number":["YSBR-034"]}],"id":[{"id":"10.13039\/501100000148","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002367","name":"Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["XDB0680101"],"award-info":[{"award-number":["XDB0680101"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cor.2026.107467","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:32:54Z","timestamp":1774283574000},"page":"107467","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Learning-based TSP-solvers tend to be overly greedy"],"prefix":"10.1016","volume":"192","author":[{"given":"Xiayang","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0192-7118","authenticated-orcid":false,"given":"Shihua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2026.107467_b1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Modern Phys."},{"issue":"20","key":"10.1016\/j.cor.2026.107467_b2","doi-asserted-by":"crossref","first-page":"11211","DOI":"10.1073\/pnas.1635191100","article-title":"Scaling and universality in continuous length combinatorial optimization","volume":"100","author":"Aldous","year":"2003","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.cor.2026.107467_b3","series-title":"Finding Cuts in the TSP (A Preliminary Report)","author":"Applegate","year":"1995"},{"key":"10.1016\/j.cor.2026.107467_b4","article-title":"On the solution of traveling salesman problems","author":"Applegate","year":"1998","journal-title":"Doc. Math."},{"issue":"3","key":"10.1016\/j.cor.2026.107467_b5","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1016\/j.ejor.2004.06.040","article-title":"A review of TSP based approaches for flowshop scheduling","volume":"169","author":"Bagchi","year":"2006","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2026.107467_b6","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.ejor.2020.01.053","article-title":"A transformation technique for the clustered generalized traveling salesman problem with applications to logistics","volume":"285","author":"Baniasadi","year":"2020","journal-title":"European J. Oper. Res."},{"issue":"5939","key":"10.1016\/j.cor.2026.107467_b7","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1126\/science.1173299","article-title":"Scale-free networks: a decade and beyond","volume":"325","author":"Barab\u00e1si","year":"2009","journal-title":"Science"},{"issue":"5439","key":"10.1016\/j.cor.2026.107467_b8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"issue":"4","key":"10.1016\/j.cor.2026.107467_b9","article-title":"The shortest path through many points","volume":"55","author":"Beardwood Jillian","year":"1959","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.cor.2026.107467_b10","series-title":"Advances in Neural Information Processing Systems","article-title":"Learning generalizable models for vehicle routing problems via knowledge distillation","author":"Bi","year":"2022"},{"key":"10.1016\/j.cor.2026.107467_b11","doi-asserted-by":"crossref","first-page":"93479","DOI":"10.52202\/079017-2964","article-title":"Learning to handle complex constraints for vehicle routing problems","volume":"37","author":"Bi","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.cor.2026.107467_b12","doi-asserted-by":"crossref","unstructured":"Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., Trautmann, H., 2019. Evolving diverse TSP instances by means of novel and creative mutation operators. In: Proceedings of the 15th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms. pp. 58\u201371.","DOI":"10.1145\/3299904.3340307"},{"key":"10.1016\/j.cor.2026.107467_b13","series-title":"The transformer network for the traveling salesman problem","author":"Bresson","year":"2021"},{"key":"10.1016\/j.cor.2026.107467_b14","series-title":"On the stability of solutions to random optimization problems under small perturbations","author":"Chatterjee","year":"2024"},{"key":"10.1016\/j.cor.2026.107467_b15","series-title":"CPAIOR","first-page":"170","article-title":"Learning heuristics for the TSP by policy gradient","author":"Deudon","year":"2018"},{"key":"10.1016\/j.cor.2026.107467_b16","series-title":"Forty-First International Conference on Machine Learning","article-title":"INViT: A generalizable routing problem solver with invariant nested view transformer","author":"Fang","year":"2024"},{"issue":"11","key":"10.1016\/j.cor.2026.107467_b17","first-page":"1129","article-title":"Graph drawing by force-directed placement","volume":"21","author":"Fruchterman","year":"1991","journal-title":"Softw.: Pract. Exp."},{"key":"10.1016\/j.cor.2026.107467_b18","series-title":"International Conference on Learning Representations","article-title":"Generalization of neural combinatorial solvers through the lens of adversarial robustness","author":"Geisler","year":"2022"},{"issue":"1\u20132","key":"10.1016\/j.cor.2026.107467_b19","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0004-3702(96)00030-6","article-title":"The TSP phase transition","volume":"88","author":"Gent","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.1016\/j.cor.2026.107467_b20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s11047-023-09968-9","article-title":"Evolving ensembles of heuristics for the travelling salesman problem","volume":"22","author":"Gil-Gala","year":"2023","journal-title":"Nat. Comput."},{"issue":"1","key":"10.1016\/j.cor.2026.107467_b21","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"10.1016\/j.cor.2026.107467_b22","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.cor.2026.107467_b23","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cor.2026.107467_b24","series-title":"Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence","first-page":"984","article-title":"Multi-view graph contrastive learning for solving vehicle routing problems","volume":"vol. 216","author":"Jiang","year":"2023"},{"key":"10.1016\/j.cor.2026.107467_b25","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"8132","article-title":"Pointerformer: Deep reinforced multi-pointer transformer for the traveling salesman problem","volume":"Vol. 37","author":"Jin","year":"2023"},{"issue":"1","key":"10.1016\/j.cor.2026.107467_b26","first-page":"215","article-title":"The traveling salesman problem: A case study in local optimization","volume":"1","author":"Johnson","year":"1997","journal-title":"Local Search Comb. Optim."},{"key":"10.1016\/j.cor.2026.107467_b27","series-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"350","article-title":"Asymptotic experimental analysis for the held-karp traveling salesman bound","volume":"Vol. 341","author":"Johnson","year":"1996"},{"key":"10.1016\/j.cor.2026.107467_b28","unstructured":"Johnson David S., L.A.M., Rothberg, E.E., 1996. Asymptotic experimental analysis for the Held-Karp traveling salesman bound. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 341."},{"issue":"1","key":"10.1016\/j.cor.2026.107467_b29","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/s10601-022-09327-y","article-title":"Learning the travelling salesperson problem requires rethinking generalization","volume":"27","author":"Joshi","year":"2022","journal-title":"Constraints"},{"key":"10.1016\/j.cor.2026.107467_b30","series-title":"Scaling laws for neural language models","author":"Kaplan","year":"2020"},{"key":"10.1016\/j.cor.2026.107467_b31","series-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2018"},{"key":"10.1016\/j.cor.2026.107467_b32","first-page":"21188","article-title":"Pomo: Policy optimization with multiple optima for reinforcement learning","volume":"33","author":"Kwon","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.cor.2026.107467_b33","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1006529012972","article-title":"Genetic algorithms for the travelling salesman problem: A review of representations and operators","volume":"13","author":"Larranaga","year":"1999","journal-title":"Artif. Intell. Rev."},{"issue":"7553","key":"10.1016\/j.cor.2026.107467_b34","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","article-title":"Deep learning","volume":"521","author":"LeCun","year":"2015","journal-title":"Nature"},{"key":"10.1016\/j.cor.2026.107467_b35","series-title":"Thirty-Seventh Conference on Neural Information Processing Systems","article-title":"From distribution learning in training to gradient search in testing for combinatorial optimization","author":"Li","year":"2023"},{"key":"10.1016\/j.cor.2026.107467_b36","series-title":"The Thirty-Eighth Annual Conference on Neural Information Processing Systems","article-title":"Fast T2T: Optimization consistency speeds up diffusion-based training-to-testing solving for combinatorial optimization","author":"Li","year":"2024"},{"key":"10.1016\/j.cor.2026.107467_b37","series-title":"Less is more-on the importance of sparsification for transformers and graph neural networks for TSP","author":"Lischka","year":"2024"},{"key":"10.1016\/j.cor.2026.107467_b38","series-title":"Thirty-Seventh Conference on Neural Information Processing Systems","article-title":"Neural combinatorial optimization with heavy decoder: Toward large scale generalization","author":"Luo","year":"2023"},{"key":"10.1016\/j.cor.2026.107467_b39","first-page":"49555","article-title":"Learning to search feasible and infeasible regions of routing problems with flexible neural k-opt","volume":"36","author":"Ma","year":"2023","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.cor.2026.107467_b40","series-title":"On size and hardness generalization in unsupervised learning for the travelling salesman problem","author":"Min","year":"2024"},{"key":"10.1016\/j.cor.2026.107467_b41","series-title":"Asian Conference on Machine Learning","first-page":"465","article-title":"Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning","author":"d O Costa","year":"2020"},{"key":"10.1016\/j.cor.2026.107467_b42","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/978-3-540-39930-8_22","article-title":"Optimizing CNC drilling machine operations: traveling salesman problem-differential evolution approach","author":"Onwubolu","year":"2004","journal-title":"New Optim. Tech. Eng."},{"key":"10.1016\/j.cor.2026.107467_b43","doi-asserted-by":"crossref","unstructured":"Pan, X., Jin, Y., Ding, Y., Feng, M., Zhao, L., Song, L., Bian, J., 2023. H-tsp: Hierarchically solving the large-scale traveling salesman problem. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol. 37, pp. 9345\u20139353.","DOI":"10.1609\/aaai.v37i8.26120"},{"issue":"1","key":"10.1016\/j.cor.2026.107467_b44","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1214\/aoap\/1042765669","article-title":"Weak laws of large numbers in geometric probability","volume":"13","author":"Penrose","year":"2003","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/j.cor.2026.107467_b45","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","article-title":"On the capacitated vehicle routing problem","volume":"94","author":"Ralphs","year":"2003","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2026.107467_b46","unstructured":"Reinelt, G., 1995. Tsplib95. In: Interdisziplin\u00e4res Zentrum F\u00fcr Wissenschafttliches Rechnen (IWR). Vol. 338, Heidelberg, pp. 1\u201316."},{"key":"10.1016\/j.cor.2026.107467_b47","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several Heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2026.107467_b48","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(90)90082-9","article-title":"On the complexity of test case generation for NP-hard problems","volume":"36","author":"Sanchis","year":"1990","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"10.1016\/j.cor.2026.107467_b49","doi-asserted-by":"crossref","DOI":"10.1007\/s11704-024-40490-y","article-title":"A survey on deep learning-based algorithms for the traveling salesman problem","volume":"19","author":"Sui","year":"2025","journal-title":"Front. Comput. Sci."},{"key":"10.1016\/j.cor.2026.107467_b50","series-title":"Thirty-Seventh Conference on Neural Information Processing Systems","article-title":"DIFUSCO: Graph-based diffusion solvers for combinatorial optimization","author":"Sun","year":"2023"},{"key":"10.1016\/j.cor.2026.107467_b51","article-title":"Pointer networks","volume":"28","author":"Vinyals","year":"2015","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"10.1016\/j.cor.2026.107467_b52","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(82)90015-7","article-title":"A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation","volume":"9","author":"Volgenant","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107467_b53","series-title":"A game-theoretic approach for improving generalization ability of tsp solvers","author":"Wang","year":"2021"},{"key":"10.1016\/j.cor.2026.107467_b54","article-title":"Asp: Learn a universal neural solver!","author":"Wang","year":"2024","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.cor.2026.107467_b55","series-title":"Data optimization in deep learning: A survey","author":"Wu","year":"2023"},{"key":"10.1016\/j.cor.2026.107467_b56","series-title":"International Conference on Machine Learning","first-page":"10831","article-title":"It\u2019s not what machines can learn, it\u2019s what we cannot teach","author":"Yehuda","year":"2020"},{"key":"10.1016\/j.cor.2026.107467_b57","series-title":"CycleFormer: TSP solver based on language modeling","author":"Yook","year":"2024"},{"key":"10.1016\/j.cor.2026.107467_b58","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"9136","article-title":"Learning to solve travelling salesman problem with hardness-adaptive curriculum","volume":"Vol. 36","author":"Zhang","year":"2022"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000857?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000857?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:23:54Z","timestamp":1776684234000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":58,"alternative-id":["S0305054826000857"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107467","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Learning-based TSP-solvers tend to be overly greedy","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107467","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107467"}}