{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:24:17Z","timestamp":1743078257856,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078564"},{"type":"electronic","value":"9783319078571"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07857-1_88","type":"book-chapter","created":{"date-parts":[[2014,5,19]],"date-time":"2014-05-19T05:35:47Z","timestamp":1400477747000},"page":"503-508","source":"Crossref","is-referenced-by-count":0,"title":["Self-adaptive Systems: Facilitating the Use of Combinatorial Problem Solvers"],"prefix":"10.1007","author":[{"given":"Broderick","family":"Crawford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franklin","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"88_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-79305-2_4","volume-title":"Artificial Evolution","author":"M. Bader-El-Den","year":"2008","unstructured":"Bader-El-Den, M., Poli, R.: Generating SAT local-search heuristics using a GP hyper-heuristic framework. In: Monmarch\u00e9, N., Talbi, E.-G., Collet, P., Schoenauer, M., Lutton, E. (eds.) EA 2007. LNCS, vol.\u00a04926, pp. 37\u201349. Springer, Heidelberg (2008)"},{"key":"88_CR2","doi-asserted-by":"crossref","unstructured":"Battiti, R., Brunato, M.: Reactive Search Optimization: Learning while Optimizing. In: Handbook of Metaheuristics, 2nd edn., Springer (2010)","DOI":"10.1007\/978-1-4419-1665-5_18"},{"key":"88_CR3","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) ECAI, pp. 146\u2013150. IOS Press (2004)"},{"key":"88_CR4","first-page":"77","volume":"1","author":"J.A. Boyan","year":"2000","unstructured":"Boyan, J.A., Moore, A.W.: Learning evaluation functions to improve optimization by local search. Journal of Machine Learning Research\u00a01, 77\u2013112 (2000)","journal-title":"Journal of Machine Learning Research"},{"key":"88_CR5","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: A survey of hyper-heuristics. Technical Report NOTTCS-TR-SUB-0906241418-2747, School of Computer Science and Information Technology, University of Nottingham, Computer Science (2009)"},{"key":"88_CR6","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Kendall, G., Hart, E., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: An Emerging Direction inModern Search Technology. In: Handbook of Meta-heuristics, pp. 457\u2013474. Kluwer (2003)","DOI":"10.1007\/0-306-48056-5_16"},{"key":"88_CR7","unstructured":"Cowling, P., Soubeiga, E.: Neighborhood structures for personnel scheduling: A summit meeting scheduling problem (abstract). In: Burke, E., Erben, W. (eds.) Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling (2000)"},{"key":"88_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46004-7_1","volume-title":"Applications of Evolutionary Computing","author":"P.I. Cowling","year":"2002","unstructured":"Cowling, P.I., Kendall, G., Soubeiga, E.: Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoWorkshops 2002. LNCS, vol.\u00a02279, pp. 1\u201310. Springer, Heidelberg (2002)"},{"key":"88_CR9","series-title":"AISC","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-31519-0_11","volume-title":"EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation II","author":"B. Crawford","year":"2012","unstructured":"Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: A hyperheuristic approach for guiding enumeration in constraint solving. In: Sch\u00fctze, O., Coello Coello, C.A., Tantar, A.-A., Tantar, E., Bouvry, P., Del Moral, P., Legrand, P. (eds.) EVOLVE - A Bridge Between Probability. AISC, vol.\u00a0175, pp. 171\u2013188. Springer, Heidelberg (2012)"},{"issue":"5","key":"88_CR10","doi-asserted-by":"publisher","first-page":"1690","DOI":"10.1016\/j.eswa.2012.09.013","volume":"40","author":"B. Crawford","year":"2013","unstructured":"Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-function based hyperheuristic using particle swarm optimization. Expert Systems with Applications\u00a040(5), 1690\u20131695 (2013)","journal-title":"Expert Systems with Applications"},{"key":"88_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.asoc.2013.12.006","volume":"16","author":"N. Dahmani","year":"2014","unstructured":"Dahmani, N., Clautiaux, F., Krichen, S., Talbi, E.-G.: Self-adaptive metaheuristics for solving a multi-objective 2-dimensional vector packing problem. Applied Soft Computing\u00a016, 124\u2013136 (2014)","journal-title":"Applied Soft Computing"},{"key":"88_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible sat-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"2","key":"88_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"A.E. Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evolutionary Computation\u00a03(2), 124\u2013141 (1999)","journal-title":"IEEE Trans. Evolutionary Computation"},{"issue":"4","key":"88_CR14","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1111\/j.1467-8640.2005.00277.x","volume":"21","author":"S.L. Epstein","year":"2005","unstructured":"Epstein, S.L., Freuder, E.C., Wallace, R.J.: Learning to support constraint programmers. Computational Intelligence\u00a021(4), 336\u2013371 (2005)","journal-title":"Computational Intelligence"},{"key":"88_CR15","doi-asserted-by":"crossref","unstructured":"Fialho, \u00c1., Costa, L.D., Schoenauer, M., Sebag, M.: Extreme value based adaptive operator selection. In: Rudolph, et al. (eds.) [15], pp. 175\u2013184","DOI":"10.1007\/978-3-540-87700-4_18"},{"issue":"1","key":"88_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1162\/evco.2008.16.1.31","volume":"16","author":"A.S. Fukunaga","year":"2008","unstructured":"Fukunaga, A.S.: Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation\u00a016(1), 31\u201361 (2008)","journal-title":"Evolutionary Computation"},{"issue":"1-2","key":"88_CR17","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10601-007-9027-7","volume":"13","author":"F. Goualard","year":"2008","unstructured":"Goualard, F., Jermann, C.: A reinforcement learning approach to interval constraint propagation. Constraints\u00a013(1-2), 206\u2013226 (2008)","journal-title":"Constraints"},{"key":"88_CR18","unstructured":"Hamadi, Y., Monfroy, E., Saubion, F.: What is autonomous search? Technical Report MSR-TR-2008-80, Microsoft Research (2008)"},{"key":"88_CR19","doi-asserted-by":"crossref","unstructured":"Hansen, N.: Adaptive encoding: How to render search coordinate system invariant. In: Rudolph, et al. (eds.), pp. 205\u2013214","DOI":"10.1007\/978-3-540-87700-4_21"},{"key":"88_CR20","unstructured":"Hu, B., Raidl, G.: Variable neighborhood descent with self-adaptive noeighborhood-ordering. In: Proceedings of the 7th EU\/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics (2006)"},{"key":"88_CR21","unstructured":"Hutter, F., Hamadi, Y.: Parameter adjustment based on performance prediction: Towards an instance-aware problem solver. Technical Report MSR-TR-2005-125, Microsoft Research, Cambridge, UK (December 2005)"},{"key":"88_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11889205_17","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"F. Hutter","year":"2006","unstructured":"Hutter, F., Hamadi, Y., Hoos, H.H., Leyton-Brown, K.: Performance prediction and automated tuning of randomized and parametric algorithms. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 213\u2013228. Springer, Heidelberg (2006)"},{"key":"88_CR23","unstructured":"Hutter, F., Hoos, H.H., St\u00fctzle, T.: Automatic algorithm configuration based on local search. In: AAAI, pp. 1152\u20131157. AAAI Press (2007)"},{"key":"88_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-11169-3_9","volume-title":"Learning and Intelligent Optimization","author":"M. Khichane","year":"2009","unstructured":"Khichane, M., Albert, P., Solnon, C.: An ACO-based reactive framework for ant colony optimization: First experiments on constraint satisfaction problems. In: St\u00fctzle, T. (ed.) LION 3. LNCS, vol.\u00a05851, pp. 119\u2013133. Springer, Heidelberg (2009)"},{"key":"88_CR25","doi-asserted-by":"crossref","unstructured":"Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.): Parameter Setting in Evolutionary Algorithms. SCI, vol.\u00a054. Springer (2007)","DOI":"10.1007\/978-3-540-69432-8"},{"key":"88_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","year":"2007","unstructured":"Marques-Silva, J., Sakallah, K.A. (eds.): SAT 2007. LNCS, vol.\u00a04501. Springer, Heidelberg (2007)"},{"key":"88_CR27","doi-asserted-by":"crossref","unstructured":"Maturana, J., Saubion, F.: A compass to guide genetic algorithms. In: Rudolph, et al. (eds.), pp. 256\u2013265","DOI":"10.1007\/978-3-540-87700-4_26"},{"issue":"3-4","key":"88_CR28","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018999721141","volume":"22","author":"B. Mazure","year":"1998","unstructured":"Mazure, B., Sais, L., Gr\u00e9goire, \u00c9.: Boosting complete techniques thanks to local search methods. Ann. Math. Artif. Intell.\u00a022(3-4), 319\u2013331 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"11","key":"88_CR29","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & OR\u00a024(11), 1097\u20131100 (1997)","journal-title":"Computers & OR"},{"issue":"1","key":"88_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/0952813X.2012.656328","volume":"25","author":"E. Monfroy","year":"2013","unstructured":"Monfroy, E., Castro, C., Crawford, B., Soto, R., Paredes, F., Figueroa, C.: A reactive and hybrid constraint solver. Journal of Experimental and Theoretical Artificial Intelligence\u00a025(1), 1\u201322 (2013)","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"88_CR31","unstructured":"Morris, P.: The breakout method for escaping from local minima. In: AAAI, pp. 40\u201345 (1993)"},{"key":"88_CR32","doi-asserted-by":"crossref","unstructured":"Nannen, V., Smit, S.K., E. Eiben, \u00c1.: Costs and benefits of tuning parameters of evolutionary algorithms. In: Rudolph, et al. (eds.), pp. 528\u2013538","DOI":"10.1007\/978-3-540-87700-4_53"},{"issue":"5","key":"88_CR33","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10732-007-9048-9","volume":"14","author":"J. Puchinger","year":"2008","unstructured":"Puchinger, J., Raidl, G.R.: Bringing order into the neighborhoods: Relaxation guided variable neighborhood search. J. Heuristics\u00a014(5), 457\u2013472 (2008)","journal-title":"J. Heuristics"},{"key":"88_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-28646-2_37","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"M. Randall","year":"2004","unstructured":"Randall, M.: Near parameter free ant colony optimisation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 374\u2013381. Springer, Heidelberg (2004)"},{"key":"88_CR35","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","year":"2008","unstructured":"Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.): PPSN 2008. LNCS, vol.\u00a05199. Springer, Heidelberg (2008)"},{"key":"88_CR36","doi-asserted-by":"crossref","unstructured":"Smit, S.K., Eiben, A.E.: Comparing parameter tuning methods for evolutionary algorithms. In: IEEE Congress on Evolutionary Computation, pp. 399\u2013406 (2009)","DOI":"10.1109\/CEC.2009.4982974"},{"key":"88_CR37","doi-asserted-by":"crossref","unstructured":"Thierens, D.: An adaptive pursuit strategy for allocating operator probabilities. In: Verbeeck, K., Tuyls, K., Now\u00e9, A., Manderick, B., Kuijpers, B. (eds.) BNAIC, pp. 385\u2013386. Koninklijke Vlaamse Academie van Belie voor Wetenschappen en Kunsten (2005)","DOI":"10.1145\/1068009.1068251"},{"key":"88_CR38","unstructured":"Thornton, J.: Constraint Weighting Local Search for Constraint Satisfaction. PhD thesis, Griffith University. Australia (2000)"},{"key":"88_CR39","doi-asserted-by":"crossref","unstructured":"Whitacre, J.M., Pham, Q.T., Sarker, R.A.: Credit assignment in adaptive evolutionary algorithms. In: GECCO, pp. 1353\u20131360. ACM (2006)","DOI":"10.1145\/1143997.1144206"},{"issue":"8","key":"88_CR40","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/s00500-002-0235-1","volume":"7","author":"Y.-Y. Wong","year":"2003","unstructured":"Wong, Y.-Y., Lee, K.-H., Leung, K.-S., Ho, C.-W.: A novel approach in parameter adaptation and diversity maintenance for genetic algorithms. Soft Comput.\u00a07(8), 506\u2013515 (2003)","journal-title":"Soft Comput."},{"key":"88_CR41","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for sat. J. Artif. Intell. Res (JAIR)\u00a032, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res (JAIR)"}],"container-title":["Communications in Computer and Information Science","HCI International 2014 - Posters\u2019 Extended Abstracts"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07857-1_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T15:15:48Z","timestamp":1583507748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07857-1_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078564","9783319078571"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07857-1_88","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}