{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T06:48:13Z","timestamp":1750920493862,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T00:00:00Z","timestamp":1582329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T00:00:00Z","timestamp":1582329600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-020-01556-5","type":"journal-article","created":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T09:02:46Z","timestamp":1582362166000},"page":"97-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding the Maximum Multi Improvement on neighborhood exploration"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5811-2190","authenticated-orcid":false,"given":"Janio Carlos","family":"Nascimento Silva","sequence":"first","affiliation":[]},{"given":"Igor M.","family":"Coelho","sequence":"additional","affiliation":[]},{"given":"Ueverton S.","family":"Souza","sequence":"additional","affiliation":[]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[]},{"given":"Vitor N.","family":"Coelho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,22]]},"reference":[{"key":"1556_CR1","unstructured":"Araujo, R.P.: Strategies for neighborhood exploration with GPU for optimization problems. Master thesis, University of the State of Rio de Janeiro (2018) (in portuguese)"},{"key":"1556_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of the 26th ACM Symposium on the Theory of Computing, Montreal, Quebec, Canada, pp. 163\u2013171 (1994)","DOI":"10.1145\/195058.195125"},{"key":"1556_CR3","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-15996-2_5","volume-title":"High Performance Computing for Computational Science\u2014VECPAR 2018","author":"E Cieza","year":"2019","unstructured":"Cieza, E., Teylo, L., Frota, Y., Bentes, C., Drummond, L.M.A.: A GPU-based metaheuristic for workflow scheduling on clouds. In: Senger, H., Marques, O., Garcia, R., Pinheiro de Brito, T., Iope, R., Stanzani, S., Gil-Costa, V. (eds.) High Performance Computing for Computational Science\u2014VECPAR 2018, pp. 62\u201376. Springer International Publishing, Cham (2019)"},{"issue":"1","key":"1556_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"RK Congram","year":"2002","unstructured":"Congram, R.K., Potts, C.N., van de Velde, S.L.: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J. Comput. 14(1), 52\u201367 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"1556_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood, M.M.: The traveling-salesman problem. Oper. Res. 4(1), 61\u201375 (1956)","journal-title":"Oper. Res."},{"key":"1556_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY (1979)"},{"key":"1556_CR7","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1007\/978-1-4613-0303-9_33","volume-title":"Handbook of Combinatorial Optimization","author":"F Glover","year":"1998","unstructured":"Glover, F., Laguna, M.: Tabu search. In: Du, D., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 2093\u20132229. Springer, Berlin (1998)"},{"issue":"5","key":"1556_CR8","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1016\/j.dam.2005.05.020","volume":"154","author":"P Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N.: First vs. best improvement: an empirical study. Discrete Appl. Math. 154(5), 802\u2013817 (2006)","journal-title":"Discrete Appl. Math."},{"key":"1556_CR9","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11\u201313, 1993","author":"DS Johnson","year":"1996","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11\u201313, 1993, vol. 26. American Mathematical Society, Providence (1996)"},{"key":"1556_CR10","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: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 320\u2013353. Springer, Berlin (2003)"},{"issue":"11","key":"1556_CR11","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":"1556_CR12","unstructured":"Potts, C.N.: Dynasearch-iterative local improvement by dynamic programming. Internal technical Report LPOM-95-11 (1995)"},{"issue":"4","key":"1556_CR13","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: Tsplib\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"1556_CR14","doi-asserted-by":"crossref","unstructured":"Rios, E., Coelho, I.M., Ochi, L.S., Boeres, C., Farias, R.: A benchmark on multi improvement neighborhood search strategies in CPU\/GPU systems. In: 2016 International Symposium on Computer Architecture and High Performance Computing Workshops (SBAC-PADW), pp. 49\u201354. IEEE (2016)","DOI":"10.1109\/SBAC-PADW.2016.17"},{"key":"1556_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jpdc.2017.06.011","volume":"111","author":"E Rios","year":"2018","unstructured":"Rios, E., Ochi, L.S., Boeres, C., Coelho, V.N., Coelho, I.M., Farias, R.: Exploring parallel multi-GPU local search strategies in a metaheuristic framework. J. Parallel Distrib. Comput. 111, 39\u201355 (2018)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"1556_CR16","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/0196-6774(88)90042-9","volume":"9","author":"D Soroker","year":"1988","unstructured":"Soroker, D.: Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament. J. Algorithms 9(2), 276\u2013286 (1988)","journal-title":"J. Algorithms"},{"key":"1556_CR17","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)"},{"key":"1556_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1018908614375","volume":"90","author":"M Verhoeven","year":"1999","unstructured":"Verhoeven, M., Severens, M.: Parallel local search for steiner trees in graphs. Ann. Oper. Res. 90, 185\u2013202 (1999). https:\/\/doi.org\/10.1023\/A:1018908614375","journal-title":"Ann. Oper. Res."},{"key":"1556_CR19","unstructured":"Xu, K.: Bhoslib: Benchmarks with hidden optimum solutions for graph problems (maximum clique, maximum independent set, minimum vertex cover and vertex coloring)\u2014hiding exact solutions in random graphs. http:\/\/www.nlsde.buaa.edu.en\/~exu\/benchmarks\/graphbenchmarks.htm (2004)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01556-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01556-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01556-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:39:32Z","timestamp":1641814772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01556-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,22]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1556"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01556-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2020,2,22]]},"assertion":[{"value":"1 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}