{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:55:27Z","timestamp":1743062127477,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030856717"},{"type":"electronic","value":"9783030856724"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85672-4_4","type":"book-chapter","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T21:02:30Z","timestamp":1629147750000},"page":"45-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Learning-Based Iterated Local Search Algorithm for Solving the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2889-5769","authenticated-orcid":false,"given":"Maryam","family":"Karimi-Mamaghan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8417-7537","authenticated-orcid":false,"given":"Bastien","family":"Pasdeloup","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3726-8356","authenticated-orcid":false,"given":"Mehrdad","family":"Mohammadi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6479-213X","authenticated-orcid":false,"given":"Patrick","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,17]]},"reference":[{"key":"4_CR1","unstructured":"www.elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsplib.html"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2017.12.045","volume":"65","author":"E Ahmadi","year":"2018","unstructured":"Ahmadi, E., Goldengorin, B., S\u00fcer, G.A., Mosadegh, H.: A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem. Appl. Soft Comput. 65, 214\u2013229 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"4_CR3","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."},{"key":"4_CR4","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-319-91086-4_14","volume-title":"Handbook of Metaheuristics","author":"EK Burke","year":"2019","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches: revisited. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 453\u2013477. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_14"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1515\/math-2017-0029","volume":"15","author":"L Calvet","year":"2017","unstructured":"Calvet, L., de Armas, J., Masip, D., Juan, A.A.: Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs. Open Math. 15(1), 261\u2013280 (2017)","journal-title":"Open Math."},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"656","DOI":"10.4149\/cai_2018_3_656","volume":"37","author":"M El Krari","year":"2018","unstructured":"El Krari, M., El Benani, B., et al.: Breakout local search for the travelling salesman problem. Comput. Inform. 37(3), 656\u2013672 (2018)","journal-title":"Comput. Inform."},{"key":"4_CR7","unstructured":"Fialho, \u00c1.: Adaptive operator selection for optimization. Ph.D. thesis, Universit\u00e9 Paris Sud - Paris XI (2010)"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2020.01.061","volume":"285","author":"M Karimi-Mamaghan","year":"2020","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Jula, P., Pirayesh, A., Ahmadi, H.: A learning-based metaheuristic for a multi-objective agile inspection planning model under uncertainty. Eur. J. Oper. Res. 285(2), 513\u2013537 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR9","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Pasdeloup, B., Billot, R., Meyer, P.: An online learning-based metaheuristic for solving combinatorial optimization problems. In: 21\u00e8me congr\u00e8s annuel de la soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d\u2019Aide \u00e0 la D\u00e9cision (ROADEF) (2020)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"102069","DOI":"10.1016\/j.tre.2020.102069","volume":"142","author":"M Karimi-Mamaghan","year":"2020","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Pirayesh, A., Karimi-Mamaghan, A.M., Irani, H.: Hub-and-spoke network design under congestion: a learning based metaheuristic. Transp. Res. Part E: Logist. Transp. Rev. 142, 102069 (2020)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A.M., Talbi, E.G.: Machine Learning at the service of Meta-heuristics for solving Combinatorial Optimization Problems: A state-of-the-art. Eur. J. Oper. Res. (2021)","DOI":"10.1016\/j.ejor.2021.04.032"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45\u201368 (1975)","journal-title":"Networks"},{"key":"4_CR13","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. ISOR, vol. 57, pp. 320\u2013353. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_11"},{"issue":"6","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tre.2019.01.008","volume":"123","author":"M Mohammadi","year":"2019","unstructured":"Mohammadi, M., Jula, P., Tavakkoli-Moghaddam, R.: Reliable single-allocation hub location problem with disruptions. Transp. Res. Part E: Logist. Transp. Rev. 123, 90\u2013120 (2019)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"9\u201310","key":"4_CR16","doi-asserted-by":"publisher","first-page":"5621","DOI":"10.1016\/j.apm.2016.01.011","volume":"40","author":"M Mohammadi","year":"2016","unstructured":"Mohammadi, M., Tavakkoli-Moghaddam, R., Siadat, A., Dantan, J.Y.: Design of a reliable logistics network with hub disruption under uncertainty. Appl. Math. Model. 40(9\u201310), 5621\u20135642 (2016)","journal-title":"Appl. Math. Model."},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.ejor.2019.09.021","volume":"282","author":"H Mosadegh","year":"2020","unstructured":"Mosadegh, H., Ghomi, S.F., S\u00fcer, G.A.: Stochastic mixed-model assembly line sequencing problem: mathematical modeling and q-learning based simulated annealing hyper-heuristics. Eur. J. Oper. Res. 282(2), 530\u2013544 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR18","unstructured":"Pasdeloup, B., Karimi-Mamaghan, M., Mohammadi, M., Meyer, P.: Autoencoder-based generation of individuals in population-based metaheuristics. In: ROADEF 2020: 21\u00e8me Congr\u00e8s Annuel de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d\u2019Aide \u00e0 la D\u00e9cision (2020)"},{"issue":"21","key":"4_CR19","doi-asserted-by":"publisher","first-page":"6055","DOI":"10.3390\/su11216055","volume":"11","author":"B Peng","year":"2019","unstructured":"Peng, B., Zhang, Y., Gajpal, Y., Chen, X.: A memetic algorithm for the green vehicle routing problem. Sustainability 11(21), 6055 (2019)","journal-title":"Sustainability"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-02538-9_11","volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","author":"E Ridge","year":"2010","unstructured":"Ridge, E., Kudenko, D.: Tuning an algorithm using design of experiments. In: Bartz-Beielstein, T., Chiarandini, M., Paquete, L., Preuss, M. (eds.) Experimental Methods for the Analysis of Optimization Algorithms, pp. 265\u2013286. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02538-9_11"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Sakurai, Y., Takada, K., Kawabe, T., Tsuruta, S.: A method to control parameters of evolutionary algorithms by using reinforcement learning. In: 2010 Sixth International Conference on Signal-Image Technology and Internet Based Systems, pp. 74\u201379. IEEE (2010)","DOI":"10.1109\/SITIS.2010.22"},{"issue":"10","key":"4_CR22","doi-asserted-by":"publisher","first-page":"4939","DOI":"10.1016\/j.eswa.2014.01.040","volume":"41","author":"JPQ dos Santos","year":"2014","unstructured":"dos Santos, J.P.Q., de Melo, J.D., Neto, A.D.D., Aloise, D.: Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search. Expert Syst. Appl. 41(10), 4939\u20134949 (2014)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13748-019-00185-z","volume":"8","author":"H Song","year":"2019","unstructured":"Song, H., Triguero, I., \u00d6zcan, E.: A review on the self and dual interactions between machine learning and optimisation. Progr. Artif. Intell. 8(2), 143\u2013165 (2019). https:\/\/doi.org\/10.1007\/s13748-019-00185-z","journal-title":"Progr. Artif. Intell."},{"key":"4_CR24","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)"},{"key":"4_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation, vol. 74. Wiley, Hoboken (2009)"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10479-015-2034-y","volume":"240","author":"EG Talbi","year":"2016","unstructured":"Talbi, E.G.: Combining metaheuristics with mathematical programming, constraint programming and machine learning. Ann. Oper. Res. 240(1), 171\u2013215 (2016). https:\/\/doi.org\/10.1007\/s10479-015-2034-y","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2020.10.045","volume":"292","author":"R Turke\u0161","year":"2021","unstructured":"Turke\u0161, R., S\u00f6rensen, K., Hvattum, L.M.: Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search. Eur. J. Oper. Res. 292(2), 423\u2013442 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR28","unstructured":"Watkins, C.J.C.H.: Learning from delayed rewards (1989)"},{"key":"4_CR29","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-30671-6_17","volume-title":"Hybrid Metaheuristics","author":"T Wauters","year":"2013","unstructured":"Wauters, T., Verbeeck, K., De Causmaecker, P., Berghe, G.V.: Boosting metaheuristic search using reinforcement learning. In: Talbi, E.G. (ed.) Hybrid Metaheuristics. Studies in Computational Intelligence, vol. 434, pp. 433\u2013452. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30671-6_17"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.tre.2016.02.011","volume":"89","author":"M Zhalechian","year":"2016","unstructured":"Zhalechian, M., Tavakkoli-Moghaddam, R., Zahiri, B., Mohammadi, M.: Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty. Transp. Res. Part E: Logist. Transp. Rev. 89, 182\u2013214 (2016)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85672-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T21:02:56Z","timestamp":1629147776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85672-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030856717","9783030856724"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85672-4_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Catania","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2021a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2021.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"27","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":"44% - 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","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":"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":"Due to the COVID-19 pandemic the conference was held in a virtual mode.","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)"}}]}}