{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:17:17Z","timestamp":1782947837639,"version":"3.54.5"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032304933","type":"print"},{"value":"9783032304940","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:00:00Z","timestamp":1782950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:00:00Z","timestamp":1782950400000},"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-30494-0_24","type":"book-chapter","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T22:38:17Z","timestamp":1782945497000},"page":"378-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Thompson Sampling Based Operator Selection in\u00a0Adaptive Large Neighborhood Search for\u00a0Facility Location with\u00a0Customer Incompatibilities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9648-5345","authenticated-orcid":false,"given":"Gabriel","family":"Souto","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3874-784X","authenticated-orcid":false,"given":"Diego","family":"Brand\u00e3o","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8273-9439","authenticated-orcid":false,"given":"Luidi","family":"Simonetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0057-7670","authenticated-orcid":false,"given":"Pedro Henrique Gonz\u00e1lez","family":"Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,2]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Abeille, M., Lazaric, A.: Linear Thompson sampling revisited. Artif. Intel. Stat. (2017)","DOI":"10.1214\/17-EJS1341SI"},{"key":"24_CR2","unstructured":"Agrawal, S., Goyal, N.: Thompson sampling for contextual bandits with linear payoffs. In: Proceedings of the 30th International Conference on Machine Learning, pp. 127\u2013135. ICML (2013)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"109858","DOI":"10.1016\/j.cie.2023.109858","volume":"188","author":"S Ceschia","year":"2024","unstructured":"Ceschia, S., Schaerf, A.: Multi-neighborhood simulated annealing for the capacitated facility location problem with customer incompatibilities. Comput. Ind. Eng. 188, 109858 (2024). https:\/\/doi.org\/10.1016\/j.cie.2023.109858","journal-title":"Comput. Ind. Eng."},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Gjergji, I., Kletzander, L., Musliu, N., Schaerf, A.: Large neighborhood search for capacitated facility location with customer incompatibilities. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201925 (2025). https:\/\/doi.org\/10.1145\/3712256.3726355","DOI":"10.1145\/3712256.3726355"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Hettmansperger, T.P., McKean, J.W.: Robust Nonparametric Statistical Methods. CRC Press (2010)","DOI":"10.1201\/b10451"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press (2020)","DOI":"10.1017\/9781108571401"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"4685","DOI":"10.1007\/s00500-022-07600-z","volume":"27","author":"MRH Maia","year":"2023","unstructured":"Maia, M.R.H., et al.: Metaheuristic techniques for the capacitated facility location problem with customer incompatibilities. Soft. Comput. 27, 4685\u20134698 (2023). https:\/\/doi.org\/10.1007\/s00500-022-07600-z","journal-title":"Soft. Comput."},{"key":"24_CR8","unstructured":"Osband, I., Russo, D., Van\u00a0Roy, B.: More efficient reinforcement learning via posterior sampling. In: Advances in Neural Information Processing Systems (2013)"},{"issue":"287","key":"24_CR9","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1080\/01621459.1959.10501526","volume":"54","author":"JW Pratt","year":"1959","unstructured":"Pratt, J.W.: Remarks on zeros and ties in the Wilcoxon signed rank procedures. J. Am. Stat. Assoc. 54(287), 655\u2013667 (1959)","journal-title":"J. Am. Stat. Assoc."},{"issue":"6","key":"24_CR10","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1287\/opre.44.6.864","volume":"44","author":"CS Revelle","year":"1996","unstructured":"Revelle, C.S., Laporte, G.: The plant location problem: new models and research prospects. Oper. Res. 44(6), 864\u2013874 (1996)","journal-title":"Oper. Res."},{"issue":"4","key":"24_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S R\u00f8pke","year":"2006","unstructured":"R\u00f8pke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006). https:\/\/doi.org\/10.1287\/trsc.1050.0135","journal-title":"Transp. Sci."},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000070","volume":"11","author":"D Russo","year":"2018","unstructured":"Russo, D., Van Roy, B., Kazerouni, A., Osband, I., Wen, Z.: A tutorial on Thompson sampling. Found. Trends Mach. Learn. 11(1), 1\u201396 (2018)","journal-title":"Found. Trends Mach. Learn."},{"issue":"3\u20134","key":"24_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\u20134), 285\u2013294 (1933)","journal-title":"Biometrika"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-30494-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T22:38:22Z","timestamp":1782945502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-30494-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,2]]},"ISBN":["9783032304933","9783032304940"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-30494-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,2]]},"assertion":[{"value":"2 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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"}}]}}