{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T16:41:01Z","timestamp":1785602461373,"version":"3.56.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031264184","type":"print"},{"value":"9783031264191","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26419-1_22","type":"book-chapter","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:24:57Z","timestamp":1679876697000},"page":"361-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Learning to\u00a0Control Local Search for\u00a0Combinatorial Optimization"],"prefix":"10.1007","author":[{"given":"Jonas K.","family":"Falkner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniela","family":"Thyssens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmad","family":"Bdeir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lars","family":"Schmidt-Thieme","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9780691187563","volume-title":"Local search in Combinatorial Optimization","author":"E Aarts","year":"2003","unstructured":"Aarts, E., Aarts, E.H., Lenstra, J.K.: Local search in Combinatorial Optimization. Princeton University Press, Princeton (2003)"},{"key":"22_CR2","unstructured":"Ba, J.L., Kiros, J.R., Hinton, G.E.: Layer normalization. arXiv preprint arXiv:1607.06450 (2016)"},{"key":"22_CR3","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 (2016)"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"JH Blackstone","year":"1982","unstructured":"Blackstone, J.H., Phillips, D.T., Hogg, G.L.: A state-of-the-art survey of dispatching rules for manufacturing job shop operations. Int. J. Prod. Res. 20(1), 27\u201345 (1982)","journal-title":"Int. J. Prod. Res."},{"key":"22_CR6","unstructured":"Chen, X., Tian, Y.: Learning to perform local rewriting for combinatorial optimization. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"issue":"4","key":"22_CR7","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Dabney, W., Ostrovski, G., Silver, D., Munos, R.: Implicit quantile networks for distributional reinforcement learning. In: International Conference on Machine Learning, pp. 1096\u20131105. PMLR (2018)","DOI":"10.1609\/aaai.v32i1.11791"},{"key":"22_CR9","unstructured":"Falkner, J.K., Schmidt-Thieme, L.: Learning to solve vehicle routing problems with time windows through joint attention. arXiv preprint arXiv:2006.09100 (2020)"},{"key":"22_CR10","unstructured":"Gasse, M., Ch\u00e9telat, D., Ferroni, N., Charlin, L., Lodi, A.: Exact combinatorial optimization with graph convolutional neural networks. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"22_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74759-0","volume-title":"Handbook of Metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau, M., Potvin, J.Y., et al.: Handbook of Metaheuristics, vol. 2. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-0-387-74759-0"},{"issue":"5","key":"22_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s12532-010-0013-5","volume":"2","author":"C Gro\u00ebr","year":"2010","unstructured":"Gro\u00ebr, C., Golden, B., Wasil, E.: A library of local search heuristics for the vehicle routing problem. Math. Program. Comput. 2(2), 79\u2013101 (2010)","journal-title":"Math. Program. Comput."},{"key":"22_CR14","unstructured":"Hendrycks, D., Gimpel, K.: Gaussian error linear units (GELUs). arXiv preprint arXiv:1606.08415 (2016)"},{"key":"22_CR15","unstructured":"Hottung, A., Kwon, Y.D., Tierney, K.: Efficient active search for combinatorial optimization problems. arXiv preprint arXiv:2106.05126 (2021)"},{"key":"22_CR16","unstructured":"Hottung, A., Tierney, K.: Neural large neighborhood search for the capacitated vehicle routing problem. arXiv preprint arXiv:1911.09539 (2019)"},{"key":"22_CR17","unstructured":"Hu, H., Zhang, X., Yan, X., Wang, L., Xu, Y.: Solving a new 3D bin packing problem with deep reinforcement learning method. arXiv preprint arXiv:1708.05930 (2017)"},{"key":"22_CR18","unstructured":"Hudson, B., Li, Q., Malencia, M., Prorok, A.: Graph neural network guided local search for the traveling salesperson problem. arXiv preprint arXiv:2110.05291 (2021)"},{"key":"22_CR19","unstructured":"Joshi, C.K., Laurent, T., Bresson, X.: An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227 (2019)"},{"key":"22_CR20","first-page":"6659","volume":"33","author":"N Karalias","year":"2020","unstructured":"Karalias, N., Loukas, A.: Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs. Adv. Neural. Inf. Process. Syst. 33, 6659\u20136672 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"22_CR21","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"issue":"4598","key":"22_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Kool, W., van Hoof, H., Gromicho, J., Welling, M.: Deep policy dynamic programming for vehicle routing problems. arXiv preprint arXiv:2102.11756 (2021)","DOI":"10.1007\/978-3-031-08011-1_14"},{"key":"22_CR24","unstructured":"Kool, W., Van Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"key":"22_CR25","first-page":"21188","volume":"33","author":"YD Kwon","year":"2020","unstructured":"Kwon, Y.D., Choo, J., Kim, B., Yoon, I., Gwon, Y., Min, S.: Pomo: policy optimization with multiple optima for reinforcement learning. Adv. Neural. Inf. Process. Syst. 33, 21188\u201321198 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"4","key":"22_CR26","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"22_CR27","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-91086-4_5","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2019","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 129\u2013168. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_5"},{"key":"22_CR28","unstructured":"Lu, H., Zhang, X., Yang, S.: A learning-based iterative method for solving vehicle routing problems. In: International Conference on Learning Representations (2019)"},{"key":"22_CR29","unstructured":"Ma, Y., Li, J., Cao, Z., Song, W., Zhang, L., Chen, Z., Tang, J.: Learning to iteratively solve routing problems with dual-aspect collaborative transformer. In: Advances in Neural Information Processing Systems, vol. 34 (2021)"},{"key":"22_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina, N., Sviridov, S., Ivanov, S., Burnaev, E.: Reinforcement learning for combinatorial optimization: a survey. Comput. Oper. Res. 134, 105400 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"22_CR31","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(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Morris, C., et al.: Weisfeiler and leman go neural: higher-order graph neural networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 4602\u20134609 (2019)","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"22_CR33","unstructured":"Nair, V., et al.: Solving mixed integer programs using neural networks. arXiv preprint arXiv:2012.13349 (2020)"},{"key":"22_CR34","unstructured":"Nazari, M., Oroojlooy, A., Snyder, L., Tak\u00e1c, M.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems, vol. 31 (2018)"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"d O Costa, P.R., Rhuggenaath, J., Zhang, Y., Akcay, A.: Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning. In: Asian Conference on Machine Learning, pp. 465\u2013480. PMLR (2020)","DOI":"10.1007\/s42979-021-00779-2"},{"key":"22_CR36","unstructured":"Park, J., Bakhtiyar, S., Park, J.: Schedulenet: learn to solve multi-agent scheduling problems with reinforcement learning. arXiv preprint arXiv:2106.03051 (2021)"},{"issue":"11","key":"22_CR37","doi-asserted-by":"publisher","first-page":"3360","DOI":"10.1080\/00207543.2020.1870013","volume":"59","author":"J Park","year":"2021","unstructured":"Park, J., Chun, J., Kim, S.H., Kim, Y., Park, J.: Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning. Int. J. Prod. Res. 59(11), 3360\u20133377 (2021)","journal-title":"Int. J. Prod. Res."},{"key":"22_CR38","unstructured":"Perron, L., Furnon, V.: Or-tools. https:\/\/developers.google.com\/optimization\/"},{"issue":"15","key":"22_CR39","doi-asserted-by":"publisher","first-page":"4255","DOI":"10.1080\/00207543.2011.611539","volume":"50","author":"V Sels","year":"2012","unstructured":"Sels, V., Gheysen, N., Vanhoucke, M.: A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions. Int. J. Prod. Res. 50(15), 4255\u20134270 (2012)","journal-title":"Int. J. Prod. Res."},{"key":"22_CR40","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"issue":"2","key":"22_CR41","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR42","unstructured":"Thyssens, D., Falkner, J., Schmidt-Thieme, L.: Supervised permutation invariant networks for solving the CVRP with bounded fleet size. arXiv preprint arXiv:2201.01529 (2022)"},{"key":"22_CR43","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. SIAM (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"22_CR44","unstructured":"Tsang, E.: Foundations of constraint satisfaction: the classic text. BoD-Books on Demand (2014)"},{"issue":"3","key":"22_CR45","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845\u2013858 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR46","doi-asserted-by":"crossref","unstructured":"Van Hasselt, H., Guez, A., Silver, D.: Deep reinforcement learning with double q-learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 30 (2016)","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"22_CR47","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"22_CR48","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"22_CR49","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"22_CR50","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-1-4419-1665-5_11","volume-title":"Handbook of Metaheuristics","author":"C Voudouris","year":"2010","unstructured":"Voudouris, C., Tsang, E.P., Alsheddy, A.: Guided local search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 321\u2013361. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_11"},{"issue":"9","key":"22_CR51","doi-asserted-by":"publisher","first-page":"5057","DOI":"10.1109\/TNNLS.2021.3068828","volume":"33","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Song, W., Cao, Z., Zhang, J., Lim, A.: Learning improvement heuristics for solving routing problems. IEEE Trans. Neural Netw. Learn. Syst. 33(9), 5057\u20135069 (2021)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"22_CR52","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Philip, S.Y.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 32(1), 4\u201324 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"22_CR53","first-page":"1621","volume":"33","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P.S., Chi, X.: Learning to dispatch for job shop scheduling via deep reinforcement learning. Adv. Neural. Inf. Process. Syst. 33, 1621\u20131632 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26419-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:32:25Z","timestamp":1679877145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26419-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031264184","9783031264191"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26419-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"236","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 demo track papers have been accepted from 28 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}