{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:15:50Z","timestamp":1757625350710,"version":"3.44.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:00:00Z","timestamp":1753920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:00:00Z","timestamp":1753920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["liujinmei [2023] No. 21"],"award-info":[{"award-number":["liujinmei [2023] No. 21"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China University Industry University Research Innovation Fund","award":["2023IT056"],"award-info":[{"award-number":["2023IT056"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10586-025-05115-4","type":"journal-article","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T12:45:51Z","timestamp":1753965951000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive annealing dynamic Q-learning based on subroute optimization for solving the traveling salesman problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Liming","family":"Sun","sequence":"first","affiliation":[]},{"given":"Ming","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Haotian","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,31]]},"reference":[{"issue":"3","key":"5115_CR1","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","volume":"314","author":"PC Pop","year":"2024","unstructured":"Pop, P.C., Cosma, O., Sabo, C., Sitar, C.P.: A comprehensive survey on the generalized traveling salesman problem. Eur. J. Oper. Res. 314(3), 819\u2013835 (2024)","journal-title":"Eur. J. Oper. Res."},{"key":"5115_CR2","volume-title":"The traveling salesman: computational solutions for TSP applications","author":"G Reinelt","year":"2003","unstructured":"Reinelt, G.: The traveling salesman: computational solutions for TSP applications, vol. 840. Springer, Germany (2003)"},{"key":"5115_CR3","first-page":"1","volume":"23","author":"M Hahsler","year":"2008","unstructured":"Hahsler, M., Hornik, K.: Tsp-infrastructure for the traveling salesperson problem. J. Stat. Softw. 23, 1\u201321 (2008)","journal-title":"J. Stat. Softw."},{"key":"5115_CR4","doi-asserted-by":"publisher","first-page":"100369","DOI":"10.1016\/j.cosrev.2021.100369","volume":"40","author":"O Cheikhrouhou","year":"2021","unstructured":"Cheikhrouhou, O., Khoufi, I.: A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy. Comput. Sci. Rev. 40, 100369 (2021)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"5115_CR5","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.ejor.2020.01.053","volume":"285","author":"P Baniasadi","year":"2020","unstructured":"Baniasadi, P., Foumani, M., Smith-Miles, K., Ejov, V.: A transformation technique for the clustered generalized traveling salesman problem with applications to logistics. Eur. J. Oper. Res. 285(2), 444\u2013457 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"5115_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3510034","volume":"13","author":"F Lin","year":"2022","unstructured":"Lin, F., Hsieh, H.-P.: Traveling transporter problem: arranging a new circular route in a public transportation system based on heterogeneous non-monotonic urban data. ACM Trans. Intell. Syst. Technol. (TIST) 13(3), 1\u201325 (2022)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"6","key":"5115_CR7","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1007\/s10845-021-01766-3","volume":"33","author":"Z Xiao","year":"2022","unstructured":"Xiao, Z., Wang, Z., Liu, D., Wang, H.: A path planning algorithm for pcb surface quality automatic inspection. J. Intell. Manuf. 33(6), 1829\u20131841 (2022)","journal-title":"J. Intell. Manuf."},{"issue":"1","key":"5115_CR8","doi-asserted-by":"publisher","first-page":"19807","DOI":"10.1038\/s41598-024-70781-0","volume":"14","author":"X Diao","year":"2024","unstructured":"Diao, X., Fan, H., Zhu, X., Liu, Z.: Multi-depot routing problem with van-based driverless vehicles. Sci. Rep. 14(1), 19807 (2024)","journal-title":"Sci. Rep."},{"issue":"2","key":"5115_CR9","doi-asserted-by":"publisher","first-page":"358","DOI":"10.13189\/ms.2022.100210","volume":"10","author":"S Dhanasekar","year":"2022","unstructured":"Dhanasekar, S., Dash, S.K., Uthaman, N.: A branch and bound algorithm to solve traveling salesman problem (tsp) with uncertain parameters. Mathematics Stat. 10(2), 358\u2013365 (2022)","journal-title":"Mathematics Stat."},{"doi-asserted-by":"crossref","unstructured":"Kool, W., Hoof, H., Gromicho, J., Welling, M.: Deep policy dynamic programming for vehicle routing problems. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 190\u2013213 (2022). Springer","key":"5115_CR10","DOI":"10.1007\/978-3-031-08011-1_14"},{"doi-asserted-by":"crossref","unstructured":"Sharma, S., Jain, V.: A novel approach for solving tsp problem using genetic algorithm problem. In: IOP Conference Series: Materials Science and Engineering, vol. 1116, p. 012194 (2021). IOP Publishing","key":"5115_CR11","DOI":"10.1088\/1757-899X\/1116\/1\/012194"},{"issue":"10","key":"5115_CR12","doi-asserted-by":"publisher","first-page":"7627","DOI":"10.1007\/s00521-021-06883-x","volume":"34","author":"I Ilhan","year":"2022","unstructured":"Ilhan, I., G\u00f6kmen, G.: A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem. Neural Comput. Appl. 34(10), 7627\u20137652 (2022)","journal-title":"Neural Comput. Appl."},{"doi-asserted-by":"crossref","unstructured":"Toaza, B., Eszterg\u00e1r-Kiss, D.: A review of metaheuristic algorithms for solving tsp-based scheduling optimization problems. Applied Soft Computing, 110908 (2023)","key":"5115_CR13","DOI":"10.1016\/j.asoc.2023.110908"},{"key":"5115_CR14","doi-asserted-by":"publisher","first-page":"115948","DOI":"10.1016\/j.eswa.2021.115948","volume":"187","author":"II Huerta","year":"2022","unstructured":"Huerta, I.I., Neira, D.A., Ortega, D.A., Varas, V., Godoy, J., Asin-Acha, R.: Improving the state-of-the-art in the traveling salesman problem: an anytime automatic algorithm selection. Expert Syst. Appl. 187, 115948 (2022)","journal-title":"Expert Syst. Appl."},{"key":"5115_CR15","doi-asserted-by":"publisher","first-page":"109851","DOI":"10.1016\/j.cie.2023.109851","volume":"187","author":"P Chen","year":"2024","unstructured":"Chen, P., Wang, Q.: Learning for multiple purposes: a q-learning enhanced hybrid metaheuristic for parallel drone scheduling traveling salesman problem. Comput. Industr. Eng. 187, 109851 (2024)","journal-title":"Comput. Industr. Eng."},{"issue":"9","key":"5115_CR16","first-page":"12303","volume":"2023","author":"J Wang","year":"2023","unstructured":"Wang, J., Xiao, C., Wang, S., Ruan, Y.: Reinforcement learning for the traveling salesman problem: performance comparison of three algorithms. J. Eng. 2023(9), 12303 (2023)","journal-title":"J. Eng."},{"issue":"5","key":"5115_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.: Particle swarm optimization-based algorithms for tsp and generalized tsp. Inf. Process. Lett. 103(5), 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"key":"5115_CR18","doi-asserted-by":"publisher","first-page":"108653","DOI":"10.1016\/j.asoc.2022.108653","volume":"120","author":"R Skinderowicz","year":"2022","unstructured":"Skinderowicz, R.: Improving ant colony optimization efficiency for solving large tsp instances. Appl. Soft Comput. 120, 108653 (2022)","journal-title":"Appl. Soft Comput."},{"doi-asserted-by":"crossref","unstructured":"Chitty, D.M.: Applying aco to large scale tsp instances. In: Advances in Computational Intelligence Systems: Contributions Presented at the 17th UK Workshop on Computational Intelligence, September 6-8, 2017, Cardiff, UK, pp. 104\u2013118 (2018). Springer","key":"5115_CR19","DOI":"10.1007\/978-3-319-66939-7_9"},{"issue":"4","key":"5115_CR20","doi-asserted-by":"publisher","first-page":"4317","DOI":"10.1007\/s40747-022-00949-6","volume":"9","author":"H Liu","year":"2023","unstructured":"Liu, H., Lee, A., Lee, W., Guo, P.: Daaco: adaptive dynamic quantity of ant aco algorithm to solve the traveling salesman problem. Complex Intell. Syst. 9(4), 4317\u20134330 (2023)","journal-title":"Complex Intell. Syst."},{"doi-asserted-by":"crossref","unstructured":"Ismail, A.H., Hartono, N., Zeybek, S., Pham, D.T.: Using the bees algorithm to solve combinatorial optimisation problems for tsplib. In: IOP Conference Series: Materials Science and Engineering, vol. 847, p. 012027 (2020). IOP Publishing","key":"5115_CR21","DOI":"10.1088\/1757-899X\/847\/1\/012027"},{"issue":"2","key":"5115_CR22","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1007\/s00521-022-07816-y","volume":"35","author":"M Sahin","year":"2023","unstructured":"Sahin, M.: Solving tsp by using combinatorial bees algorithm with nearest neighbor method. Neural Comput. Appl. 35(2), 1863\u20131879 (2023)","journal-title":"Neural Comput. Appl."},{"issue":"3","key":"5115_CR23","doi-asserted-by":"publisher","first-page":"0283207","DOI":"10.1371\/journal.pone.0283207","volume":"18","author":"J Zhang","year":"2023","unstructured":"Zhang, J., Liu, Q., Han, X.: Dynamic sub-route-based self-adaptive beam search q-learning algorithm for traveling salesman problem. PLoS One 18(3), 0283207 (2023)","journal-title":"PLoS One"},{"issue":"4","key":"5115_CR24","doi-asserted-by":"publisher","first-page":"4700","DOI":"10.11591\/ijece.v13i4.pp4700-4707","volume":"13","author":"A Muklason","year":"2023","unstructured":"Muklason, A., Premananda, I.G.A.: Hybrid iterated local search algorithm for optimization route of airplane travel plans. Int. J. Electr. Comput. Eng. (IJECE) 13(4), 4700\u20134707 (2023)","journal-title":"Int. J. Electr. Comput. Eng. (IJECE)"},{"doi-asserted-by":"crossref","unstructured":"Cha, H., Lee, C., Xie, C., Lu, Q.-C., Eun, J., Cheong, T.: An exact a$$^*$$-based tree search algorithm for tsp with sequence-and-load dependent risk. IEEE Transactions on Intelligent Transportation Systems (2024)","key":"5115_CR25","DOI":"10.1109\/TITS.2024.3384576"},{"key":"5115_CR26","doi-asserted-by":"publisher","first-page":"107816","DOI":"10.1016\/j.engappai.2023.107816","volume":"131","author":"X Li","year":"2024","unstructured":"Li, X., Zhang, S., Shao, P.: Discrete artificial bee colony algorithm with fixed neighborhood search for traveling salesman problem. Eng. Appl. Artif. Intell. 131, 107816 (2024)","journal-title":"Eng. Appl. Artif. Intell."},{"doi-asserted-by":"crossref","unstructured":"Fu, Z.-H., 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)","key":"5115_CR27","DOI":"10.1609\/aaai.v35i8.16916"},{"issue":"2","key":"5115_CR28","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A.M., Talbi, E.-G.: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur. J. Oper. Res. 296(2), 393\u2013422 (2022)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Cheng, H., Zheng, H., Cong, Y., Jiang, W., Pu, S.: Select and optimize: Learning to solve large-scale tsp instances. In: International Conference on Artificial Intelligence and Statistics, pp. 1219\u20131231 (2023). PMLR","key":"5115_CR29"},{"doi-asserted-by":"crossref","unstructured":"Pan, X., Jin, Y., Ding, Y., Feng, M., Zhao, L., Song, L., Bian, J.: 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)","key":"5115_CR30","DOI":"10.1609\/aaai.v37i8.26120"},{"doi-asserted-by":"crossref","unstructured":"Zhang, D., Xiao, Z., Wang, Y., Song, M., Chen, G.: Neural tsp solver with progressive distillation. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, pp. 12147\u201312154 (2023)","key":"5115_CR31","DOI":"10.1609\/aaai.v37i10.26432"},{"key":"5115_CR32","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2006","unstructured":"Applegate, D.L.: The traveling salesman problem: a computational study, vol. 17. Princeton University Press, Germany (2006)"},{"key":"5115_CR33","doi-asserted-by":"publisher","first-page":"105127","DOI":"10.1016\/j.cor.2020.105127","volume":"127","author":"SA V\u00e1squez","year":"2021","unstructured":"V\u00e1squez, S.A., Angulo, G., Klapp, M.A.: An exact solution method for the tsp with drone based on decomposition. Comput. Oper. Res. 127, 105127 (2021)","journal-title":"Comput. Oper. Res."},{"key":"5115_CR34","first-page":"225","volume":"7","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: The traveling salesman problem. Handbooks Oper. Res. Management Sci. 7, 225\u2013330 (1995)","journal-title":"Handbooks Oper. Res. Management Sci."},{"issue":"1","key":"5115_CR35","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/120875909","volume":"56","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56(1), 3\u201369 (2014)","journal-title":"SIAM Rev."},{"unstructured":"Ernst, D., Louette, A.: Introduction to reinforcement learning. Feuerriegel, S., Hartmann, J., Janiesch, C., and Zschech, P, 111\u2013126 (2024)","key":"5115_CR36"},{"key":"5115_CR37","first-page":"279","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins, C.J., Dayan, P.: Q-learning. Mach. Learn. 8, 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Mavridou, T.D.: Simulated annealing. In: Encyclopedia of Optimization, pp. 1\u20133. Springer, USA (2024)","key":"5115_CR38","DOI":"10.1007\/978-3-030-54621-2_617-1"},{"issue":"12","key":"5115_CR39","doi-asserted-by":"publisher","first-page":"7339","DOI":"10.3390\/app13127339","volume":"13","author":"F Uddin","year":"2023","unstructured":"Uddin, F., Riaz, N., Manan, A., Mahmood, I., Song, O.-Y., Malik, A.J., Abbasi, A.A.: An improvement to the 2-opt heuristic algorithm for approximation of optimal tsp tour. Appl. Sci. 13(12), 7339 (2023)","journal-title":"Appl. Sci."},{"doi-asserted-by":"crossref","unstructured":"Suwanda, R., Syahputra, Z., Zamzami, E.M.: Analysis of euclidean distance and manhattan distance in the k-means algorithm for variations number of centroid k. In: Journal of Physics: Conference Series, vol. 1566, p. 012058 (2020). IOP Publishing","key":"5115_CR40","DOI":"10.1088\/1742-6596\/1566\/1\/012058"},{"doi-asserted-by":"crossref","unstructured":"Suhaedi, D., Harahap, E.: Traffic data mining with distance matrix api by google maps. In: AIP Conference Proceedings, vol. 3065 (2024). AIP Publishing","key":"5115_CR41","DOI":"10.1063\/5.0224610"},{"issue":"4","key":"5115_CR42","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-a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05115-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05115-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05115-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T17:41:51Z","timestamp":1757439711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05115-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,31]]},"references-count":42,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["5115"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05115-4","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2025,7,31]]},"assertion":[{"value":"11 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2025","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 that they have no confict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"454"}}