{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:43:40Z","timestamp":1760708620282},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,13]],"date-time":"2013-09-13T00:00:00Z","timestamp":1379030400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10489-013-0470-4","type":"journal-article","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T01:53:49Z","timestamp":1378950829000},"page":"404-414","source":"Crossref","is-referenced-by-count":13,"title":["An evolutionary-based hyper-heuristic approach for the Jawbreaker puzzle"],"prefix":"10.1007","volume":"40","author":[{"given":"S.","family":"Salcedo-Sanz","sequence":"first","affiliation":[]},{"given":"J. M.","family":"Mat\u00edas-Rom\u00e1n","sequence":"additional","affiliation":[]},{"given":"S.","family":"Jim\u00e9nez-Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"A.","family":"Portilla-Figueras","sequence":"additional","affiliation":[]},{"given":"L.","family":"Cuadra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,13]]},"reference":[{"key":"470_CR1","doi-asserted-by":"crossref","unstructured":"Hartmann D, van den Herik HJ, Iida H (eds) (2000) Games in AI research. ICGA J (special issue) 23(2)","DOI":"10.3233\/ICG-2000-23207"},{"issue":"7","key":"470_CR2","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/2.933506","volume":"34","author":"JE Laird","year":"2001","unstructured":"Laird JE (2001) Using a computer game to develop advanced AI. Computer 34(7):70\u201375","journal-title":"Computer"},{"issue":"4","key":"470_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MIS.2002.1024752","volume":"17","author":"A Khoo","year":"2002","unstructured":"Khoo A, Zubek R (2002) Applying inexpensive AI techniques to computer games. IEEE Intell Syst 17(4):48\u201353","journal-title":"IEEE Intell Syst"},{"issue":"1","key":"470_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/08993400903525099","volume":"20","author":"SA Wallace","year":"2010","unstructured":"Wallace SA, McCartney R, Russell I (2010) Games and machine learning: a powerful combination in an artificial intelligence course. Comput Sci Educ 20(1):17\u201336","journal-title":"Comput Sci Educ"},{"key":"470_CR5","doi-asserted-by":"crossref","DOI":"10.56021\/9780801869457","volume-title":"Adventures in group theory: Rubik\u2019s cube, Merlin\u2019s machine, and other mathematical toys","author":"D Joyner","year":"2002","unstructured":"Joyner D (2002) Adventures in group theory: Rubik\u2019s cube, Merlin\u2019s machine, and other mathematical toys. Johns Hopkins Press, Baltimore"},{"issue":"7","key":"470_CR6","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1016\/j.jsc.2008.04.013","volume":"44","author":"D Kunkle","year":"2009","unstructured":"Kunkle D, Cooperman G (2009) Harnessing parallel disks to solve Rubik\u2019s cube. J Symb Comput 44(7):872\u2013890","journal-title":"J Symb Comput"},{"issue":"6","key":"470_CR7","doi-asserted-by":"crossref","first-page":"3429","DOI":"10.1016\/j.aim.2012.09.010","volume":"231","author":"D Ryabogin","year":"2012","unstructured":"Ryabogin D (2012) On the continual Rubik\u2019s cube. Adv Math 231(6):3429\u20133444","journal-title":"Adv Math"},{"issue":"1","key":"470_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/ICG-2008-31103","volume":"31","author":"G Kendall","year":"2008","unstructured":"Kendall G, Parkes A, Spoerer K (2008) A survey of NP-complete puzzles. ICGA J 31(1):13\u201334","journal-title":"ICGA J"},{"key":"470_CR9","first-page":"1382","volume-title":"Proc of the IEEE congress on evolutionary computation","author":"T Mantere","year":"2007","unstructured":"Mantere T, Koljonen J (2007) Solving, rating and generating Sudoku puzzles with GA. In: Proc of the IEEE congress on evolutionary computation, pp 1382\u20131389"},{"key":"470_CR10","first-page":"1","volume-title":"Proc of the IEEE swarm intelligence symposium","author":"JM Hereford","year":"2008","unstructured":"Hereford JM, Gerlach H (2008) Integer-valued particle swarm optimization applied to Sudoku puzzles. In: Proc of the IEEE swarm intelligence symposium, pp 1\u20137"},{"issue":"6","key":"470_CR11","doi-asserted-by":"crossref","first-page":"1880","DOI":"10.1016\/j.cor.2008.06.004","volume":"36","author":"L Berghman","year":"2009","unstructured":"Berghman L, Goossens D, Leus R (2009) Efficient solutions for MasterMind using genetic algorithms. Comput Oper Res 36(6):1880\u20131885","journal-title":"Comput Oper Res"},{"issue":"2","key":"470_CR12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.asoc.2004.09.003","volume":"6","author":"JJ Merelo-Guerv\u00f3s","year":"2006","unstructured":"Merelo-Guerv\u00f3s JJ, Castillo P, Rivas V (2006) Finding a needle in a haystack using hints and evolutionary computation: the case of evolutionary MasterMind. Appl Soft Comput 6(2):170\u2013179","journal-title":"Appl Soft Comput"},{"issue":"2","key":"470_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/ICG-2000-23202","volume":"23","author":"KH Chen","year":"2000","unstructured":"Chen KH (2000) Some practical techniques for global search in go. ICGA J 23(2):67\u201374","journal-title":"ICGA J"},{"issue":"4","key":"470_CR14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3233\/ICG-2009-32404","volume":"32","author":"P Drake","year":"2009","unstructured":"Drake P (2009) The last-good-reply policy for Monte-Carlo go. ICGA J 32(4):221\u2013227","journal-title":"ICGA J"},{"issue":"3","key":"470_CR15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10489-011-0335-7","volume":"37","author":"JT Tsai","year":"2012","unstructured":"Tsai JT (2012) Solving Japanese nonograms by Taguchi-based genetic algorithm. Appl Intell 37(3):405\u2013419","journal-title":"Appl Intell"},{"issue":"8","key":"470_CR16","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.patcog.2008.12.003","volume":"42","author":"KJ Batenburg","year":"2009","unstructured":"Batenburg KJ, Kosters WA (2009) Solving nonograms by combining relaxations. Pattern Recognit 42(8):1672\u20131683","journal-title":"Pattern Recognit"},{"issue":"10","key":"470_CR17","doi-asserted-by":"crossref","first-page":"2935","DOI":"10.1016\/j.cor.2005.01.018","volume":"33","author":"C Jefferson","year":"2006","unstructured":"Jefferson C, Miguel A, Miguel I, Armagan-Tarim S (2006) Modelling and solving English peg solitaire. Comput Oper Res 33(10):2935\u20132959","journal-title":"Comput Oper Res"},{"key":"470_CR18","first-page":"367","volume-title":"Proc of the world congress on engineering and computer science","author":"F Gindre","year":"2010","unstructured":"Gindre F, Trejo Pizzo DA, Barrera G, Lopez De Luise MD (2010) A criterion-based genetic algorithm solution to the Jigsaw puzzle NP-complete problem. In: Proc of the world congress on engineering and computer science, pp 367\u2013372"},{"issue":"6","key":"470_CR19","doi-asserted-by":"crossref","first-page":"1999","DOI":"10.1016\/j.cor.2006.10.004","volume":"35","author":"NJ Eck van","year":"2008","unstructured":"van Eck NJ, van Wezel M (2008) Application of reinforcement learning to the game of Othello. Comput Oper Res 35(6):1999\u20132017","journal-title":"Comput Oper Res"},{"issue":"1","key":"470_CR20","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MCI.2006.1597057","volume":"1","author":"SS Lucas","year":"2006","unstructured":"Lucas SS, Kendall G (2006) Evolutionary computation and games. IEEE Comput Intell Mag 1(1):10\u201318","journal-title":"IEEE Comput Intell Mag"},{"issue":"2","key":"470_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TE.2007.893170","volume":"50","author":"S Salcedo-Sanz","year":"2007","unstructured":"Salcedo-Sanz S, Portilla-Figueras J, Bellido AP, Ortiz-Garc\u00eda E, Yao X (2007) Teaching advanced features of evolutionary algorithms using Japanese puzzles. IEEE Trans Ed 50(2):151\u2013155","journal-title":"IEEE Trans Ed"},{"issue":"2","key":"470_CR22","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1109\/TE.2011.2158214","volume":"55","author":"JT Tsai","year":"2012","unstructured":"Tsai JT, Chou PY, Fang JC (2012) Learning intelligent genetic algorithms using Japanese nonograms. IEEE Trans Ed 55(2):164\u2013168","journal-title":"IEEE Trans Ed"},{"key":"470_CR23","unstructured":"Pocket PC Jawbreaker Game, The ultimate guide to PDA games. http:\/\/www.pdagameguide.com\/jawbreaker-game.html"},{"key":"470_CR24","first-page":"24","volume-title":"Proc of the 6th international conference on computers and games","author":"MP Schadd","year":"2008","unstructured":"Schadd MP, Winands MH, van den Herik HJ, Chaslot GM, Uiterwijk JW (2008) Single-player Monte-Carlo tree search. In: Proc of the 6th international conference on computers and games, pp\u00a024\u201326"},{"key":"470_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.knosys.2011.08.008","volume":"34","author":"MP Schadd","year":"2012","unstructured":"Schadd MP, Winands MH, van den Herik HJ, Chaslot GM, Uiterwijk JW (2012) Single-player Monte-Carlo tree search for SameGame. Knowl-Based Syst 34:3\u201311","journal-title":"Knowl-Based Syst"},{"key":"470_CR26","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of metaheuristics","author":"EK Burke","year":"2003","unstructured":"Burke EK, Hart E, Kendall G, Newall J, Ross P, Schulenburg S (2003) Hyper-heuristics: an emerging direction in modern search technology. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic, Norwell, pp 457\u2013474"},{"key":"470_CR27","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, Ozcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc., in press","DOI":"10.1057\/jors.2013.71"},{"key":"470_CR28","first-page":"1185","volume-title":"Proceedings of congress on evolutionary computation (CEC2002)","author":"L Han","year":"2002","unstructured":"Han L, Cowling PI, Kendall G (2002) An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of congress on evolutionary computation (CEC2002), pp 1185\u20131190"},{"key":"470_CR29","doi-asserted-by":"crossref","unstructured":"Sabar NR, Ayob M, Qu R, Kendall G (2011) A graph coloring constructive hyper-heuristic for examination timetabling problems. Applied Intelligence","DOI":"10.1007\/s10489-011-0309-9"},{"key":"470_CR30","doi-asserted-by":"crossref","unstructured":"Soghier A, Qu R (2013) Adaptive selection of heuristics for assigning time slots and rooms in exam timetables. Applied Intelligence, in press","DOI":"10.1007\/s10489-013-0422-z"},{"key":"470_CR31","doi-asserted-by":"crossref","unstructured":"Abuhamdah A, Ayob M, Kendall G, Sabar NR (2013) Population based local search for university course timetabling problems. Appl. Intell. (in press)","DOI":"10.1007\/s10489-013-0444-6"},{"key":"470_CR32","series-title":"LNCS","volume-title":"Proc of the 9th international conference on simulated evolution and learning (SEAL12)","author":"R Hunt","year":"2012","unstructured":"Hunt R, Neshatian K, Zhang M (2012) A genetic programming approach to hyper-heuristic feature selection. In: Proc of the 9th international conference on simulated evolution and learning (SEAL12). LNCS, vol 7673. Hanoi, Vietnam"},{"key":"470_CR33","series-title":"LNCS","volume-title":"Proc of the 9th international conference on simulated evolution and learning (SEAL12)","author":"K Shafi","year":"2012","unstructured":"Shafi K, Bender A, Abbass HA (2012) Multi-objective learning classifier systems based hyperheuristics for modularised fleet mix problem. In: Proc of the 9th international conference on simulated evolution and learning (SEAL12). LNCS, vol 7673\/2012. Hanoi, Vietnam"},{"key":"470_CR34","volume-title":"Proc of the 2nd international conference on metaheuristics and nature inspired computing (META10)","author":"T Wauters","year":"2010","unstructured":"Wauters T, Vancrooenburg W, Vanden Berghe G (2010) A two phase hyper-heuristic approach for solving the Eternity II puzzle. In: Proc of the 2nd international conference on metaheuristics and nature inspired computing (META10), Djerba Island, Tunisia"},{"key":"470_CR35","doi-asserted-by":"crossref","unstructured":"Wauters T, Vancrooenburg W, Vanden Berghe G (2012) A guide-and-observe hyper-heuristic approach to the Eternity II puzzle. Journal of Mathematical Modelling and Algorithms 11(3)","DOI":"10.1007\/s10852-012-9178-4"},{"issue":"6","key":"470_CR36","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"EK Burke","year":"2003","unstructured":"Burke EK, Kendall G, Soubeiga E (2003) A tabu-search hyper-heuristic for timetabling and rostering. J Heuristics 9(6):451\u2013470","journal-title":"J Heuristics"},{"key":"470_CR37","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A\u00a0graph-based hyperheuristic for educational timetabling problems. Eur J Oper Res 176:177\u2013192","journal-title":"Eur J Oper Res"},{"key":"470_CR38","first-page":"127","volume-title":"Proc of the 4th metaheuristic international conference","author":"P Cowling","year":"2001","unstructured":"Cowling P, Kendall G, Soubeiga E (2001) A parameter-free hyperheuristic for scheduling a sales summit. In: Proc of the 4th metaheuristic international conference, pp 127\u2013131"},{"key":"470_CR39","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-46004-7_1","volume-title":"Proc of EvoWorkshops 2002","author":"P Cowling","year":"2002","unstructured":"Cowling P, Kendall G, Soubeiga E (2002) Hyperheuristics: a tool for rapid prototyping in scheduling and optimisation. In: Proc of EvoWorkshops 2002. Lecture notes in computer science, vol 2279, pp 1\u201310"},{"issue":"6","key":"470_CR40","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TEVC.2010.2041061","volume":"14","author":"EK Burke","year":"2010","unstructured":"Burke EK, Hyde MR, Kendall G, Woodward J (2010) A genetic programming hyperheuristic approach for evolving two dimensional strip packing heuristics. IEEE Trans Evol Comput 14(6):942\u2013958","journal-title":"IEEE Trans Evol Comput"},{"key":"470_CR41","first-page":"2530","volume-title":"Proc of the IEEE congress on evolutionary computation","author":"EK Burke","year":"2007","unstructured":"Burke EK, Hyde MR, Kendall G, Woodward J (2007) The scalability of evolved on line bin packing heuristics. In: Proc of the IEEE congress on evolutionary computation, pp 2530\u20132537"},{"issue":"1","key":"470_CR42","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.1070.0219","volume":"20","author":"R Bai","year":"2008","unstructured":"Bai R, Kendall G (2008) A model for fresh produce shelf-space allocation and inventory management with freshness-condition-dependent demand. INFORMS J Comput 20(1):78\u201385","journal-title":"INFORMS J Comput"},{"key":"470_CR43","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1057\/palgrave.jors.2602463","volume":"59","author":"R Bai","year":"2008","unstructured":"Bai R, Burke EK, Kendall G (2008) Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation. J Oper Res Soc 59:1387\u20131397","journal-title":"J Oper Res Soc"},{"issue":"3","key":"470_CR44","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1057\/jors.2011.48","volume":"63","author":"S Remde","year":"2011","unstructured":"Remde S, Cowling P, Dahal K, Colledge N, Selensky E (2011) An empirical study of hyperheuristics for managing very large sets of low level heuristics. J Oper Res Soc 63(3):392\u2013405","journal-title":"J Oper Res Soc"},{"key":"470_CR45","first-page":"769","volume-title":"Proc of the IEEE international conference on network","author":"G Kendall","year":"2004","unstructured":"Kendall G, Mohamad M (2004) Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Proc of the IEEE international conference on network, pp 769\u2013773"},{"key":"470_CR46","first-page":"790","volume-title":"Proc of the IEEE conference on cybernetic and intelligent systems","author":"G Kendall","year":"2004","unstructured":"Kendall G, Mohamad M (2004) Channel assignment optimisation using a hyper-heuristic. In: Proc of the IEEE conference on cybernetic and intelligent systems, pp 790\u2013795"},{"issue":"2","key":"470_CR47","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.knosys.2010.10.004","volume":"24","author":"J Li","year":"2011","unstructured":"Li J, Burke EK, Qu R (2011) Integrating neural networks and logistic regression to underpin hyper-heuristic search. Knowl-Based Syst 24(2):322\u2013330","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"470_CR48","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.asoc.2011.09.001","volume":"12","author":"R Furtuna","year":"2012","unstructured":"Furtuna R, Curteanu S, Leon F (2012) Multi-objective optimization of a stacked neural network using an evolutionary hyper-heuristic. Appl Soft Comput 12(1):133\u2013144","journal-title":"Appl Soft Comput"},{"key":"470_CR49","series-title":"International series in operations research and management science","volume-title":"Handbook of metaheuristics","author":"EK Burke","year":"2009","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, Ozcan E, Woodward J (2009) A classification of hyper-heuristics approaches. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics. International series in operations research and management science. Springer, Berlin"},{"issue":"1","key":"470_CR50","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E Ozcan","year":"2008","unstructured":"Ozcan E, Bilgin B, Korkmaz EE (2008) A comprehensive analysis of hyper-heuristics. Intell Data Anal 12(1):3\u201323","journal-title":"Intell Data Anal"},{"key":"470_CR51","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Hyper-heuristics, search methodologies: introductory tutorials in optimization and decision support techniques","author":"P Ross","year":"2005","unstructured":"Ross P (2005) In: Burke EK, Kendall G (eds) Hyper-heuristics, search methodologies: introductory tutorials in optimization and decision support techniques. Springer, Berlin, pp 529\u2013556"},{"key":"470_CR52","unstructured":"http:\/\/allserv.kahosl.be\/~mustafa.misir\/hh.html"},{"key":"470_CR53","unstructured":"http:\/\/www.hyper-heuristic.org"},{"key":"470_CR54","series-title":"Natural computing series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to evolutionary computing","author":"AE Eiben","year":"2003","unstructured":"Eiben AE, Smith JE (2003) Introduction to evolutionary computing, 1st edn. Natural computing series. Springer, Berlin","edition":"1"},{"key":"470_CR55","unstructured":"http:\/\/www.js-games.de\/eng\/games\/samegame"},{"key":"470_CR56","volume-title":"Personal communication","author":"D Billings","year":"2007","unstructured":"Billings D (2007) Personal communication. University of Alberta, Canada"},{"key":"470_CR57","first-page":"249","volume-title":"Proc of the 21st Benelux conference on artificial intelligence","author":"FW Takes","year":"2009","unstructured":"Takes FW, Kosters WA (2009) Solving SameGame and its chessboard variants. In: Proc of the 21st Benelux conference on artificial intelligence, Eindhoven, The Netherlands, pp 249\u2013256"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0470-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-013-0470-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0470-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T14:27:40Z","timestamp":1688480860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-013-0470-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,13]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["470"],"URL":"https:\/\/doi.org\/10.1007\/s10489-013-0470-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,13]]}}}