{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T12:10:19Z","timestamp":1743336619086,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"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_13","type":"book-chapter","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:45:20Z","timestamp":1743335120000},"page":"200-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Neighborhood Search Based on\u00a0Landscape Learning: A\u00a0TSP Study"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8307-5144","authenticated-orcid":false,"given":"Malek","family":"Sarhani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.orl.2008.09.006","volume":"37","author":"DL Applegate","year":"2009","unstructured":"Applegate, D.L., et al.: Certification of an optimal TSP tour through 85,900 cities. Oper. Res. Lett. 37, 11\u201315 (2009). https:\/\/doi.org\/10.1016\/j.orl.2008.09.006","journal-title":"Oper. Res. Lett."},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"de Armas, J., Lalla-Ruiz, E., Tilahun, S.L., Vo\u00df, S.: Similarity in metaheuristics: a gentle step towards a comparison methodology. Nat. Comput., 1\u201323 (2021). https:\/\/doi.org\/10.1007\/s11047-020-09837-9","DOI":"10.1007\/s11047-020-09837-9"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"KD Boese","year":"1994","unstructured":"Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16(2), 101\u2013113 (1994). https:\/\/doi.org\/10.1016\/0167-6377(94)90065-5","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"13_CR5","unstructured":"Geiger, M., Sevaux, M., Vo\u00df, S.: Neigborhood selection in variable neighborhood search. In: Proceedings of the IX Metaheuristics International Conference. pp. 571\u2013573. Udine (2011)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00100-4","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106693","volume":"96","author":"Y Huang","year":"2020","unstructured":"Huang, Y., Li, W., Tian, F., Meng, X.: A fitness landscape ruggedness multiobjective differential evolution algorithm with a reinforcement learning strategy. Appl. Soft Comput. 96, 106693 (2020). https:\/\/doi.org\/10.1016\/j.asoc.2020.106693","journal-title":"Appl. Soft Comput."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014). https:\/\/doi.org\/10.1016\/j.artint.2013.10.003","journal-title":"Artif. Intell."},{"key":"13_CR9","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 184\u2013192 (1995)"},{"key":"13_CR10","unstructured":"Jones, T.: Evolutionary algorithms, fitness landscapes and search. Ph.D. thesis, The University of New Mexico (1995)"},{"key":"13_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118812","volume":"213","author":"P Kalatzantonakis","year":"2023","unstructured":"Kalatzantonakis, P., Sifaleras, A., Samaras, N.: A reinforcement learning-variable neighborhood search method for the capacitated vehicle routing problem. Expert Syst. Appl. 213, 118812 (2023). https:\/\/doi.org\/10.1016\/j.eswa.2022.118812","journal-title":"Expert Syst. Appl."},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Kerschke, P., Hoos, H.H., Neumann, F., Trautmann, H.: Automated algorithm selection: survey and perspectives. Evol. Comput. 27(1), 3\u201345 (2019). https:\/\/doi.org\/10.1162\/evco_a_00242","DOI":"10.1162\/evco_a_00242"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Kerschke, P., Kotthoff, L., Bossek, J., Hoos, H.H., Trautmann, H.: Leveraging TSP solver complementarity through machine learning. Evol. Comput. 26(4), 597\u2013620 (2018). https:\/\/doi.org\/10.1162\/evco_a_00215","DOI":"10.1162\/evco_a_00215"},{"key":"13_CR14","series-title":"Studies in Classification, Data Analysis, and Knowledge Organization","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-25147-5_7","volume-title":"Applications in Statistical Computing","author":"P Kerschke","year":"2019","unstructured":"Kerschke, P., Trautmann, H.: Comprehensive feature-based landscape analysis of continuous and constrained optimization problems using the R-package Flacco. In: Bauer, N., Ickstadt, K., L\u00fcbke, K., Szepannek, G., Trautmann, H., Vichi, M. (eds.) Applications in Statistical Computing. SCDAKO, pp. 93\u2013123. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25147-5_7"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.neucom.2019.12.141","volume":"458","author":"W Li","year":"2021","unstructured":"Li, W., Meng, X., Huang, Y.: Fitness distance correlation and mixed search strategy for differential evolution. Neurocomputing 458, 514\u2013525 (2021). https:\/\/doi.org\/10.1016\/j.neucom.2019.12.141","journal-title":"Neurocomputing"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.cor.2018.08.002","volume":"101","author":"R Liu","year":"2019","unstructured":"Liu, R., Tao, Y., Xie, X.: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits. Comput. Operat. Res. 101, 250\u2013262 (2019). https:\/\/doi.org\/10.1016\/j.cor.2018.08.002","journal-title":"Comput. Operat. Res."},{"key":"13_CR17","unstructured":"Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a030. Curran Associates, Inc. (2017), https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/8a20a8621978632d76c43dfd28b67767-Paper.pdf"},{"key":"13_CR18","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-41888-4_4","volume-title":"Recent Advances in the Theory and Application of Fitness Landscapes","author":"KM Malan","year":"2014","unstructured":"Malan, K.M., Engelbrecht, A.P.: Fitness landscape analysis for metaheuristic performance prediction. In: Richter, H., Engelbrecht, A. (eds.) Recent Advances in the Theory and Application of Fitness Landscapes. ECC, vol. 6, pp. 103\u2013132. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-41888-4_4"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10472-013-9341-2","volume":"69","author":"O Mersmann","year":"2013","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., Neumann, F.: A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. Ann. Math. Artif. Intell. 69(2), 151\u2013182 (2013). https:\/\/doi.org\/10.1007\/s10472-013-9341-2","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"13_CR20","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/4235.887234","volume":"4","author":"P Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4), 337\u2013352 (2000). https:\/\/doi.org\/10.1109\/4235.887234","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"11","key":"13_CR21","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. Operat. Res. 24(11), 1097\u20131100 (1997). https:\/\/doi.org\/10.1016\/s0305-0548(97)00031-2","journal-title":"Comput. Operat. Res."},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ejor.2012.01.036","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Hanafi, S., Ili\u0107, A.: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220(1), 270\u2013285 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.01.036","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123392","volume":"248","author":"M Nahiduzzaman","year":"2024","unstructured":"Nahiduzzaman, M., Faisal Abdulrazak, L., Arselene Ayari, M., Khandakar, A., Islam, S.R.: A novel framework for lung cancer classification using lightweight convolutional neural networks and ridge extreme learning machine model with SHapley Additive exPlanations (SHAP). Expert Syst. Appl. 248, 123392 (2024). https:\/\/doi.org\/10.1016\/j.eswa.2024.123392","journal-title":"Expert Syst. Appl."},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Ochoa, G., Veerapen, N.: Deconstructing the big valley search space hypothesis. In: Evolutionary Computation in Combinatorial Optimization, pp. 58\u201373. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_5","DOI":"10.1007\/978-3-319-30698-8_5"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10732-017-9334-0","volume":"24","author":"G Ochoa","year":"2017","unstructured":"Ochoa, G., Veerapen, N.: Mapping the global structure of TSP fitness landscapes. J. Heuristics 24(3), 265\u2013294 (2017). https:\/\/doi.org\/10.1007\/s10732-017-9334-0","journal-title":"J. Heuristics"},{"key":"13_CR26","series-title":"Infosys Science Foundation Series","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-81-322-2184-5_2","volume-title":"Evolutionary Constrained Optimization","author":"S Poursoltan","year":"2015","unstructured":"Poursoltan, S., Neumann, F.: Ruggedness quantifying for constrained continuous fitness landscapes. In: Datta, R., Deb, K. (eds.) Evolutionary Constrained Optimization. ISFS, pp. 29\u201350. Springer, New Delhi (2015). https:\/\/doi.org\/10.1007\/978-81-322-2184-5_2"},{"issue":"2\u20133","key":"13_CR27","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/s0096-3003(99)00166-6","volume":"117","author":"CM Reidys","year":"2001","unstructured":"Reidys, C.M., Stadler, P.F.: Neutrality in fitness landscapes. Appl. Math. Comput. 117(2\u20133), 321\u2013350 (2001). https:\/\/doi.org\/10.1016\/s0096-3003(99)00166-6","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2013","unstructured":"S\u00f6rensen, K.: Metaheuristics - the metaphor exposed. Int. Trans. Oper. Res. 22(1), 3\u201318 (2013). https:\/\/doi.org\/10.1111\/itor.12001","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"13_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/bf01165154","volume":"20","author":"PF Stadler","year":"1996","unstructured":"Stadler, P.F.: Landscapes and their correlation functions. J. Math. Chem. 20(1), 1\u201345 (1996). https:\/\/doi.org\/10.1007\/bf01165154","journal-title":"J. Math. Chem."},{"issue":"4","key":"13_CR30","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0375-9601(92)90557-3","volume":"161","author":"PF Stadler","year":"1992","unstructured":"Stadler, P.F., Schnabl, W.: The landscape of the traveling salesman problem. Phys. Lett. A 161(4), 337\u2013344 (1992). https:\/\/doi.org\/10.1016\/0375-9601(92)90557-3","journal-title":"Phys. Lett. A"},{"issue":"4\u20135","key":"13_CR31","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1080\/08948550302439","volume":"8","author":"PF Stadler","year":"2003","unstructured":"Stadler, P.F., Stephens, C.R.: Landscapes and effective fitness. Comments Theoret. Biol. 8(4\u20135), 389\u2013431 (2003)","journal-title":"Comments Theoret. Biol."},{"key":"13_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101056","volume":"70","author":"P Stodola","year":"2022","unstructured":"Stodola, P., Ot\u0159\u00edsal, P., Hasilov\u00e1, K.: Adaptive ant colony optimization with node clustering applied to the travelling salesman problem. Swarm Evol. Comput. 70, 101056 (2022). https:\/\/doi.org\/10.1016\/j.swevo.2022.101056","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"13_CR33","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s00291-020-00604-x","volume":"43","author":"Y Sun","year":"2020","unstructured":"Sun, Y., Ernst, A., Li, X., Weiner, J.: Generalization of machine learning for problem reduction: a case study on travelling salesman problems. OR Spectrum 43(3), 607\u2013633 (2020). https:\/\/doi.org\/10.1007\/s00291-020-00604-x","journal-title":"OR Spectrum"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Tayarani-N., M.H., Pr\u00fcgel-Bennett, A.: An analysis of the fitness landscape of travelling salesman problem. Evolutionary Comput. 24, 347\u2013384 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00154","DOI":"10.1162\/EVCO_a_00154"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Vassilev, V.K., Fogarty, T.C., Miller, J.F.: Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application. In: Advances in Evolutionary Computing, pp. 3\u201344. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-642-18965-4_1","DOI":"10.1007\/978-3-642-18965-4_1"},{"key":"13_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125611","volume":"263","author":"W Wang","year":"2025","unstructured":"Wang, W., Shi, J., Sun, J., Liefooghe, A., Zhang, Q.: A new parallel cooperative landscape smoothing algorithm and its applications on TSP and UBQP. Expert Syst. Appl. 263, 125611 (2025). https:\/\/doi.org\/10.1016\/j.eswa.2024.125611","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"13_CR37","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/bf00202749","volume":"63","author":"E Weinberger","year":"1990","unstructured":"Weinberger, E.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol. Cybern. 63(5), 325\u2013336 (1990). https:\/\/doi.org\/10.1007\/bf00202749","journal-title":"Biol. Cybern."},{"key":"13_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109339","volume":"127","author":"P Zhang","year":"2022","unstructured":"Zhang, P., Wang, J., Tian, Z., Sun, S., Li, J., Yang, J.: A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem. Appl. Soft Comput. 127, 109339 (2022). https:\/\/doi.org\/10.1016\/j.asoc.2022.109339","journal-title":"Appl. Soft Comput."},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.neucom.2022.06.084","volume":"503","author":"F Zou","year":"2022","unstructured":"Zou, F., Chen, D., Liu, H., Cao, S., Ji, X., Zhang, Y.: A survey of fitness landscape analysis for optimization. Neurocomputing 503, 129\u2013139 (2022). https:\/\/doi.org\/10.1016\/j.neucom.2022.06.084","journal-title":"Neurocomputing"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:45:22Z","timestamp":1743335122000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86849-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031868481","9783031868498"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86849-8_13","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"}}]}}