{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:03:00Z","timestamp":1775282580341,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T00:00:00Z","timestamp":1741737600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T00:00:00Z","timestamp":1741737600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72371076"],"award-info":[{"award-number":["72371076"]}],"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":["72401068"],"award-info":[{"award-number":["72401068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fujian Province Social Science Foundation","award":["FJ2024C077"],"award-info":[{"award-number":["FJ2024C077"]}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2024J08134"],"award-info":[{"award-number":["2024J08134"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013139","name":"Humanities and Social Science Fund of Ministry of Education of China","doi-asserted-by":"publisher","award":["24YJC630096"],"award-info":[{"award-number":["24YJC630096"]}],"id":[{"id":"10.13039\/501100013139","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10732-025-09553-6","type":"journal-article","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T14:32:51Z","timestamp":1741789971000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An adaptive variable neighborhood search for the traveling salesman problem with job-times"],"prefix":"10.1007","volume":"31","author":[{"given":"Shaowen","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongliang","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjuan","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,12]]},"reference":[{"key":"9553_CR1","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, 444\u2013457 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"9553_CR2","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M Bellmore","year":"1968","unstructured":"Bellmore, M., Nemhauser, G.L.: The traveling salesman problem: a survey. Oper. Res. 16, 538\u2013558 (1968)","journal-title":"Oper. Res."},{"key":"9553_CR3","first-page":"4800","volume":"219","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for the quadratic assignment problem. Appl. Math. Comput. 219, 4800\u20134815 (2013)","journal-title":"Appl. Math. Comput."},{"key":"9553_CR4","doi-asserted-by":"crossref","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., St\u00fctzle, T.: F-Race and iterated F-Race: an overview. Experimental methods for the analysis of optimization algorithms. Springer Berlin Heidelberg, Berlin, Heidelberg, 311\u2013336 (2010)","DOI":"10.1007\/978-3-642-02538-9_13"},{"key":"9553_CR5","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"9553_CR6","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1287\/ijoc.1060.0202","volume":"19","author":"F Carrabs","year":"2007","unstructured":"Carrabs, F., Cordeau, J.-F., Laporte, G.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J. Comput. 19, 618\u2013632 (2007)","journal-title":"INFORMS J. Comput."},{"key":"9553_CR7","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1016\/j.ejor.2021.02.027","volume":"294","author":"C Chen","year":"2021","unstructured":"Chen, C., Demir, E., Huang, Y.: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots. Eur. J. Oper. Res. 294, 1164\u20131180 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"9553_CR8","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, 791\u2013812 (1958)","journal-title":"Oper. Res."},{"key":"9553_CR9","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, 203\u2013211 (2010)","journal-title":"Discret. Optim."},{"key":"9553_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/itor.12671","volume":"27","author":"JC De Freitas","year":"2020","unstructured":"De Freitas, J.C., Penna, P.H.V.: A variable neighborhood search for flying sidekick traveling salesman problem. Int Trans Operational Res 27, 267\u2013290 (2020)","journal-title":"Int Trans Operational Res"},{"key":"9553_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105831","volume":"145","author":"A Di Placido","year":"2022","unstructured":"Di Placido, A., Archetti, C., Cerrone, C.: A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance. Comput. Oper. Res. 145, 105831 (2022)","journal-title":"Comput. Oper. Res."},{"key":"9553_CR12","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.ejor.2016.03.006","volume":"253","author":"C Doppstadt","year":"2016","unstructured":"Doppstadt, C., Koberstein, A., Vigo, D.: The hybrid electric vehicle\u2013traveling salesman problem. Eur. J. Oper. Res. 253, 825\u2013842 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"9553_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y Dumas","year":"1995","unstructured":"Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43, 367\u2013371 (1995)","journal-title":"Oper. Res."},{"key":"9553_CR14","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s11590-018-1342-y","volume":"14","author":"RF Fachini","year":"2020","unstructured":"Fachini, R.F., Armentano, V.A.: Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows. Optimization Lett. 14, 579\u2013609 (2020)","journal-title":"Optimization Lett."},{"key":"9553_CR15","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood, M.M.: The traveling-salesman problem. Oper. Res. 4, 61\u201375 (1956)","journal-title":"Oper. Res."},{"key":"9553_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105491","volume":"137","author":"C Friedrich","year":"2022","unstructured":"Friedrich, C., Elbert, R.: Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics. Comput. Oper. Res. 137, 105491 (2022)","journal-title":"Comput. Oper. Res."},{"key":"9553_CR17","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40, 1086\u20131094 (1992)","journal-title":"Oper. Res."},{"key":"9553_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122472","volume":"240","author":"P Guti\u00e9rrez-Aguirre","year":"2024","unstructured":"Guti\u00e9rrez-Aguirre, P., Contreras-Bolton, C.: A multioperator genetic algorithm for the traveling salesman problem with job-times. Expert Syst. Appl. 240, 122472 (2024)","journal-title":"Expert Syst. Appl."},{"key":"9553_CR19","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. Optimization 5, 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optimization"},{"key":"9553_CR20","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, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9553_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin-Kernighan TSP heuristic. Math. Program. Comput. 1, 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"key":"9553_CR22","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s12532-015-0080-8","volume":"7","author":"K Helsgaun","year":"2015","unstructured":"Helsgaun, K.: Solving the equality generalized traveling salesman problem using the Lin\u2013Kernighan\u2013Helsgaun algorithm. Math. Program. Comput. 7, 269\u2013287 (2015)","journal-title":"Math. Program. Comput."},{"key":"9553_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105269","volume":"133","author":"ME Hesam Sadati","year":"2021","unstructured":"Hesam Sadati, M.E., \u00c7atay, B., Aksen, D.: An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems. Comput. Oper. Res. 133, 105269 (2021)","journal-title":"Comput. Oper. Res."},{"key":"9553_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1057\/jors.2009.76","volume":"61","author":"G Laporte","year":"2010","unstructured":"Laporte, G.: A concise guide to the traveling salesman problem. J. Operation. Res. Soc. 61, 35\u201340 (2010)","journal-title":"J. Operation. Res. Soc."},{"key":"9553_CR25","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"key":"9553_CR26","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1109\/TITS.2017.2706720","volume":"19","author":"X Meng","year":"2018","unstructured":"Meng, X., Li, J., Dai, X., Dou, J.: Variable neighborhood search for a colored traveling salesman problem. IEEE Trans. Intell. Transp. Syst. 19, 1018\u20131026 (2018)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"9553_CR27","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9553_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105622","volume":"139","author":"N Mladenovi\u0107","year":"2022","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D., Ratli, M.: Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS. Comput. Oper. Res. 139, 105622 (2022)","journal-title":"Comput. Oper. Res."},{"key":"9553_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105226","volume":"129","author":"M Mosayebi","year":"2021","unstructured":"Mosayebi, M., Sodhi, M., Wettergren, T.A.: The traveling salesman problem with job-times (TSPJ). Comput. Oper. Res. 129, 105226 (2021)","journal-title":"Comput. Oper. Res."},{"key":"9553_CR30","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ins.2019.08.017","volume":"507","author":"J Pei","year":"2020","unstructured":"Pei, J., Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Brimberg, J., Liu, X.: Solving the traveling repairman problem with profits: a novel variable neighborhood search approach. Inf. Sci. 507, 108\u2013123 (2020)","journal-title":"Inf. Sci."},{"issue":"3","key":"9553_CR31","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":"9553_CR32","doi-asserted-by":"crossref","unstructured":"Rego, C., Glover, F.: Local Search and Metaheuristics. In: Gutin, G., Punnen, A.P. (Eds). The traveling salesman problem and its variations. Combinatorial optimization 12, 309\u2013368 (2007)","DOI":"10.1007\/0-306-48213-4_8"},{"key":"9553_CR33","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\u2014a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"9553_CR34","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1110.0396","volume":"47","author":"A Stenger","year":"2013","unstructured":"Stenger, A., Vigo, D., Enz, S., Schwind, M.: An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transp. Sci. 47, 64\u201380 (2013)","journal-title":"Transp. Sci."},{"key":"9553_CR35","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.trb.2022.12.007","volume":"168","author":"GO Tini\u00e7","year":"2023","unstructured":"Tini\u00e7, G.O., Karasan, O.E., Kara, B.Y., Campbell, J.F., Ozel, A.: Exact solution approaches for the minimum total cost traveling salesman problem with multiple drones. Transp. Res. Part b: Methodol. 168, 81\u2013123 (2023)","journal-title":"Transp. Res. Part b: Methodol."},{"key":"9553_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107439","volume":"107","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Han, Z.: Ant colony optimization for traveling salesman problem based on parameters optimization. Appl. Soft Comput. 107, 107439 (2021)","journal-title":"Appl. Soft Comput."},{"key":"9553_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120020","volume":"225","author":"Y Zou","year":"2023","unstructured":"Zou, Y., Hao, J.-K., Wu, Q.: Breakout local search for the traveling salesman problem with job-times. Expert Syst. Appl. 225, 120020 (2023)","journal-title":"Expert Syst. Appl."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09553-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09553-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09553-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T05:42:43Z","timestamp":1749620563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09553-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,12]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["9553"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09553-6","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,12]]},"assertion":[{"value":"29 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 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":"No author associated with this article has disclosed any potential or pertinent conflicts that may be perceived to have impending conflict with this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"18"}}