{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T19:10:10Z","timestamp":1748545810196,"version":"3.41.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319221823"},{"type":"electronic","value":"9783319221830"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22183-0_9","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T11:55:37Z","timestamp":1437998137000},"page":"125-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Haiku - a Scala Combinator Toolkit for Semi-automated Composition of Metaheuristics"],"prefix":"10.1007","author":[{"given":"Zoltan A.","family":"Kocsis","sequence":"first","affiliation":[]},{"given":"Alexander E. I.","family":"Brownlee","sequence":"additional","affiliation":[]},{"given":"Jerry","family":"Swan","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Senington","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"9_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics). Princeton University Press, Princeton (2007)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"HG Beyer","year":"2002","unstructured":"Beyer, H.G., Schwefel, H.P.: Evolution strategies - a comprehensive introduction. Nat. Comput. 1(1), 3\u201352 (2002)","journal-title":"Nat. Comput."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., Gendreau, M., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64, 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"9_CR4","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for examination timetabling problems. In: Proceedings PATAT (2008)"},{"key":"9_CR5","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-01799-5_6","volume-title":"Computational Intelligence","author":"EK Burke","year":"2009","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Ozcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence. ISRL, vol. 1, pp. 177\u2013201. Springer, Heidelberg (2009)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","volume":"194","author":"H Cambazard","year":"2012","unstructured":"Cambazard, H., Hebrard, E., O\u015aullivan, B., Papadopoulos, A.: Local search and constraint programming for the post enrolment-based course timetabling problem. Ann. Oper. Res. 194, 111\u2013135 (2012)","journal-title":"Ann. Oper. Res."},{"key":"9_CR7","unstructured":"Choi, C.W., Henz, M., Ng, K.B.: A compositional framework for search. In: Pontelli, E. (ed.) Proceeding CICLOPS: Colloquium on Implementation of Constraint and LOgic Programming Systems, appeared as Technical report TR-CS-003\/2001, New Mexico State University. Paphos, November 2001"},{"key":"9_CR8","unstructured":"Desouter, B.: Modular search heuristics in Scala. Master\u2019s thesis, Ghent University, Belgium (2012). http:\/\/bdsouter.github.io\/thesis\/thesis.pdf"},{"issue":"8","key":"9_CR9","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L Gaspero","year":"2003","unstructured":"Gaspero, L., Schaerf, A.: Easylocal++: an object-oriented framework for the flexible design of local-search algorithms. Softw. Pract. Exp. 33(8), 733\u2013765 (2003)","journal-title":"Softw. Pract. Exp."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104, 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo, J.J., Nebro, A.J.: jMetal: a Java framework for multi-objective optimization. Adv. Eng. Softw. 42, 760\u2013771 (2011)","journal-title":"Adv. Eng. Softw."},{"key":"9_CR12","first-page":"81","volume-title":"Optimization Software Class Libraries","author":"A Fink","year":"2002","unstructured":"Fink, A., Vo\u00df, S.: Hotframe: a heuristic optimization framework. In: Vo\u00df, S., Woodruff, D. (eds.) Optimization Software Class Libraries, pp. 81\u2013154. OR\/CS Interfaces Series, Kluwer Academic, Boston (2002)"},{"key":"9_CR13","volume-title":"Design Patterns: Elements of Reusable Object-Oriented Software","author":"E Gamma","year":"1995","unstructured":"Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)"},{"key":"9_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Norwell (1997)"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1017\/S0956796898003050","volume":"8","author":"G Hutton","year":"1998","unstructured":"Hutton, G., Meijer, E.: Monadic parsing in haskell. J. Funct. Program. 8(4), 437\u2013444 (1998)","journal-title":"J. Funct. Program."},{"issue":"4598","key":"9_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Sci. 220(4598), 671\u2013680 (1983)","journal-title":"Sci."},{"key":"9_CR17","unstructured":"Leijen, D., Meijer, E.: Parsec: direct style monadic parser combinators for the real world. Technical reports UU-CS-2001-27, Dep. of Comp. Sc., Univ. Utrecht (2001)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Liu, S., Bryant, B., Mernik, M., \u010crepin\u0161ek, M., Zubair, M.: PPCea: A Domain-Specific Language for Programmable Parameter Control in Evolutionary Algorithms. INTECH Open Access (2011)","DOI":"10.5772\/16189"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T., Birattari, M.: The irace package, Iterated Race for Automatic Algorithm Configuration. Technical report TR\/IRIDIA\/2011-004, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium (2011)","DOI":"10.32614\/CRAN.package.irace"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Lukasiewycz, M., Gla\u00df, M., Reimann, F., Teich, J.: Opt4J - A Modular Framework for Meta-heuristic Optimization. In: Proceedings of the GECCO, pp. 1723\u20131730. Dublin (2011)","DOI":"10.1145\/2001576.2001808"},{"key":"9_CR21","unstructured":"Luke, S.: The ECJ Owner\u2019s Manual (Oct 2010)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-38516-2_12","volume-title":"Hybrid Metaheuristics","author":"M-E Marmion","year":"2013","unstructured":"Marmion, M.-E., Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatic design of hybrid stochastic local search algorithms. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds.) HM 2013. LNCS, vol. 7919, pp. 144\u2013158. Springer, Heidelberg (2013)"},{"key":"9_CR23","unstructured":"Marmion, M.\u00c9., Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Towards the automatic design of metaheuristics. In: Lau, H.C., Raidl, G., Hentenryck, P.V. (eds.) MIC 2013, Singapore, Aug 2013"},{"key":"9_CR24","unstructured":"McGillicuddy, D., Parkes, A.J., Nilsson, H.: An investigation into the use of Haskell for dynamic programming. Proceedings of the PATAT (2014)"},{"issue":"4","key":"9_CR25","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/1118890.1118892","volume":"37","author":"M Mernik","year":"2005","unstructured":"Mernik, M., Heering, J., Sloane, A.M.: When and how to develop domain-specific languages. ACM Comput. Surv. 37(4), 316\u2013344 (2005)","journal-title":"ACM Comput. Surv."},{"key":"9_CR26","unstructured":"Moscato, P.: Memetic algorithms: a short introduction. In: New Ideas in Optimization, pp. 219\u2013234. McGraw-Hill Ltd., Maidenhead (1999)"},{"issue":"6","key":"9_CR27","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TEVC.2011.2180533","volume":"16","author":"TT Nguyen","year":"2012","unstructured":"Nguyen, T.T., Yao, X.: Continuous dynamic constrained optimization: the challenges. IEEE T Evol. Comput. 16(6), 769\u2013786 (2012)","journal-title":"IEEE T Evol. Comput."},{"key":"9_CR28","volume-title":"Real World Haskell","author":"B O\u2019Sullivan","year":"2008","unstructured":"O\u2019Sullivan, B., Goerzen, J., Stewart, D.: Real World Haskell. O\u2019Reilly, North Sebastopol (2008)"},{"issue":"1","key":"9_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3\u201323 (2008)","journal-title":"Intell. Data Anal."},{"key":"9_CR30","first-page":"346","volume-title":"Principles and Practice of Constraint Programming","author":"L Perron","year":"1999","unstructured":"Perron, L.: Search procedures and parallelism in constraint programming. In: Jaffar, J. (ed.) Principles and Practice of Constraint Programming. LNCS, vol. 1713, pp. 346\u2013360. Springer, Berlin Heidelberg (1999)"},{"key":"9_CR31","unstructured":"Reinelt, G.: TSPLIB - A T.S.P. library. Technical reports 250, Universit\u00e4t Augsburg, Institut f\u00fcr Mathematik, Augsburg (1990)"},{"key":"9_CR32","unstructured":"Samulowitz, H., Sabharwal, A., Schrijvers, T., Tack, G., Stuckey, P.: Automated design of search with composability (2013), 27th AAAI Conference on Artificial Intelligence"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1017\/S0956796809990086","volume":"19","author":"T Schrijvers","year":"2009","unstructured":"Schrijvers, T., Stuckey, P., Wadler, P.: Monadic constraint programming. J. Funct. Program. 19, 663\u2013697 (2009)","journal-title":"J. Funct. Program."},{"issue":"2","key":"9_CR34","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10601-012-9137-8","volume":"18","author":"T Schrijvers","year":"2013","unstructured":"Schrijvers, T., Tack, G., Wuille, P., Samulowitz, H., Stuckey, P.: Search combinators. Constraints 18(2), 269\u2013305 (2013)","journal-title":"Constraints"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-41582-1_14","volume-title":"Implementation and Application of Functional Languages","author":"R Senington","year":"2013","unstructured":"Senington, R., Duke, D.: Decomposing metaheuristic operations. In: Hinze, R. (ed.) IFL 2012. LNCS, vol. 8241, pp. 224\u2013239. Springer, Heidelberg (2013)"},{"key":"9_CR36","unstructured":"Senington, R.J.: Hybrid meta-heuristic frameworks: a functional approach. Ph.D. thesis, University of Leeds (2013)"},{"issue":"1","key":"9_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ejor.2014.03.046","volume":"238","author":"JA Soria-Alcaraz","year":"2014","unstructured":"Soria-Alcaraz, J.A., Ochoa, G., Swan, J., Carpio, M., Puga, H., Burke, E.K.: Effective learning hyper-heuristics for the course timetabling problem. Euro. J. Oper. Res. 238(1), 77\u201386 (2014)","journal-title":"Euro. J. Oper. Res."},{"key":"9_CR38","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ins.2014.03.105","volume":"279","author":"K Tang","year":"2014","unstructured":"Tang, K., Peng, F., Chen, G., Yao, X.: Population-based algorithm portfolios with automated constituent algorithms selection. Inform. Sci. 279, 94\u2013104 (2014)","journal-title":"Inform. Sci."},{"key":"9_CR39","volume-title":"Constraint-Based Local Search","author":"P Van Hentenryck","year":"2005","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press, Cambridge (2005)"},{"issue":"4","key":"9_CR40","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10601-006-9005-5","volume":"11","author":"P Van Hentenryck","year":"2006","unstructured":"Van Hentenryck, P., Michel, L.: Nondeterministic control for hybrid search. Constraints 11(4), 353\u2013373 (2006)","journal-title":"Constraints"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Wagner, S., Kronberger, G.: Algorithm and experiment design with heuristic lab: an open source optimization environment for research and education. In: Proceeding GECCO Companion, pp. 1287\u20131316. ACM, New York (2012)","DOI":"10.1145\/2330784.2330941"},{"key":"9_CR42","unstructured":"Wan, Z.: Functional Reactive Programming for Real-Time Reactive Systems. Ph.D. thesis, Department of Computer Science, Yale University, December 2002"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Woodward, J., Swan, J., Martin, S.: The \u2018Composite\u2019 design pattern in metaheuristics. In: Proceedings of the GECCO Companion pp. 1439\u20131444. ACM, New York (2014)","DOI":"10.1145\/2598394.2609848"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Woodward, J.R., Swan, J.: Template method hyper-heuristics. In: Proceedings of the GECCO Companion, pp. 1437\u20131438. ACM (2014)","DOI":"10.1145\/2598394.2609843"}],"container-title":["Lecture Notes in Computer Science","Search-Based Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22183-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T18:55:08Z","timestamp":1748544908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22183-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319221823","9783319221830"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22183-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}