{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:45:40Z","timestamp":1740181540091,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T00:00:00Z","timestamp":1650412800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T00:00:00Z","timestamp":1650412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"TrackOpt","award":["753592"],"award-info":[{"award-number":["753592"]}]},{"name":"SamobiGROW","award":["1910032"],"award-info":[{"award-number":["1910032"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s42979-022-01120-1","type":"journal-article","created":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T11:03:42Z","timestamp":1650452622000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Defining Parallel Local Search Procedures with Neighborhood Combinators"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4852-9299","authenticated-orcid":false,"given":"Gustavo","family":"Ospina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renaud","family":"De Landtsheer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,20]]},"reference":[{"key":"1120_CR1","volume-title":"Constraint-based local search","author":"P Van Hentenryck","year":"2009","unstructured":"Van Hentenryck P, Michel L. Constraint-based local search. Cambridge: MIT Press; 2009."},{"key":"1120_CR2","doi-asserted-by":"crossref","unstructured":"De Landtsheer R, Guyot Y, Ospina G, Ponsard C. Combining Neighborhoods into Local Search Strategies. New York, NY, USA: Recent developments of metaheuristics. Springer; 2016.","DOI":"10.1007\/978-3-319-58253-5_3"},{"key":"1120_CR3","unstructured":"OscaR Team: OscaR: operational research in Scala. Available under the Lesser General Public License. 2012. https:\/\/bitbucket.org\/oscarlib\/oscar."},{"key":"1120_CR4","unstructured":"Hewitt C. Actor model of computation for scalable robust information systems. In: Symposium on Logic and Collaboration for Intelligent Applications, Stanford, USA; 2017. https:\/\/hal.archives-ouvertes.fr\/hal-01163534."},{"key":"1120_CR5","unstructured":"Lightbend Inc.: Akka Framework. 2020. https:\/\/akka.io."},{"key":"1120_CR6","unstructured":"Aarts E, Lenstra JK, editors. Local search in combinatorial optimization. 1st ed. New York : Wiley; 1997."},{"issue":"3","key":"1120_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10288-011-0165-9","volume":"9","author":"T Benoist","year":"2011","unstructured":"Benoist T, Estellon B, Gardi F, Megel R, Nouioua K. Localsolver 1.x: a black-box local-search solver for 0-1 programming. 4OR. 2011;9(3):299\u2013316.","journal-title":"4OR"},{"issue":"8","key":"1120_CR8","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L Di Gaspero","year":"2003","unstructured":"Di Gaspero L, Schaerf A. EASYLOCAL++: an object-oriented framework for the flexible design of local-search algorithms. Softw Pract Exp. 2003;33(8):733\u201365.","journal-title":"Softw Pract Exp"},{"key":"1120_CR9","doi-asserted-by":"crossref","unstructured":"Michel L, Van Hentenryck P. Localizer: a modeling language for local search. In: Principles and practice of constraint programming-CP97; 1997.","DOI":"10.1007\/BFb0017443"},{"key":"1120_CR10","doi-asserted-by":"crossref","unstructured":"Newton MAH, Pham DN, Sattar A, Maher M. Kangaroo: an efficient constraint-based local search system using lazy propagation. In: Proceedings of CP\u201911; 2011. pp. 645\u201359.","DOI":"10.1007\/978-3-642-23786-7_49"},{"issue":"2","key":"1120_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10601-005-0553-x","volume":"10","author":"P Van Hentenryck","year":"2005","unstructured":"Van Hentenryck P, Michel L. Control abstractions for local search. Constraints. 2005;10(2):137\u201357. https:\/\/doi.org\/10.1007\/s10601-005-0553-x.","journal-title":"Constraints"},{"key":"1120_CR12","doi-asserted-by":"crossref","unstructured":"Isoart N, R\u00e9gin J. Parallelization of TSP solving in CP. In: Simonis H, editor. Principles and practice of constraint programming (CP 2020), vol. 12333. Lecture notes in computer science. New York: Springer; 2020. p. 410\u201326.","DOI":"10.1007\/978-3-030-58475-7_24"},{"key":"1120_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M Verhoeven","year":"1995","unstructured":"Verhoeven M, Aarts E. Parallel local search. J Heuristics. 1995;1:43\u201365. https:\/\/doi.org\/10.1007\/BF02430365.","journal-title":"J Heuristics"},{"key":"1120_CR14","doi-asserted-by":"crossref","unstructured":"Handa Y, Ono H, Sadakane K, Yamashita M. Neighborhood composition: a parallelization of local search algorithms. In: Kranzlm\u00fcller D, Kacsuk P, Dongarra JJ, editors. Recent advances in parallel virtual machine and message passing interface, vol. 3241. Lecture notes in computer science. New York: Springer; 2004. p. 155\u201363.","DOI":"10.1007\/978-3-540-30218-6_26"},{"key":"1120_CR15","doi-asserted-by":"publisher","unstructured":"Codognet P, Munera D, Diaz D, Abreu S. Parallel local search. In: Hamadi Y, Sais L (eds) Handbook of parallel constraint reasoning. New York: Springer; 2018. pp. 381\u2013417. https:\/\/doi.org\/10.1007\/978-3-319-63516-3_10.","DOI":"10.1007\/978-3-319-63516-3_10"},{"key":"1120_CR16","doi-asserted-by":"publisher","unstructured":"Munera D, Diaz D, Abreu S, Codognet P. A parametric framework for cooperative parallel local search. In: Blum C, Ochoa G (eds) Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2014). Lecture notes in computer science, vol. 8600. New York: Springer; 2014. pp. 13\u201324. https:\/\/doi.org\/10.1007\/978-3-662-44320-0_2.","DOI":"10.1007\/978-3-662-44320-0_2"},{"key":"1120_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.cor.2008.08.014","volume":"36","author":"L Michel","year":"2009","unstructured":"Michel L, See A, Van Hentenryck P. Parallel and distributed local search in COMET. Comput OR. 2009;36:235\u201372375. https:\/\/doi.org\/10.1016\/j.cor.2008.08.014.","journal-title":"Comput OR"},{"issue":"3","key":"1120_CR18","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/B:HEUR.0000026900.92269.ec","volume":"10","author":"S Cahon","year":"2004","unstructured":"Cahon S, Melab N, Talbi E-G. ParadisEO: a framework for the reusable design of parallel and distributed metaheuristics. J Heuristics. 2004;10(3):357\u201380. https:\/\/doi.org\/10.1023\/B:HEUR.0000026900.92269.ec.","journal-title":"J Heuristics"},{"key":"1120_CR19","volume-title":"Concepts, techniques, and models of computer programming","author":"P Van Roy","year":"2004","unstructured":"Van Roy P, Haridi S. Concepts, techniques, and models of computer programming. 1st ed. Cambridge: The MIT Press; 2004.","edition":"1"},{"issue":"2","key":"1120_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10601-011-9114-7","volume":"17","author":"S Mouthuy","year":"2012","unstructured":"Mouthuy S, Van Hentenryck P, Deville Y. Constraint-based very large-scale neighborhood search. Constraints. 2012;17(2):87\u2013122.","journal-title":"Constraints"},{"issue":"4","key":"1120_CR21","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1002\/net.21876","volume":"73","author":"P Matl","year":"2019","unstructured":"Matl P, Hartl RF, Vidal T. Leveraging single-objective heuristics to solve bi-objective problems: Heuristic box splitting and its application to vehicle routing. Networks. 2019;73(4):382\u2013400. https:\/\/doi.org\/10.1002\/net.21876.","journal-title":"Networks"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01120-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01120-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01120-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T17:24:09Z","timestamp":1652117049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01120-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,20]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1120"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01120-1","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"type":"print","value":"2662-995X"},{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,4,20]]},"assertion":[{"value":"16 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"231"}}