{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T12:10:15Z","timestamp":1743336615128,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031868481","type":"print"},{"value":"9783031868498","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-86849-8_4","type":"book-chapter","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:44:39Z","timestamp":1743335079000},"page":"50-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Diversification Through Candidate Sampling for\u00a0a\u00a0Non-iterated Lin-Kernighan-Helsgaun Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2203-9698","authenticated-orcid":false,"given":"Tarek","family":"Boufar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6074-9131","authenticated-orcid":false,"given":"Omar","family":"Rifki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8285-5621","authenticated-orcid":false,"given":"Matthieu","family":"Basseur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"4_CR1","unstructured":"National traveling salesman problem (2022). https:\/\/www.math.uwaterloo.ca\/tsp\/world\/countries.html"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01585505","volume":"7","author":"KH Hansen","year":"1974","unstructured":"Hansen, K.H., Krarup, J.: Improvements of the held - karp algorithm for the symmetric traveling-salesman problem. Math. Program. 7(1), 87\u201396 (1974). https:\/\/doi.org\/10.1007\/BF01585505","journal-title":"Math. Program."},{"issue":"6","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138\u20131162 (1970). https:\/\/doi.org\/10.1287\/opre.18.6.1138","journal-title":"Oper. Res."},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1), 6\u201325 (1971). https:\/\/doi.org\/10.1007\/BF01584070","journal-title":"Math. Program."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held, M., Wolfe, P., Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6(1), 62\u201388 (1974). https:\/\/doi.org\/10.1007\/BF01580223","journal-title":"Math. Program."},{"issue":"1","key":"4_CR6","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(1), 106\u2013130 (2000). https:\/\/doi.org\/10.1016\/S0377-2217(99)00284-2","journal-title":"Eur. J. Oper. Res."},{"issue":"2\u20133","key":"4_CR7","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(2\u20133), 119\u2013163 (2009). https:\/\/doi.org\/10.1007\/s12532-009-0004-6","journal-title":"Math. Program. Comput."},{"key":"4_CR8","unstructured":"Helsgaun, K.: An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Department of Computer Science, Roskilde University (2017)"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973). https:\/\/doi.org\/10.1287\/opre.21.2.498","journal-title":"Oper. Res."},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-30201-8_32","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"B Neveu","year":"2004","unstructured":"Neveu, B., Trombettoni, G., Glover, F.: ID walk: a candidate list strategy with a simple diversification device. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 423\u2013437. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_32"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1002\/net.3230170405","volume":"17","author":"WR Stewart Jr","year":"1987","unstructured":"Stewart, W.R., Jr.: Accelerated branch exchange heuristics for symmetric traveling salesman problems. Networks 17(4), 423\u2013437 (1987). https:\/\/doi.org\/10.1002\/net.3230170405","journal-title":"Networks"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-78133-4_4","volume-title":"Artificial Evolution","author":"S Tari","year":"2018","unstructured":"Tari, S., Basseur, M., Go\u00ebffon, A.: Sampled walk and binary fitness landscapes exploration. In: Lutton, E., Legrand, P., Parrend, P., Monmarch\u00e9, N., Schoenauer, M. (eds.) EA 2017. LNCS, vol. 10764, pp. 47\u201357. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78133-4_4"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s11047-020-09822-2","volume":"20","author":"S Tari","year":"2021","unstructured":"Tari, S., Basseur, M., Go\u00ebffon, A.: On the use of (1, $$\\lambda $$ )-evolution strategy as efficient local search mechanism for discrete optimization: a behavioral analysis. Nat. Comput. 20(3), 345\u2013361 (2021). https:\/\/doi.org\/10.1007\/s11047-020-09822-2","journal-title":"Nat. Comput."},{"issue":"5","key":"4_CR14","doi-asserted-by":"publisher","first-page":"2761","DOI":"10.1111\/itor.12983","volume":"29","author":"S Tari","year":"2022","unstructured":"Tari, S., Basseur, M., Go\u00ebffon, A.: Partial neighborhood local searches. Int. Trans. Oper. Res. 29(5), 2761\u20132788 (2022). https:\/\/doi.org\/10.1111\/itor.12983","journal-title":"Int. Trans. Oper. Res."},{"key":"4_CR15","unstructured":"TSPLIB: A library of sample instances for the traveling salesman problem (TSP) (1995). http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95"},{"key":"4_CR16","unstructured":"VLSI: A library of sample instances for the traveling salesman problem (2013). https:\/\/www.math.uwaterloo.ca\/tsp\/vlsi"},{"key":"4_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110144","volume":"260","author":"J Zheng","year":"2023","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C.: Reinforced lin-kernighan-helsgaun algorithms for the traveling salesman problems. Knowl. Based Syst. 260, 110144 (2023). https:\/\/doi.org\/10.1016\/j.knosys.2022.110144","journal-title":"Knowl. Based Syst."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86849-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:44:42Z","timestamp":1743335082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86849-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031868481","9783031868498"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86849-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2025a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}