{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:34:42Z","timestamp":1760646882219},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_11","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"39-87","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Data Mining in Stochastic Local Search"],"prefix":"10.1007","author":[{"given":"Simone","family":"de Lima Martins","sequence":"first","affiliation":[]},{"given":"Isabel","family":"Rosseti","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Plastino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD international conference on management of data, Washington, DC, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"11_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases, Santiago, pp 487\u2013499"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Aiex R, Resende MGC, Ribeiro CC (2007) TTTplots: a perl program to create time-to-target plots. Optim Lett 1:355\u2013366","DOI":"10.1007\/s11590-006-0031-4"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Aloise D, Ribeiro CC (2011) Adaptive memory in multistart heuristics for multicommodity network design. J Heuristics 17:153\u2013179","DOI":"10.1007\/s10732-010-9130-6"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Barbalho H, Rosseti I, Martins SL, Plastino A (2013) A hybrid data mining GRASP with path-relinking. Comput Oper Res 40:3159\u20133173","DOI":"10.1016\/j.cor.2012.02.022"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Beasley JE (1985) A note on solving large p-median problems. Eur J Oper Res 21:270\u2013273","DOI":"10.1016\/0377-2217(85)90040-2"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Breslau L, Diakonikolas I, Duffield N, Gu Y, Hajiaghayi M, Johnson DS, Karloff H, Resende MGC, Sen S (2011) Disjoint-path facility location: theory and practice. In: Proceedings of the thirteenth workshop of algorithm engineering and experiments (ALENEX11). SIAM, Philadelphia, pp 60\u201374","DOI":"10.1137\/1.9781611972917.7"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Campos V, Pi\u00f1ana E, Mart\u00ed R (2011) Adaptive memory programming for matrix bandwidth minimization. Ann Oper Res 183:7\u201323","DOI":"10.1007\/s10479-009-0573-9"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Chaovalitwongse W, Oliveira C, Chiarini B, Pardalos P, Resende MGC (2011) Revised GRASP with path-relinking for the linear ordering problem. J Comb Optim 22:1\u201322","DOI":"10.1007\/s10878-010-9306-x"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Dahl G, Johannessen B (2004) The 2-path network problem. Networks 43:190\u2013199","DOI":"10.1002\/net.20003"},{"key":"11_CR11","unstructured":"Eiben A, Smith J (2007) Introduction to evolutionary computing. Springer-Verlag, Berlin"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","DOI":"10.1007\/BF01096763"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Fleurent C, Glover F (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J Comput 2:198\u2013204","DOI":"10.1287\/ijoc.11.2.198"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Mart\u00ednez C, Rodriguez F, Lozano M (2012) Arbitrary function optimisation with metaheuristics. Soft Comput 16:2115\u20132133","DOI":"10.1007\/s00500-012-0881-x"},{"key":"11_CR15","unstructured":"Glover F, Laguna M, Mart\u00ed R (2000) Fundamentals of scatter search and path relinking. Control Cybern 39:653\u2013684"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M, Mart\u00ed R (2003) Scatter search and path relinking: advances and applications. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics. International series in operations research & management science, vol 57. Springer, Boston, pp 1\u201335","DOI":"10.1007\/0-306-48056-5_1"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Goethals B, Zaki MJ (2004) Advances in frequent itemset mining implementations: report on fimi\u201903. SIGKDD Explor Newsl 6:109\u2013117","DOI":"10.1145\/1007730.1007744"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves LB, Martins SL, Ochi LS (2010) Effective heuristics for the set covering with pairs problem. Int Trans Oper Res 17:739\u2013751","DOI":"10.1111\/j.1475-3995.2010.00768.x"},{"key":"11_CR19","unstructured":"Grahne G, Zhu J (2003) Efficiently using prefix-trees in mining frequent itemsets. In: Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations, Melbourne, Florida, USA"},{"key":"11_CR20","unstructured":"Guerine M, Rosseti I, Plastino A (2014) Extending the hybridization of metaheuristics with data mining to a broader domain. In: Proceedings of the 16th international conference on enterprise systems, Lisboa, pp 395\u2013406"},{"key":"11_CR21","unstructured":"Han J, Kamber M (2011) Data mining: concepts and techniques, 3rd edn. Morgan Kaufmann, San Francisco"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD international conference on management of data, Washington, DC, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P Hansen","year":"1997","unstructured":"Hansen P, Mladenovi\u0107 N (1997) Variable neighborhood search for the p-median. Locat Sci 5:207\u2013226","journal-title":"Locat Sci"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N, Perez-Brito D (2001) Variable neighborhood decomposition search. J Heuristics 7:335\u2013350","journal-title":"J Heuristics"},{"key":"11_CR25","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11590156_13","volume-title":"FSTTCS 2005: foundations of software technology and theoretical computer science","author":"R Hassin","year":"2005","unstructured":"Hassin R, Segev D (2005) The set cover with pairs problem. In: Sarukkai S, Sen S (eds) FSTTCS 2005: foundations of software technology and theoretical computer science. Lecture notes in computer science, vol 3821. Springer, Berlin\/Heidelberg, pp 164\u2013176"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.dam.2003.09.013","volume":"145","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez H, Salazar-Gonz\u00e1lez JJ (2004) A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discret Appl Math 145:453\u2013459","journal-title":"Discret Appl Math"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1016\/j.cor.2008.03.008","volume":"36","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2009","unstructured":"Hern\u00e1ndez-P\u00e9rez H, Salazar-Gonz\u00e1lez JJ, Rodr\u00edguez-Mart\u00edn I (2009) A hybrid GRASP\/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Comput Oper Res 36:1639\u20131645. https:\/\/doi.org\/10.1016\/j.cor.2008.03.008","journal-title":"Comput Oper Res"},{"key":"11_CR28","volume-title":"Tutorial(AAAI-04): stochastic local search: foundations and applications","author":"HH Hoos","year":"2004","unstructured":"Hoos HH, St\u00fctzle T (2004) Tutorial(AAAI-04): stochastic local search: foundations and applications. Elsevier, Burlington. http:\/\/www.sls-book.net\/Slides\/aaai-04-tutorial.pdf"},{"key":"11_CR29","volume-title":"Stochastic local search: foundations and applications","author":"HH Hoos","year":"2005","unstructured":"Hoos HH, St\u00fctzle T (2005) Stochastic local search: foundations and applications. Elsevier, San Francisco"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(03)00222-9","volume":"86","author":"C Igel","year":"2003","unstructured":"Igel C, Toussaint M (2003) On classes of functions for which no free lunch results hold. Inf Process Lett IPL 86:317\u2013321","journal-title":"Inf Process Lett IPL"},{"key":"11_CR31","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/11890584_5","volume-title":"Hybrid metaheuristics","author":"L Jourdan","year":"2006","unstructured":"Jourdan L, Dhaenens C, Talbi EG (2006) Using datamining techniques to help metaheuristics: a short survey. In: Almeida F, Blesa Aguilera M, Blum C, Moreno Vega JM, P\u00e9rez P\u00e9rez M, Roli A, Sampels M (eds) Hybrid metaheuristics. Lecture notes in computer science, vol 4030. Springer, Berlin\/Heidelberg, pp 57\u201369"},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. II: the p-medians. SIAM J Appl Math 37:513\u2013538","journal-title":"SIAM J Appl Math"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M Laguna","year":"1999","unstructured":"Laguna M, Mart\u00ed R (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11:44\u201352","journal-title":"INFORMS J Comput"},{"key":"11_CR34","unstructured":"Li B, Chen F, Yin L (2000) Server replication and its placement for reliable multicast. In: Proceedings of the 9th international conference on computer communication and networks, Las Vegas, pp 396\u2013401"},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan B (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A Lodi","year":"1999","unstructured":"Lodi A, Allemand K, Liebling TM (1999) An evolutionary heuristic for quadratic 01 programming. Eur J Oper Res 119:662\u2013670","journal-title":"Eur J Oper Res"},{"key":"11_CR37","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 HR, Martin OC, St\u00fctzle T (2003) Iterated local search. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics, vol. 57. Springer, Boston, pp 320\u2013353"},{"key":"11_CR38","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 (1997) Variable neighborhood search. Comput Oper Res 24:1097\u20131100","journal-title":"Comput Oper Res"},{"key":"11_CR39","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10732-013-9231-0","volume":"20","author":"A Plastino","year":"2014","unstructured":"Plastino A, Barbalho H, Santos LFM, Fuchshuber R, Martins SL (2014) Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic. J. Heuristics 20:39\u201374","journal-title":"J. Heuristics"},{"key":"11_CR40","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/sam.10116","volume":"4","author":"A Plastino","year":"2011","unstructured":"Plastino A, Fuchshuber R, Martins SL, Freitas AA, Salhi S (2011) A hybrid data mining metaheuristic for the p-median problem. Stat Anal Data Min 4:313\u2013335","journal-title":"Stat Anal Data Min"},{"key":"11_CR41","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB: a traveling salesman problem library. ORSA J Comput 3:376\u2013384. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/","journal-title":"ORSA J Comput"},{"key":"11_CR42","series-title":"Operations research\/computer science interfaces series","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: progress as real problem solvers","author":"MGC Resende","year":"2005","unstructured":"Resende MGC, Ribeiro CC (2005) GRASP with path-relinking: recent advances and applications. In: Ibaraki T, Nonobe K, Yagiura M (eds) Metaheuristics: progress as real problem solvers. Operations research\/computer science interfaces series, vol 32. Springer, New York, pp 29\u201363"},{"key":"11_CR43","first-page":"119","volume-title":"Proceedings of the thirteenth workshop of algorithm engineering and experiments (ALENEX03)","author":"MGC Resende","year":"2003","unstructured":"Resende MGC, Werneck RF (2003) On the implementation of a swap-based local search procedure for the p-median problem. In: Proceedings of the thirteenth workshop of algorithm engineering and experiments (ALENEX03). SIAM, Baltimore, Maryland, USA, pp 119\u2013127"},{"key":"11_CR44","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"MGC Resende","year":"2004","unstructured":"Resende MGC, Werneck RF (2004) A hybrid heuristic for the p-median problem. J Heuristics 10:59\u201388","journal-title":"J Heuristics"},{"key":"11_CR45","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10732-011-9167-1","volume":"18","author":"CC Ribeiro","year":"2012","unstructured":"Ribeiro CC, Resende MGC (2012) Path-relinking intensification methods for stochastic local search algorithms. J Heuristics 18:193\u2013214","journal-title":"J Heuristics"},{"key":"11_CR46","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.parco.2006.11.007","volume":"33","author":"CC Ribeiro","year":"2007","unstructured":"Ribeiro CC, Rosseti I (2007) Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput 33:21\u201335","journal-title":"Parallel Comput"},{"key":"11_CR47","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10852-005-9030-1","volume":"5","author":"MH Ribeiro","year":"2006","unstructured":"Ribeiro MH, Plastino A, Martins SL (2006) Hybridization of grasp metaheuristic with data mining techniques. J Math Model Algorithms 5:23\u201341","journal-title":"J Math Model Algorithms"},{"key":"11_CR48","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.neucom.2006.07.008","volume":"70","author":"HG Santos","year":"2006","unstructured":"Santos HG, Ochi LS, Marinho EH, Drummond LM (2006) Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem. Neurocomputing 70: 70\u201377","journal-title":"Neurocomputing"},{"key":"11_CR49","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1111\/j.1475-3995.2008.00644.x","volume":"15","author":"LF Santos","year":"2008","unstructured":"Santos LF, Martins SL, Plastino A (2008) Applications of the DM-GRASP heuristic: a survey. Int Trans Oper Res 15:387\u2013416","journal-title":"Int Trans Oper Res"},{"key":"11_CR50","series-title":"Operations research\/computer science interfaces series","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-1-4615-4567-5_6","volume-title":"Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research","author":"ELF Senne","year":"2000","unstructured":"Senne ELF, Lorena LAN (2000) Langrangean\/surrogate heuristics for p-median problems. In: Laguna M, Gonz\u00e1lez-Velarde JL (eds) Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research. Operations research\/computer science interfaces series, vol 32. Kluwer, Boston, pp 115\u2013130"},{"key":"11_CR51","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1021841728075","volume":"9","author":"ED Taillard","year":"2003","unstructured":"Taillard ED (2003) Heuristic methods for large centroid clustering problems. J Heuristics 9: 51\u201374","journal-title":"J Heuristics"},{"key":"11_CR52","volume-title":"Introduction to data mining","author":"PN Tan","year":"2015","unstructured":"Tan PN, Steinback M, Kumar V (2015) Introduction to data mining, 2nd edn. Addison-Wesley, Boston, MA, USA","edition":"2"},{"key":"11_CR53","first-page":"482","volume":"29","author":"BC Tansel","year":"1983","unstructured":"Tansel BC, Francis RL, Lowe TJ (1983) A hybrid heuristic for the p-median problem. J Heuristics 29:482\u2013511","journal-title":"J Heuristics"},{"key":"11_CR54","volume-title":"Data mining: practical machine learning tools and techniques with java implementations","author":"IH Witten","year":"2011","unstructured":"Witten IH, Frank E (2011) Data mining: practical machine learning tools and techniques with java implementations, 3rd edn. Morgan Kaufmann, Burlington","edition":"3"},{"key":"11_CR55","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macread WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1:67\u201382","journal-title":"IEEE Trans Evolut Comput"},{"key":"11_CR56","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810114","volume-title":"Data mining and analysis: fundamental concepts and algorithms","author":"MJ Zaki","year":"2014","unstructured":"Zaki MJ, Wagner Meira J (2014) Data mining and analysis: fundamental concepts and algorithms. Cambridge University Press, New York"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:17:53Z","timestamp":1571728673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_11","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}