{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:21:18Z","timestamp":1783034478350,"version":"3.54.6"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032305206","type":"print"},{"value":"9783032305213","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:00:00Z","timestamp":1783036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:00:00Z","timestamp":1783036800000},"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-3-032-30521-3_22","type":"book-chapter","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:12:47Z","timestamp":1783033967000},"page":"343-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Reinforcement Learning\u2013Guided General Variable Neighborhood Search for\u00a0the\u00a0Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-7805-2594","authenticated-orcid":false,"given":"Karina Assini","family":"Andreatta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9801-2410","authenticated-orcid":false,"given":"Maria Claudia Silva","family":"Boeres","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5538-0504","authenticated-orcid":false,"given":"Renato Elias Nunes","family":"de Moraes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,3]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/MGS-150232","volume":"11","author":"MM Alipour","year":"2015","unstructured":"Alipour, M.M., Razavi, S.N.: A new multiagent reinforcement learning algorithm to solve the symmetric traveling salesman problem. Multiagent Grid Syst. 11(2), 107\u2013119 (2015)","journal-title":"Multiagent Grid Syst."},{"issue":"9","key":"22_CR2","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"MM Alipour","year":"2018","unstructured":"Alipour, M.M., Razavi, S.N., Feizi Derakhshi, M.R., Balafar, M.A.: A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput. Appl. 30(9), 2935\u20132951 (2018)","journal-title":"Neural Comput. Appl."},{"issue":"3","key":"22_CR3","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(3), 402\u2013407 (2007)","journal-title":"J. Oper. Res. Soc."},{"key":"22_CR4","unstructured":"Basu, S., Ghosh, D.: A review of the tabu search literature on traveling salesman problems. In: IIMA Working Paper WP2008-10-01. Indian Institute of Management Ahmedabad, Research and Publication Department (2008)"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JL Bentley","year":"1992","unstructured":"Bentley, J.L.: Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4(4), 387\u2013411 (1992)","journal-title":"ORSA J. Comput."},{"key":"22_CR6","unstructured":"Blazinskas, A., Misevicius, A.: Combining 2-opt, 3-opt and 4-opt with k-swap-kick perturbations for the traveling salesman problem. In: Proceedings of the 17th International Conference on Information and Software Technologies (IT\u00a02011), pp.\u00a01\u20136. Kaunas, Lithuania (2011)"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.disopt.2010.04.002","volume":"7","author":"RF da Silva","year":"2010","unstructured":"da Silva, R.F., Urrutia, S.: A general VNS heuristic for the traveling salesman problem with time windows. Discret. Optim. 7(4), 203\u2013211 (2010)","journal-title":"Discret. Optim."},{"key":"22_CR8","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10472-010-9213-y","volume":"60","author":"A Fialho","year":"2010","unstructured":"Fialho, A., Da Costa, L., Schoenauer, M., Sebag, M.: Analyzing bandit-based adaptive operator selection mechanisms. Ann. Math. Artif. Intell. 60(1), 25\u201364 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"22_CR11","first-page":"309","volume-title":"The Traveling Salesman Problem and Its Variations","author":"F Glover","year":"2002","unstructured":"Glover, F., Rego, C.: Local search and metaheuristics for the traveling salesman problem. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations, pp. 309\u2013368. Kluwer Academic Publishers, Boston (2002)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno\u00a0P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. 4OR 6(4), 319\u2013360 (2008)","DOI":"10.1007\/s10288-008-0089-1"},{"issue":"3","key":"22_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. Euro J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"Euro J. Comput. Optim."},{"issue":"2","key":"22_CR14","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm, S.: A simple sequentially rejective multiple test procedure. Scand. J. Stat. 6(2), 65\u201370 (1979)","journal-title":"Scand. J. Stat."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic local search. In: Handbook of Approximation Algorithms and Metaheuristics, pp. 297\u2013307. Chapman and Hall\/CRC (2018)","DOI":"10.1201\/9781351236423-17"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","volume":"68","author":"S Hore","year":"2018","unstructured":"Hore, S., Chatterjee, A., Dewanji, A.: Improving variable neighborhood search to solve the traveling salesman problem. Appl. Soft Comput. 68, 83\u201391 (2018)","journal-title":"Appl. Soft Comput."},{"key":"22_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2025.113930","volume":"185","author":"HY Jeong","year":"2025","unstructured":"Jeong, H.Y., Song, B.D.: Meta-learning-based adaptive operator selection for traveling salesman problem. Appl. Soft Comput. 185, 113930 (2025)","journal-title":"Appl. Soft Comput."},{"key":"22_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2020.106913","volume":"139","author":"P Karakostas","year":"2020","unstructured":"Karakostas, P., Panoskaltsis, N., Mantalaris, A., Georgiadis, M.C.: Optimization of CAR T-cell therapies supply chains. Comput. Chem. Eng. 139, 106913 (2020)","journal-title":"Comput. Chem. Eng."},{"key":"22_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108746","volume":"121","author":"P Karakostas","year":"2022","unstructured":"Karakostas, P., Sifaleras, A.: A double-adaptive general variable neighborhood search algorithm for the solution of the traveling salesman problem. Appl. Soft Comput. 121, 108746 (2022)","journal-title":"Appl. Soft Comput."},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.compchemeng.2019.04.015","volume":"126","author":"P Karakostas","year":"2019","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: A general variable neighborhood search-based solution approach for the location-inventory-routing problem with distribution outsourcing. Comput. Chem. Eng. 126, 263\u2013279 (2019)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"22_CR21","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."},{"key":"22_CR22","unstructured":"Kool, W., van Hoof, H., Welling, M.: Attention, learn to solve routing problems! In: International Conference on Learning Representations (2019)"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy\u00a0Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, Chichester (1985)","DOI":"10.2307\/2582681"},{"issue":"1","key":"22_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.orl.2007.02.008","volume":"36","author":"D Marx","year":"2008","unstructured":"Marx, D.: Searching the k-change neighborhood for tsp is W[1]-hard. Oper. Res. Lett. 36(1), 31\u201336 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"22_CR25","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ejor.2017.05.001","volume":"263","author":"B Men\u00e9ndez","year":"2017","unstructured":"Men\u00e9ndez, B., Bustillo, M., Pardo, E.G., Duarte, A.: General variable neighborhood search for the order batching and sequencing problem. Eur. J. Oper. Res. 263(1), 82\u201393 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997), citeSeerX: 10.1.1.800.1797","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4613-1361-8","volume-title":"Meta-Heuristics: Theory and Applications","author":"IH Osman","year":"1996","unstructured":"Osman, I.H., Kelly, J.P.: Meta-heuristics: an overview. In: Osman, I.H., Kelly, J.P. (eds.) Meta-Heuristics: Theory and Applications, pp. 1\u201321. Kluwer Academic Publishers, Boston (1996)"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Papalitsas, C., Karakostas, P., Andronikos, T.: A performance study of the impact of different perturbation methods on the efficiency of GVNS for solving TSP. Appl. Syst. Innov. 2, 31 (2019)","DOI":"10.3390\/asi2040031"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Queiroz dos Santos, J.P., de Melo, J.D., Duarte Neto, A.D., Aloise, D.: Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search. Expert Syst. Appl. 41(10), 4939\u20134949 (2014)","DOI":"10.1016\/j.eswa.2014.01.040"},{"key":"22_CR30","first-page":"2051","volume":"2024","author":"Y Ruan","year":"2024","unstructured":"Ruan, Y., Cai, W., Wang, J.: Combining reinforcement learning algorithm and genetic algorithm to solve the traveling salesman problem. J. Eng. 2024, 2051\u20133305 (2024)","journal-title":"J. Eng."},{"key":"22_CR31","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, Adaptive Computation and Machine Learning. MIT Press, Cambridge (1998)"},{"issue":"2","key":"22_CR32","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E Taillard","year":"1997","unstructured":"Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"key":"22_CR33","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ijepes.2015.12.031","volume":"78","author":"R Todosijevi\u0107","year":"2016","unstructured":"Todosijevi\u0107, R., Mladenovi\u0107, M., Hanafi, S., Mladenovi\u0107, N., Cr\u00e9vits, I.: Adaptive general variable neighborhood search heuristics for solving the unit commitment problem. Int. J. Electr. Power Energy Syst. 78, 873\u2013883 (2016)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Venkatesh, P., Srivastava, G., Singh, A.: A general variable neighborhood search algorithm for the k-traveling salesman problem. Procedia Comput. Sci. 143, 189\u2013196 (2018), 8th International Conference on Advances in Computing & Communications (ICACC-2018)","DOI":"10.1016\/j.procs.2018.10.375"},{"key":"22_CR35","unstructured":"Watkins, C.J.C.H.: Learning from Delayed Rewards. Ph.D. thesis, University of Cambridge, Cambridge (1989)"},{"key":"22_CR36","doi-asserted-by":"publisher","unstructured":"Wauters, T., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: Boosting metaheuristic search using reinforcement learning. In: Talbi, E.G. (ed.) Hybrid Metaheuristics, pp. 433\u2013452. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30671-6_17","DOI":"10.1007\/978-3-642-30671-6_17"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2026 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-30521-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:12:53Z","timestamp":1783033973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-30521-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,3]]},"ISBN":["9783032305206","9783032305213"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-30521-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,3]]},"assertion":[{"value":"3 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The use of the tool (Gemini - Google) was strictly limited to writing support and did not involve the generation of scientific content, results, or analysis. All AI-assisted text was subsequently reviewed and revised by the authors, who take full responsibility for the accuracy, integrity, and originality of the final work.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration of AI-Assisted Technologies"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Braga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}