{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:02:01Z","timestamp":1762272121195,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591520"},{"type":"electronic","value":"9783319591537"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59153-7_6","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T20:53:33Z","timestamp":1494968013000},"page":"62-72","source":"Crossref","is-referenced-by-count":1,"title":["Tuning of Clustering Search Based Metaheuristic by Cross-Validated Racing Approach"],"prefix":"10.1007","author":[{"given":"Thiago Henrique Lemos","family":"Fonseca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre Cesar Muniz","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,18]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00483-4","volume-title":"Tuning Metaheuristics. A Machine Learning Perspective","author":"M Birattari","year":"2009","unstructured":"Birattari, M.: Tuning Metaheuristics. A Machine Learning Perspective. Springer, Heidelberg (2009)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-28645-5_39","volume-title":"Advances in Artificial Intelligence \u2013 SBIA 2004","author":"ACM Oliveira","year":"2004","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: Detecting promising areas by evolutionary clustering search. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS, vol. 3171, pp. 385\u2013394. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-28645-5_39"},{"key":"6_CR3","unstructured":"Universit Libre de Bruxelles. \nhttp:\/\/iridia.ulb.ac.be\/IridiaTrSeries\/rev\/IridiaTr2011-004r001.pdf"},{"key":"6_CR4","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., Stutzle, T.: Automated algorithm tuning using F-races: recent developments. In: The VIII Metaheuristics International Conference (2009)"},{"key":"6_CR5","first-page":"123","volume-title":"Encyclopedia of Database Systems","year":"2008","unstructured":"Liu, L., \u00d6zsu, M.T. (eds.): Encyclopedia of Database Systems, pp. 123\u2013134. Springer, Naples (2008). \nhttp:\/\/leitang.net\/papers\/ency-cross-validation.pdf"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1057\/palgrave.jors.2601466","volume":"53","author":"MS Nagano","year":"2002","unstructured":"Nagano, M.S., Moccellin, J.V.: A high quality solution constructive for flow shop sequencing. J. Oper. Res. Soc. 53, 1374\u20131379 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajedran","year":"2004","unstructured":"Rajedran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. Eur. J. Oper. Res. Amst. 155, 426\u2013436 (2004)","journal-title":"Eur. J. Oper. Res. Amst."},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. Amst. 31, 1891\u20131909 (2004)","journal-title":"Comput. Oper. Res. Amst."},{"issue":"2","key":"6_CR9","doi-asserted-by":"crossref","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. Amst. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res. Amst."},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. Amst. 47, 65\u201374 (1990)","journal-title":"Eur. J. Oper. Res. Amst."},{"key":"6_CR11","volume-title":"Simulation and the Monte Carlo Method","author":"YR Reuven","year":"2007","unstructured":"Reuven, Y.R., Dirk, P.K.: Simulation and the Monte Carlo Method. Wiley, Hoboken (2007)"},{"issue":"9","key":"6_CR12","first-page":"1","volume":"19","author":"TS Costa","year":"2014","unstructured":"Costa, T.S., Oliveira, A.C.M.: Artificial bee and differential evolution improved by clustering search on continuous domain optimization. Soft. Comput. 19(9), 1\u201312 (2014)","journal-title":"Soft. Comput."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"5499","DOI":"10.1016\/j.eswa.2011.11.072","volume":"39","author":"RM Oliveira","year":"2012","unstructured":"Oliveira, R.M., Mauri, G.R., Lorena, L.A.N.: Clustering search for the berth allocation problem. Expert Syst. Appl. 39, 5499\u20135505 (2012)","journal-title":"Expert Syst. Appl."},{"key":"6_CR14","unstructured":"Maron, O.: Dissertation: Hoeffding Races: Model Selection for MRI Classification. Massachusetts Institute of Technology (1992)"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"2","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 2, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"6_CR16","volume-title":"Foundations of Genetic Algorithms 2","author":"L Eshelman","year":"1993","unstructured":"Eshelman, L., Shaffer, J.: Real-coded genetic algorithms and interval schemata. In: Whitley, D.L. (ed.) Foundations of Genetic Algorithms 2. Morgan Kaufmann Publishers, San Mateo (1993)"},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.cor.2015.10.009","volume":"67","author":"LAN Lorena","year":"2016","unstructured":"Lorena, L.A.N., Chaves, A.A., Senne, E.L.F., Resende, M.G.C.: Hybrid method with CS and BRKGA applied to the minimization of tool switches problem. J. Comput. Oper. Res. 67, 174\u2013183 (2016)","journal-title":"J. Comput. Oper. Res."},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling salesman problems. Oper. Res. 6, 791\u2013812 (1958)","journal-title":"Oper. Res."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Jackson, J., Girard, A., Rasmussen, S.: A combined Tabu search and 2-opt heuristic for multiple vehicle routing. In: American Control Conference (2010)","DOI":"10.1109\/ACC.2010.5530677"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. In: Hybrid Evolutionary Systems. Studies in Computational Intelligence, vol. 75, pp. 81\u2013102 (2007)","DOI":"10.1007\/978-3-540-73297-6_4"},{"key":"6_CR21","first-page":"461","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., Moroto, C., Alcaraz, J.: Two newrobust genetic algorithms for the flowshop scheduling problem. Int. J. Manag. Sci. 34, 461\u2013476 (2006)","journal-title":"Int. J. Manag. Sci."},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1057\/jors.1965.8","volume":"16","author":"DS Palmer","year":"1965","unstructured":"Palmer, D.S.: Sequencing jobs through a multistage process in the minimum total time - a quick method of obtaining a near optimum. Oper. Res. Q. 16, 101\u2013107 (1965)","journal-title":"Oper. Res. Q."},{"key":"6_CR23","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"HG Campbell","year":"1970","unstructured":"Campbell, H.G., Dudek, R.A., Smith, M.L.: A heuristic algorithm for the n-job, m- machine sequencing problem. Manage. Sci. 16, B630\u2013B637 (1970)","journal-title":"Manage. Sci."},{"key":"6_CR24","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","volume":"09","author":"MB Daya","year":"1998","unstructured":"Daya, M.B., Al-Fawzan, M.: A Tabu search approach for the flow shop scheduling problem. Eur. J. Oper. Res. 09, 88\u201395 (1998)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59153-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T22:55:13Z","timestamp":1497826513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59153-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591520","9783319591537"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59153-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}