Hyper-heuristics: A survey of the state of the art

Journal of the Operational Research Society

Volumn 64, Issue 12, 2013, Pages 1695-1724

  Burke, Edmund K ^a   Gendreau, Michel ^b   Hyde, Matthew ^c   Kendall, Graham ^d   Ochoa, Gabriela ^a   Özcan, Ender ^d   Qu, Rong ^d  

^a UNIVERSITY OF STIRLING   (United Kingdom)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c UNIVERSITY OF EAST ANGLIA   (United Kingdom)

^d UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Combinatorial optimisation; Evolutionary computation; Hyper heuristics; Machine learning; Metaheuristics; Scheduling

Indexed keywords

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; LEARNING SYSTEMS; OPTIMIZATION; SCHEDULING;

CRITICAL DISCUSSIONS; HEURISTIC SELECTIONS; HYPER-HEURISTICS; LEARNING MECHANISM; META HEURISTICS; SCIENTIFIC LITERATURE; STATE OF THE ART; STRATEGIC RESEARCH;

HEURISTIC METHODS;

EID: 84888031698     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2013.71     Document Type: Review

References (232)

1. Adenso-Diaz B and Laguna M (2006). Fine-Tuning of algorithms using fractional experimental designs and local search. Operations Research 54(1): 99-114
2. Ahmadi S, Barrone P, Cheng P, Burke EK, Cowling P and McCollum B (2003). Perturbation based variable neighbourhood search in heuristic space for examination timetabling problem. In: Kendall G, Burke EK, Petrovic S and Gendreau M (eds). Multidisciplinary International Scheduling: Theory and Applications. MISTA, Springer: New York, pp 155-171
3. Allen S, Burke EK, Hyde MR and Kendall G (2009). Evolving reusable 3d packing heuristics with genetic programming. In: Rothlauf F (ed). Genetic and Evolutionary Computation Conference (GECCO '09). ACM: New York, NY, pp 931-938
4. Antunes CH, Lima P, Oliveira E and Pires DF (2009). A multiobjective simulated annealing approach to reactive power compensation. Engineering Optimization 43(10): 1063-1077
5. Asmuni H, Burke EK, Garibaldi JM and McCollum B (2005). Fuzzy multiple heuristic orderings for examination timetabling. Proceedings of the 5th International Conference on Practice and Theory of Automated Timetabling, PATAT'04. Springer-Verlag: Berlin, Hiedelberg
6. Ayob M and Kendall G (2003). A Monte Carlo hyper-heuristic to optimize component placement sequencing for multi head placement machine. In: Proceedings of the International Conference on Intelligent Technologies (InTech'03), Institute for science and Technology Research and Development: Chiang Mai, Thailand, pp 132-141
7. Bader-El-Den M and Poli R (2007). Generating sat local-search heuristics using a GP hyper-heuristic framework. In: Monmarche N, Talbi E-G, Collet P, Schoenauer M and Lutton E (eds). International Conference on Artificial Evolution. Lecture Notes in Computer Science, Springer-Verlag: Berlin, Heidelberg, pp 37-49
8. Bader-El-Den M and Poli R (2008). An incremental approach for improving local search heuristics. In: Van Hemert JI and Cotta C (eds). European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP'08), Lecture Notes in Computer Science. Springer: Naples, Italy, pp 194-205
9. Bader-El-Den M, Poli R and Fatima S (2009). Evolving timetabling heuristics using a grammar-based genetic programming hyperheuristic framework. Memetic Computing 1(3): 205-219
10. Bai R and Kendall G (2005). An investigation of automated planograms using a simulated annealing based hyper-Heuristics. In: Ibaraki T, Nonobe K and Yagiura M (eds). Metaheuristics: Progress as Real Problem Solver-(Operations Research/Computer Science Interface Series). Vol. 32, Springer: New York, pp 87-108
11. Bai R and Kendall G (2008). A model for fresh produce shelfspace allocation and inventory management with freshnesscondition-dependent demand. INFORMS Journal on Computing 20(1): 78-85
12. Bai R, Burke EK, Kendall G and McCollum B (2007). Memory length in hyper-heuristics: An empirical study. In: Kendall G, Tan KC, Burke EK and Smith S (eds) Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling (CISched2007). IEEE: Honolulu, H.I.
13. Bai R, Burke EK and Kendall G (2008). Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation. Journal of the Operational Research Society 59(10): 1387-1397
14. Bai R, Blazewicz J, Burke EK, Kendall G and McCollum B (2012). A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR: A Quarterly Journal of Operations Research 10(1): 43-66
15. Battiti R (1996). Reactive search: Toward self-Tuning heuristics. In: Rayward-Smith VJ, Osman IH, Reeves CR and Smith GD (eds). Modern Heuristic Search Methods. John Wiley & Sons Ltd.: Chichester, pp 61-83
16. Battiti R, Brunato M and Mascia F (2009). Title: Reactive Search and Intelligent Optimization. Operations Research/Computer Science Interfaces Series, Vol. 45, Springer: New York
17. Berberoǧlu A and Uyar Ac (2010). A hyper-heuristic approach for the unit commitment problem. In: Di Chio C, Brabazon A, Di Caro G, EbnerM, FarooqM, Fink A, Grahl J, Greenfield G, Machado P, ONeill M, Tarantino E and Urquhart N (eds). Applications of Evolutionary Computation. Lecture Notes in Computer Science Springer: Berlin/Heidelberg, pp 121-130
18. Berberoglu A and Uyar AS (2011). Experimental comparison of selection hyper-heuristics for the short-Term electrical power generation scheduling problem. In: Di Chio C, et al (eds). Proceedings of Evo-Applications 2011, Part II, LNCS. Springer: Berlin/Heidelberg, pp 444-453
19. Bhanu SMS and Gopalan N (2008). A hyper-heuristic approach for efficient resource scheduling in grid. International Journal of Computers, Communications & Control III(3): 249-258
20. Biazzini M, Banhelyi B, Montresor A and Jelasity M (2009). Distributed hyper-heuristics for real parameter optimization. In: Rothlauf F (ed). Genetic and Evolutionary Computation Conference (GECCO 2009). ACM: New York, NY, pp 1339-1346
21. Bilgin B, Özcan E and Korkmaz EE (2006). An experimental study on hyper-heuristics and final exam scheduling. In: Proceedings of the International Conference on the Practice and Theory of Automated Timetabling (PATAT'06), pp 123-140
22. Birattar M (2005). Tuning Metaheuristics: A Machine Learning Perspective. Studies in Computational Intelligence, Vol. 197, Springer: New York
23. Blazewicz J, Burke E, Kendall G, Mruczkiewicz W, Oguz C and Swiercz A (2011). A hyper-heuristic approach to sequencing by hybridization of dna sequences. Annals of Operations Research, pp 1-15, DOI 10.1007/s10479-011-0927- y.
24. Branke J (2002). Evolutionary Optimization in Dynamic Environments. Kluwer: Dordrecht, M.A.
25. Burke EK and Bykov Y (2008). A late acceptance strategy in hillclimbing for exam timetabling problems. In: Practice and Theory of Automated Timetabling (PATAT 2008
26. Burke EK, Hart E, Kendall G, Newall J, Ross P and Schulenburg S (2003a). Hyperheuristics: An emerging direction in modern search technology. In: Glover F and Kochenberger G (eds). Handbook of Metaheuristics. Kluwer: Dordrecht, MA, pp 457-474
27. Burke EK, Kendall G and Soubeiga E (2003b). A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9(6): 451-470
28. Burke EK, Dror M, Petrovic S and Qu R (2005a). The next wave in computing, optimization, and decision technologies. chap Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems, Springer: New York, pp 79-91
29. Burke EK, Kendall G, Landa-Silva JD, O'Brien R and Soubeiga E (2005b). An ant algorithm hyperheuristic for the project presentation scheduling problem. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation, Edinburgh, Scotland, Vol. 3, pp 2263-2270
30. Burke EK, Landa-Silva JD and Soubeiga E (2005c). Metaheuristics: Progress as real problem solvers. chap Multi-objective Hyper-heuristic Approaches for Space Allocation and Timetabling, Springer: New York, pp 129-158
31. Burke EK, Hyde MR and Kendall G (2006a). Evolving bin packing heuristics with genetic programming. In: Parallel Problem Solving from Nature (PPSN'06), Lecture Notes in Computer Science, Vol. 4193, pp 860-869
32. Burke EK, Petrovic S and Qu R (2006b). Case-based heuristic selection for timetabling problems. Journal of Scheduling 9(2): 115-132
33. Burke EK, Hyde M, Kendall G and Woodward J (2007a). The scalability of evolved on line bin packing heuristics. In: IEEE Congress on Evolutionary Computation (CEC'07), Singapore, pp 2530-2537
34. Burke EK, Hyde M, Kendall G and Woodward J (2007b). Automatic heuristic generation with genetic programming: Evolving a jack-of-All-Trades or a master of one. In: Genetic and Evolutionary Computation Conference (GECCO'07), ACM, pp 1559-1565
35. Burke EK, McCollum B, Meisels A, Petrovic S and Qu R (2007c). A graph-based hyperheuristic for educational timetabling problems. European Journal of Operational Research 176: 177-192
36. Burke EK, Hyde M, Kendall G, Ochoa G,Özcan E and Woodward J (2009). Exploring hyper-heuristic methodologies with genetic programming. In: Mumford C and Jain L (eds). Computational Intelligence: Collaboration, Fusion and Emergence, Intelligent Systems Reference Library. Springer: New York, pp 177-201
37. Burke E, Kendall G, Misir M and Özcan E (2010a). Monte Carlo hyper-heuristics for examination timetabling. Annals of Operations Research 196: 73-90
38. Burke EK, Curtois T, Hyde M, Kendall G, Ochoa G, Petrovic S, Vazquez-Rodriguez JA and Gendreau M (2010b). Iterated local search versus hyper-heuristics: Towards general purpose search algorithms. In: IEEE Congress on Evolutionary Computation (CEC 2010), pp 3073-3080
39. Burke EK, Hyde M and Kendall G (2010c). Providing a memory mechanism to enhance the evolutionary design of heuristics. In: Proceedings of the IEEE World Congress on Computational Intelligence (WCCI'10), Barcelona, Spain, pp 3883-3890
40. Burke EK, Hyde M, Kendall G, Ochoa G,Özcan E and Woodward J (2010d). Handbook of meta-heuristics, international series in operations research & management science. Vol. 146, chap A Classification of Hyper-heuristic Approaches, Springer: New York, pp 449-468. Chapter 15
41. Burke EK, Hyde MR, Kendall G and Woodward J (2010e). A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Transactions on Evolutionary Computation 14(6): 942-958
42. Burke E, Gendreau M, Ochoa G and Walker J (2011a). Adaptive iterated local search for cross-domain optimisation. In: Genetic and Evolutionary Computation (GECCO 2011), ACM, pp 1987-1994
43. Burke EK, Hyde MR, Kendall G and Woodward J (2011b). Automating the packing heuristic design process with genetic programming. Evolutionary Computation 20(1): 63-89
44. Burke EK, Hyde MR and Kendall G (2012). Grammatical evolution of local search heuristics. IEEE Transactions on Evolutionary Computation 16: 406-417
45. Candan C, Goeffon A, Lardeux F and Saubion F (2012). An exploration-exploitation compromise-based adaptive operator selection for local search. In: Soule T and Moore JH (eds). Genetic and Evolutionary Computation (GECCO 2012). ACM: New York, NY, pp 1253-1260
46. Cano-Belmáan J, Ŕ R and Bautista J (2010). A scatter search based hyperheuristic for sequencing a mixed-model assembly line. Journal of Heuristics 16(6): 749-770
47. Cerny V (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications 45(1): 41-51
48. Chakhlevitch K and Cowling P (2005). Choosing the fittest subset of low level heuristics in a hyperheuristic framework. In: Raidl GR and Gottlieb J (eds). Proceedings of 5th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP2005). Lecture Notes in Computer Science, Springer: New York, pp 25-33
49. Chakhlevitch K and Cowling P (2008). Hyperheuristics: Recent developments. In: Cotta C, Sevaux M and SÖrensen K (eds). Adaptive and Multilevel Metaheuristics, Studies in Computational Intelligence. Vol. 136, Springer: New York, pp 3-29
50. Chan C, Xue F, Ip W and Cheung C (2012). A hyper-heuristic inspired by pearl hunting. In: Hamadi Y and SchoenauerM(eds) International Conference on Learning and Intelligent Optimization (LION 6), Lecture Notes in Computer Science. Vol. 7219, Springer Berlin Hiedelberg: Paris, France, pp 349-353
51. Chen PC, Kendall G and Vanden-Berghe G (2007). An ant based hyper-heuristic for the travelling tournament problem. In: Kendall G, Tan KC, Burke EK and Smith S (eds) Proceedings of IEEE Symposium of Computational Intelligence in Scheduling (CISched 2007). IEEE: Honolulu, HI, pp 19-26
52. Cheng P, Barone R, Ahmadi S and Cowling P (2003). Integrating human abilities with the power of automated scheduling systems: Representational epistemological interface design. In: Kortenkamp D and Freed M (eds) AAAI Spring Symposium on Human Interaction with Autonomous Systems in Complex Environments. American Association for Artificial Intelligence: Palo Alto, CA, pp 23-29
53. Cobos C, Mendoza M and Leon E (2011). A hyper-heuristic approach to design and tuning heuristic methods for web document clustering. In: Evolutionary Computation (CEC). IEEE: New Orleans, LA, pp 1350-1358
54. Corne D and Ross P (1996). Peckish initialisation strategies for evolutionary timetabling. In: Burke E and Ross P (eds). Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science. Vol. 1153, Springer: Berlin/Heidelberg, pp 227-240
55. Cowling P and Chakhlevitch K (2003). Hyperheuristics for managing a large collection of low level heuristics to schedule personnel. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC2003), IEEE Computer Society Press: Canberra, Australia, pp 1214-1221
56. Cowling P, Kendall G and Soubeiga E (2000). A hyperheuristic approach to scheduling a sales summit. In: Burke EK and Erben W (eds). Selected Papers of the Third International Conference on the Practice And Theory of Automated Timetabling. PATAT 2000, Lecture Notes in Computer Science, Springer: Konstanz, Germany, pp 176-190
57. Cowling P, Kendall G and Soubeiga E (2001). A parameter-free hyperheuristic for scheduling a sales summit. In: Sousa JP and Resende MGC (eds). Proceedings of the 4th Metaheuristic International Conference. Springer; Porto, Portugal, pp 127-131
58. Cowling P, Kendall G and Han L (2002a). An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem. In: Wang L et al (eds). Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL'02). Orchid Country Club: Singapore, pp 267-271
59. Cowling P, Kendall G and Han L (2002b). An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of the Congress on Evolutionary Computation (CEC2002). IEEE Computer Society: Honolulu, Hawaii, USA, pp 1185-1190
60. Cowling P, Kendall G and Soubeiga E (2002c). Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In: Cagoni S, Gottlieb J, Hart E, Middendorf M and Goenther R (eds). Applications of Evolutionary Computing: Proceeding of Evo Workshops 2002. Lecture Notes in Computer Science, Vol, 2279, Springer-Verlag: Kinsale, Ireland, pp 1-10
61. Crainic T and Toulouse M (2003). Parallel strategies for metaheuristics. In: Glover F and Kochenberger G (eds). Handbook in Meta-heuristics. Kluwer Academic Publishers: Dordrecht, MA, pp 475-513
62. Crowston WB, Glover F, Thompson GL and Trawick JD (1963). Probabilistic and parametric learning combinations of local job shop scheduling rules. ONR Research memorandum, GSIA, Carnegie Mellon University, Pittsburgh 1(117
63. Cruz C, Gonzalez J and Pelta D (2011). Optimization in dynamic environments: A survey on problems, methods and measures. Soft Computing-A Fusion of Foundations, Methodologies and Applications 15(7): 1427-1448
64. Demeester P, Bilgin B, Causmaecker PD and Berghe GV (2012). A hyperheuristic approach to examination timetabling problems: Benchmarks and a new problem from practice. Journal of Scheduling 15(1): 83-103
65. Denzinger J, Fuchs M and FuchsM (1996). High performance ATP systems by combining several ai methods. Technical Report, SEKI-Report SR-96-09, University of Kaiserslautern
66. DiGaspero L and Schaerf A (2007). Easysyn++: A tool for automatic synthesis of stochastic local search algorithms. In: Studie;tzle T, BirattariM, Hoos HH (eds) InternationalWorkshop on Engineering Stochastic Local Search Algorithms (SLS 2007). LectureNotes in Computer Science, Springer: Brussels, Belgium, pp 177-181
67. Dimopoulos C and Zalzala AMS (2001). Investigating the use of genetic programming for a classic one-machine scheduling problem. Advances in Engineering Software 32(6): 489-498
68. Dorndorf U and Pesch E (1995). Evolution based learning in a job shop scheduling environment. Computers and Operations Research 22(1): 25-40
69. Dowsland KA, Soubeiga E and Burke EK (2007). A simulated annealing hyperheuristic for determining shipper sizes for storage and transportation. European Journal of Operational Research 179(3): 759-774
70. Drake J, Özcan E and Burke E (2012). An improved choice function heuristic selection for cross domain heuristic search. In: Coello Coello CA, Cutello V, Deb K, Forrest S, Nicosia G and Pavone M (eds). Parallel Problem Solving from Nature-PPSN XII. Lecture Notes in Computer Science, Springer: Taormina, Italy, pp 307-316
71. Drechsler R and Becker B (1995). Learning heuristics by genetic algorithms. In: Shirakawa I (ed). ASP Design Automation Conference. ACM: Makuhari, Massa, Chiba, Japan, pp 349-352
72. Drechsler R, GÖckel N and Becker B (1996). Learning heuristics for obdd minimization by evolutionary algorithms. In: Voigt H-M, Ebeling W, Rechenberger I and Schwefel H-P (eds). Parallel Problem Solving from Nature (PPSN'96). Lecture Notes in Computer Science, Springer: Berlin, Germany, pp 730-739
73. Dueck G (1993). New optimization heuristics the great deluge algorithm and the record to-record travel. Journal of Computational Physics 104(1): 86-92
74. Eiben AE, Hinterding R and Michalewicz Z (1999). Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2): 124
75. Eiben AE, Michalewicz Z, Schoenauer M and Smith JE (2007). Parameter setting in evolutionary algorithms. In: Lobo FJ, Lima CF and Michalewicz Z (eds). Chap Parameter Control in Evolutionary Algorithms. Springer: New York, pp 19-46
76. Elyasaf A, Hauptman A and Sipper M (2012). Evolutionary design of Freecell Solvers. IEEE Transactions On Computational Intelligence and AI in Games 4(4): 270-281
77. Ersoy E, Özcan E and Etaner-Uyar AS (2007). Memetic algorithms and hyperhill-climbers. In: Baptiste P, Kendall G, Kordon AM and Sourd F (eds). Proceedings of the 3rd Multidisciplinary International Scheduling Conference on Scheduling: Theory and Applications, MISTA: Paris, France, pp 28-31
78. Fang H, Ross P and Corne D (1993). A promising genetic algorithm approach to job shop scheduling, rescheduling, and open-shop scheduling problems. In: Cohn AG (ed). International Conference on Genetic Algorithms. John Wiley and Sons: Amsterdam, the Netherlands, pp 375-382
79. Fang H, Ross P and Corne D (1994). A promising hybrid ga/ heuristic approach for openshop scheduling problems. In: Cohn AG (ed). European Conference on Artificial Intelligence. John Wiley & Sons: New York
80. Feo TA and Resende MGC (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization 6(2): 109-133
81. Fialho A, Costa L, Schoenauer M and Sebag M (2008). Extreme value based adaptive operator selection. In: Rudolph G, Jansen T, Lucas SM, Poloni C and Beume N (eds). Industrial Scheduling. Lecture Notes in Computer Science, Springer: Dortmund, Germany, pp 175-184
82. Fisher H and Thompson GL (1963). Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF and Thompson GL (eds). Industrial Scheduling. Prentice-Hall: Englewood Cliffs, NJ, pp 225-251
83. Freisleben B and Hadie;rtfelder M (1993). Optimization of genetic algorithms by genetic algorithms. In: Albrecht RF, Steele NC and Reeves CR (eds). Artificial Neural Nets and Genetic Algorithms. Springer Verlag: Berlin, pp 392-399
84. Fukunaga AS (2002). Automated discovery of composite sat variable-selection heuristics. In: Dechter R and Sutton RS (eds). National Conference on Artificial Intelligence. AAAI Press: Edmonton, Alberta, Canada, pp 641-648
85. Fukunaga AS (2004). Evolving local search heuristics for SAT using genetic programming. In: Deb K (ed). Genetic and Evolutionary Computation Conference (GECCO '04). ISGEC, LectureNotes in Computer Science, Springer: Berlin, pp 483-494
86. Fukunaga AS (2008). Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation (MIT Press) 16(1): 31-1
87. Gagliolo M and Schmidhuber J (2006). Learning dynamic algorithm portfolios. Annals of Mathematics and Artificial Intelligence 47(3-4): 295-328
88. Garcia-Villoria A, Salhi S, Corominas A and Pastor R (2011). Hyper-heuristic approaches for the response time variability problem. European Journal of Operational Research 211(1): 160-169
89. Garrido P and Castro C (2009). Stable solving of cvrps using hyperheuristics. In: Rothlauf F (eds). Genetic and Evolutionary Computation Conference (GECCO'09). ACM: Montreal, Canada, pp 255-262
90. Garrido P and Riff MC (2007a). Collaboration between hyperheuristics to solve strippacking problems. In: Ochoa G and Özcan E (eds). 12th International Fuzzy Systems Association World Congress, Proceedings. Lecture Notes in Computer Science, Springer: New York, pp 698-707
91. Garrido P and Riff MC (2007b). An evolutionary hyperheuristic to solve strip-packing problems. In: Yin H, Tino P, Corchado E, Byrne W and Yao X (eds). Intelligent Data Engineering and Automated Learning-IDEAL 2007 Proceedings. Lecture Notes in Computer Science, Springer: Berlin, pp 406-415
92. Garrido P and Riff MC (2010). Dvrp: A hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic. Journal of Heuristics 16(6): 795-834
93. Gaspero LD and Urli T (2012). Evaluation of a family of reinforcement learning crossdomain optimization heuristics. In: Hamadi Y and Schoenauer M (eds). International Conference on Learning and Intelligent Optimization (LION 6). Lecture Notes in Computer Science, Springer: Berlin, pp 384-389
94. Geiger CD, Uzsoy R and Aytug H (2006). Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. Journal of Scheduling 9(1): 7-34
95. Gibbs J, Kendall G and Özcan E (2010). Scheduling English football fixtures over the holiday period using hyper-heuristics. In: Schaefer R, Cotta C, Kolodziej J and Rudolph G (eds). Parallel Problem Solving from Nature, PPSN'10. Springer-Verlag: Berlin, pp 496-505
96. Goldberg DE, Korb B and Deb K (1990). Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems 3(5): 493-530
97. Gratch J and Chien S (1996). Adaptive problem-solving for largescale scheduling problems: A case study. Journal of Artificial Intelligence Research 4(1): 365-396
98. Gratch J, Chien S and DeJong G (1993). Learning search control knowledge for deep space network scheduling. In: International Conference on Machine Learning. Morgan Kaufmann: Amherst, MA, pp 135-142
99. Grefenstette J (1986). Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics SMC 16(1): 122-128
100. Grobler J, Engelbrecht A, Kendall G and Yadavalli V (2012). Investigating the use of local search for improving meta-hyperheuristic performance. In: Evolutionary Computation (CEC). IEEE: Brisbane, Australia, pp 1-8
101. Han L and Kendall G (2003). Guided operators for a hyperheuristic genetic algorithm. In: Gedeon TD and Fung LCC (eds). The 16th Australian Conference on Artificial Intelligence (AI 03). Springer: Perth, Australia, pp 807-820
102. Hart E and Ross P (1998). A heuristic combination method for solving job-shop scheduling problems. In: Eiben AE, Bäck T, Schoenauer M and Schwefel H-P (eds). Parallel Problem Solving from Nature, PPSN V. Lecture Notes in Computer Science, Springer: Amsterdam, the Netherlands, pp 845-854
103. Hart E, Ross P and Nelson JAD (1998). Solving a real-world problem using an evolving heuristically driven schedule builder. Evolutionary Computing 6(1): 61-80
104. He J, He F and Dong H (2012). Pure strategy or mixed strategy?-An initial comparison of their asymptotic convergence rate and asymptotic hitting time. In: Hao JK and Middendorf M (eds). Evolutionary Computation in Combinatorial Optimization-12th European Conference, EvoCOP 2012. Málagga, Spain, 11-13 April 2012. Proceedings, Lecture Notes in Computer Science, Vol. 7245, Springer, pp 218-229
105. Ho NB and Tay JC (2005). Evolving dispatching rules for solving the flexible job-shop problem. In: IEEE Congress on Evolutionary Computation (CEC'05). IEEE: Edinburgh, UK, pp 2848-2855
106. Hoos HH and Studie;tzle T (2004). Stochastic Local Search: Foundations and Applications. Elsevier/Morgan Kaufmann: San Francisco, C.A.
107. Horvitz E, Ruan Y, Gomes C, Kautz H, Selman B and Chickering D (2001). A bayesian approach to tackling hard computational problems. In: Breese JS and Koller D (eds). Conference in Uncertainty in Artificial Intelligence, UAI '01. Morgan Kaufman: Los Altos, CA, pp 235-244
108. Huberman BA, Lukose RM and Hogg T (1997). An economics approach to hard computational problems. Science 275(5296): 51-54
109. Hutter F, Hoos HH and Studie;tzle T (2007). Automatic algorithm configuration based on local search. In: Cohn A (ed). Proceedings of the Twenty-second AAAI Conference on Artificial Intelligence. AAAI Press: Vancouver, British Columbia, Canada, pp 1152-1157
110. Hutter F, Hoos H, Leyton-Brown K and Studie;tzle T (2009). Paramils: An automatic algorithm configuration framework. Journal of Artificial Intelligence Research (JAIR) 36(1): 267-306
111. Jakob W (2006). Towards an adaptive multimeme algorithm for parameter optimisation suiting the engineers' needs. In: Runarsson TP, Beyer H-G, Burke E, Merelo-Guervós JJ, Whitley LD, Yao X (eds). Parallel Problem Solving from Nature (PPSN IX). Lecture Notes in Computer Science, Springer: Berlin, pp 132-141
112. Jakobovic D, Jelenkovic L and Budin L (2007). Genetic programming heuristics for multiple machine scheduling. In: Ebner M, O'Neill M, Ekárt A, Vanneschi L, Esparcia-Alcázar A (eds). European Conference on Genetic Programming (EUROGP' 07). Lecture Notes in Computer Science, Springer: Valencia, Spain, pp 321-330
113. Kaelbling LP, Littman ML and Moore AW (1996). Reinforcement learning: A survey. Journal of Artificial Intelligence Research 4(1): 237-285
114. Kampouridis M, Alsheddy A and Tsang E (2012). On the investigation of hyper-heuristics on a financial forecasting problem. Annals of Mathematics and Artificial Intelligence. Springer: Netherlands, 1012-2443
115. Keller RE and Poli R (2007a). Cost-benefit investigation of a genetic-programming hyperheuristic. In: MonmarchÉN., Talbi E-G, Collet P, Schoenauer M and Lutton E (eds). International Conference on Artificial Evolution. Springer-Verlag: Berlin, Heidelberg, pp 13-24
116. Keller RE and Poli R (2007b). Linear genetic programming of parsimonious metaheuristics. In: IEEE Congress on Evolutionary Computation (CEC'07). IEEE: Singapore, pp 4508-4515
117. Keller RE and Poli R (2008a). Self-Adaptive hyperheuristic and greedy search. In: IEEE World Congress on Computational Intelligence (WCCI'08). IEEE: Hong Kong, China, pp 3801-3808
118. Keller RE and Poli R (2008b). Subheuristic search and scalability in a hyperheuristic. In: Ryan C and Keijzer M (eds). Genetic and Evolutionary Computation Conference (GECCO'08). ACM: Atlanta, GA, pp 609-610
119. Keller RE and Poli R (2008c). Toward subheuristic search. In: IEEE World Congress on Computational Intelligence (WCCI'08). IEEE: Hong Kong, China, pp 3148-3155
120. Kendall G and Mohamad M (2004a). Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Proceedings of the 2004 IEEE International Conference on Network (ICON2004). IEEE: Singapore, pp 769-773
121. Kendall G and Mohamad M (2004b). Channel assignment optimisation using a hyperheuristic. In: Proceedings of the 2004 IEEE Conference on Cybernetic and Intelligent Systems (CIS2004). IEEE: Singapore, pp 790-795
122. Kenyon C (1996). Best-fit bin-packing with random order. In: Tardos É(ed). Annual ACM-SIAM Symposium on Discrete Algorithms. ACM\SIAM: Atlanta, Georgia, pp 359-364
123. Kiraz B and Topcuoglu HR (2010). Hyper-heuristic approaches for the dynamic generalized assignment problem. In: Intelligent Systems Design and Applications (ISDA), 2010 10th International Conference on. IEEE: Cairo, Egypt, pp 1487-1492
124. Kiraz B, Uyar Ac and Özcan E (2011). An investigation of selection hyper-heuristics in dynamic environments. In: Proceedings of the 2011 International Conference on Applications of Evolutionary Computation-Volume Part I, Springer-Verlag: Berlin, Heidelberg, EvoApplications'11, pp 314-323
125. Kirkpatrick S, Gelatt CD and Vecchi MP (1983). Optimization by simulated annealing. Science 220(4598): 671-680
126. KÖle M, Etaner-Uyar A, Kiraz B and Özcan E (2012). Heuristics for car setup optimisation in torcs. In: De Wilde P, Coghill GM and Kononova AV (eds). Computational Intelligence (UKCI), 2012 12th UK Workshop on. IEEE: Edinburgh, UK, pp 1-8
127. Koza JR (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. The MIT Press: Boston, M.A.
128. Koza JR and Poli R (2005). Genetic programming. In: Burke E and Kendall G (eds). Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Kluwer: Boston, MA, pp 127-164
129. Krasnogor N and Gustafson S (2004). A study on the use of 'self-generation' in memetic algorithms. Natural Computing 3(1): 53-76
130. Krasnogor N and Smith JE (2000). A memetic algorithm with self-Adaptive local search: TSP as a case study. In: Whitley LD, Goldberg DE, Cantú -Paz E, Spector L, Parmee IC and Beyer H-G (eds). Genetic and Evolutionary Computation Conference (GECCO 2000). Morgan Kaufmann: Las Vegas, Nevada, USA
131. Kumar R, Joshi AH, Banka KK and Rockett PI (2008). Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming. In: Ryan C and Keijzer M (eds). Genetic and Evolutionary Computation Conference (GECCO'08). ACM: Atlanta, Georgia, pp 1227-1234
132. Kumar R, Kumar-Bal B and Rockett PI (2009). Multiobjective genetic programming approach to evolving heuristics for the bounded diameter minimum spanning tree problem. In: Franz R (ed). Genetic and Evolutionary Computation Conference (GECCO '09). ACM: Montreal, Quebec, Canada, pp 309-316
133. Laguna M and Martí R (2003). Scatter search Methodology and Implementations in C. In: Operations Research/Computer Science Interfaces Series. Kluwer Academic Publishers: Boston
134. Li J, Burke EK and Qu R (2011). Integrating neural network and logistic regression to underpin hyper-heuristic search. Knowledge-Based Systems 24(2): 322-330
135. Lobo F, Lima C and Michalewicz Z (eds). (2007). Parameter Setting in Evolutionary Algorithms, Studies in Computational Intelligence. Vol. 54, Springer: Berlin
136. Lokketangen A and Olsson R (2010). Generating meta-heuristic optimization code using ADATE. Journal of Heuristics 16(6): 911-930
137. van Lon RR, Holvoet T, Vanden Berghe G, Wenseleers T and Branke J (2012). Evolutionary synthesis of multi-Agent systems for dynamic dial-A-ride problems. In: Soule T and Moore JH (eds). Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference Companion. GECCO Companion '12, ACM: Philadelphia, PA, pp 331-336
138. Lopez-Camacho E, Terashima-Marin H, Ross P and Valenzuela-Rendon M (2010). Problem-state representations in a hyperheuristic approach for the 2d irregular bpp. In: Ibero-American Conference on AI, IBERAMIA 2010, Lecture Notes in Computer Science, Vol. 6433, Springer: Berlin, pp 204-213
139. Maden I, Uyar AS and Özcan E (2009). Landscape analysis of simple perturbative hyperheuristics. In: Matousek R (ed). Mendel 2009: 15th International Conference on Soft Computing. Springer: Brno, Czech Republic, pp 16-22
140. Marín JG and Schulenburg S (2007). A hyper-heuristic framework with XCS: Learning to create novel problem-solving algorithms constructed from simpler algorithmic ingredients. In: IWLCS, Lecture Notes in Computer Science, Vol. 4399, Springer: Berlin, pp 193-218
141. Maturana J, Fialho A, Saubion F, Schoenauer M and Sebag M (2009). Extreme compass and dynamic multi-Armed bandits for adaptive operator selection. In: IEEE Congress on Evolutionary Computation, CEC '09. IEEE: Trondheim, Norway, pp 365-372
142. Maturana J, Lardeux F and Saubion F (2010). Autonomous operator management for evolutionary algorithms. Journal of Heuristics 16(6): 881-909
143. McClymont K and Keedwell EC (2011). Markov chain hyperheuristic (MCHH): An online selective hyper-heuristic for multiobjective continuous problems. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, ACM: New York, NY, USA, GECCO '11, pp 2003-2010
144. Meignan D, Koukam A and Creput JC (2010). Coalitionbased metaheuristic: A selfadaptive metaheuristic using reinforcement learning and mimetism. Journal of Heuristics 16(6): 859-879
145. Minton S (1996). Automatically configuring constraint satisfaction problems: A case study. Constraints 1(1): 7-43
146. Misir M, Wauters T, Verbeeck K and Berghe GV (2009). A new learning hyper-heuristic for the traveling tournament problem. In: Voss S and Caserta M (eds). Proceedings of the 8th Metaheuristic International Conference (MIC'09). Hamburg: Germany
147. Misir M, Verbeeck K, De Causmaecker P and Vanden Berghe G (2010). Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC'10). IEEE: Barcelona, Spain, pp 2875-2882
148. Misir M, Vancroonenburg W, Verbeeck K and Berghe GV (2011). A selection hyperheuristic for scheduling deliveries of readymixed concrete. In: Proceedings of MIC 2011, pp 289-298
149. Misir M, Verbeeck K, De Causmaecker P and Vanden Berghe G (2012). An intelligent hyper-heuristic framework for chesc 2011. In: International Conference on Learning and Intelligent Optimization (LION 6), Lecture Notes in Computer Science, Vol. 7219, Springer: Berlin, pp 461-466
150. Mladenovic N and Hansen P (1997). Variable neighborhood search. Computers and Operations Research 24(11): 1097-1100
151. Nareyek A (2001). An empirical analysis of weight-Adaptation strategies for neighborhoods of heuristics. In: Sousa J (ed). Metaheuristic International Conference MIC'2001. Porto, Portugal, pp 211-215
152. Nareyek A (2003). Choosing search heuristics by non-stationary reinforcement learning. In: Resende MGC and de Sousa JP (eds). Metaheuristics: Computer Decision-Making. chap 9, Kluwer: Boston, MA, pp 523-544
153. Nguyen S, Zhang M and Johnston M (2011). A genetic programming based hyper-heuristic approach for combinatorial optimisation. In: Genetic and Evolutionary Computation Conference (GECCO'11), ACM: New York, pp 1299-1306
154. Norenkov I and Goodman E (1997). Solving scheduling problems via evolutionary methods for rule sequence optimization. 2nd World Conference on Soft Computing, WSC2
155. Ochoa G and Hyde M (2011). The cross-domain heuristic search challenge (CHeSC 2011). http://www.asap.cs.nott.ac.uk/chesc2011/.
156. Ochoa G, Qu R and Burke EK (2009a). Analyzing the landscape of a graph based hyperheuristic for timetabling problems. In: Genetic and Evolutionary Computation Conference (GECCO 2009), ACM: New York, pp 341-348
157. Ochoa G, Váquez-Rodri'guez JA, Petrovic S and Burke EK (2009b). Dispatching rules for production scheduling: A hyper-heuristic landscape analysis. In: IEEE Congress on Evolutionary Computation (CEC 2009), IEEE: New York, pp 1873-1880
158. Ochoa G, Hyde M, Curtois T, Vazquez-Rodriguez JA, Walker J, Gendreau M, Kendall G, Parkes AJ, Petrovic S and Burke EK (2012a). Hyflex: A benchmark framework for cross-domain heuristic search. In: Proceedings of the 12th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP'12, Lecture Notes in Computer Science, Vol. 7245, Springer-Verlag: Berlin, pp 136-147
159. Ochoa G, Walker J, Hyde M and Curtois T (2012b). Adaptive evolutionary algorithms and extensions to the hyflex hyper-heuristic framework. In: Parallel Problem Solving from Nature-PPSN XII, Lecture Notes in Computer Science, Vol. 7492, Springer: Berlin, pp 418-427
160. Oltean M (2005). Evolving evolutionary algorithms using linear genetic programming. Evolutionary Computation 13(3): 387-410
161. Oltean M and Dumitrescu D (2004). Evolving TSP heuristics using multi expression programming. In: International Conference on Computational Science (ICCS'04), Lecture Notes in Computer Science, Vol. 3037, Springer: Berlin, pp 670-673
162. Oltean M and Grosan C (2003). Evolving evolutionary algorithms using multi expression programming. In: Banzhaf W, Christaller T, Dittrich P, Kim JT and Ziegler J (eds). European Conference on Artificial Life (ECAL'03). Lecture Notes in Artificial Intelligence, Springer: Dortmund, Germany, pp 651-658
163. Ong YS and Keane AJ (2004). Meta-Lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation 8(2): 99-110
164. Ong YS, Lim MH, Zhu N and Wong KW (2006). Classification of adaptive memetic algorithms: A comparative study. IEEE Transactions on Systems, Man, and Cybernetics, Part B 36(1): 141-152
165. Ortiz-Bayliss J, Özcan E, Parkes A and Terashima-Marin H (2010). Mapping the performance of heuristics for constraint satisfaction. In: IEEE Congress on Evolutionary Computation (CEC 2010). IEEE: Barcelona, Spain, pp 1-8
166. Ortiz-Bayliss J, Terashima-Marin H, Conant-Pablos S, Özcan E and Parkes A (2012). Improving the performance of vector hyper-heuristics through local search. In: Soule T and Moore JH (eds). Genetic and Evolutionary Computation Conference, GECCO 2012. ACM: Philadelphia, PA, pp 1269-1276
167. Ouelhadj D and Petrovic S (2010). A cooperative hyper-heuristic search framework. Journal of Heuristics 16(6): 835-857
168. Özcan E and Kheiri A (2011). A hyper-heuristic based on random gradient, greedy and dominance. In: Proceedings of the 26th International Symposium on Computer and Information Sciences ISCIS2011, Springer: Berlin
169. Özcan E and Parkes AJ (2011). Policy matrix evolution for generation of heuristics. In: Krasnogor N and Lanzi PL (eds). Genetic and Evolutionary Computation Conference (GECCO 2011). ACM: Dublin, Ireland, pp 2011-2018
170. Özcan E, Bilgin B and Korkmaz EE (2006). Hill climbers and mutational heuristics in hyperheuristics. In: Parallel Problem Solving from Nature (PPSN 2006), Lecture Notes in Computer Science, Vol. 4193, Springer: Berlin, pp 202-211
171. Özcan E, Bilgin B and Korkmaz EE (2008). A comprehensive survey of hyperheuristics. Intelligent Data Analysis 12(1): 1-21
172. Özcan E, Bykov Y, Birben M and Burke E (2009). Examination timetabling using late acceptance hyper-heuristics. In: Proceedings of IEEE Congress on Evolutionary Computation (CEC 2009). IEEE: Trondheim, Norway, pp 997-1004
173. Özcan E, Misir M, Ochoa G and Burke E (2010). A reinforcement learning-Great-deluge hyper-heuristic for examination timetabling. International Journal of Applied Metaheuristic Computing (IJAMC) 1(1): 39-59
174. Pappa GL and Freitas A (2009). Automating the Design of Data Mining Algorithms: An Evolutionary Computation Approach. Springer: Berlin
175. Pillay N (2008). An analysis of representations for hyper-heuristics for the uncapacitated examination timetabling problem in a genetic programming system. In: Annual Conference of the South African Institute of Computer Scientists and Information Technologists, ACM, ACM International Conference Proceeding Series, Vol. 338, pp 188-192
176. Pillay N (2009). Evolving hyper-heuristics for the uncapacitated examination timetabling problem. In: Blazewicz J, Drozdowski M, Kendall G and McCollum B (eds). Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA'09). Dublin, Ireland, pp 447-457
177. Pillay N and Banzhaf W (2007). A genetic programming approach to the generation of hyper-heuristics for the uncapacitated examination timetabling problem. In: 13th Portuguese Conference on Aritficial Intelligence (EPIA 2007), Lecture Notes in Computer Science, Vol. 4874, Springer: Berlin, pp 223-234
178. Ping-Che H, Tsung-Che C and FLi-Chen (2012). A vns-based hyper-heuristic with adaptive computational budget of local search. In: IEEE Congress on Evolutionary Computation. IEEE: Brisbane, Australia, pp 1-8
179. Pisinger D and Ropke S (2007). A general heuristic for vehicle routing problems. Computers and Operations Research 34(8): 2403-2435
180. Poli R and Graff M (2009). There is a free lunch for hyperheuristics, genetic programming and computer scientists. In: Genetic Programming, 12th European Conference, EuroGP 2009, Lecture Notes in Computer Science, Vol. 5481, Springer: Berlin, pp 195-207
181. Poli R, Woodward JR and Burke EK (2007). A histogrammatching approach to the evolution of bin-packing strategies. In: IEEE Congress on Evolutionary Computation (CEC'07). IEEE: Singapore, pp 3500-3507
182. Qu R and Burke EK (2009). Hybridizations within a graph based hyper-heuristic framework for university timetabling problems. Journal of the Operational Research Society 60(9): 1273-1285
183. Rattadilok P, Gaw A and Kwan RSK (2005). Distributed choice function hyper-heuristics for timetabling and scheduling. In: Burke EK and Trick M (eds). The Practice and Theory of Automated Timetabling V: Selected Papers from the 5th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science Series. Vol. 3616, Springer: Berlin, pp 51-70
184. Rechenberg I (1973). Evolution Strategy: Optimization of Technical Systems by Means of Biological Evolution. Fromman-Holzboog: Stuttgart
185. Remde S, Cowling P, Dahal K and Colledge N (2007). Exact/ heuristic hybrids using rvns and hyperheuristics for workforce scheduling. In: Evolutionary Computation in Combinatorial Optimization (EvoCOP 2007), Vol. 4446, Springer-Verlag, pp 188-197
186. Remde S, Cowling P, Dahal K and Colledge N (2009). Binary exponential back-off for tabu tenure in hyperheuristics. In: Cotta C and Cowling P (eds). Evolutionary Computation in Combinatorial Optimization. Vol. 5482, Springer: Berlin, pp 109-112
187. Remde S, Cowling P, Dahal K, Colledge N and Selensky E (2012). An empirical study of hyperheuristics for managing very large sets of low level heuristics. Journal of the Operational Research Society 63(3): 392-345
188. Ren Z, Jiang H, Xuan J and Luo Z (2010). Ant based hyper heuristics with space reduction: A case study of the p-median problem. In: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I, Springer-Verlag: Berlin, PPSN'10, pp 546-555
189. Rice J (1976). The algorithm selection problem. Advances in Computing 15(1): 65-118
190. Ridge E and Kudenko D (2007). Analyzing heuristic performance with response surface models: Prediction, optimization and robustness. In: Genetic and Evolutionary Computation Conference, GECCO 2007, Vol. 1, ACM Press: New York, pp 150-157
191. Ross P (2005). Hyper-heuristics. In: Burke EK and Kendall G (eds). Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. chap 17, Springer: Berlin, pp 529-556
192. Ross P and Marín JG (2005). Constructive hyper-heuristics in class timetabling. In: IEEE Congress on Evolutionary Computation, IEEE: New York, pp 1493-1500
193. Ross P, Hart E and Corne D (1997). Some observations about GA-based exam timetabling. In: Selected Papers of the Third International Conference on the Practice And Theory of Automated Timetabling, PATAT 1997, Lecture Notes in Computer Science, Vol. 1408, Springer: Berlin, pp 115-129
194. Ross P, Schulenburg S, Marín JG and Hart E (2002). Hyperheuristics: Learning to combine simple heuristics in binpacking problem. In: Genetic and Evolutionary Computation Conference, GECCO 2002, Morgan-Kauffman: Los Altos, CA, pp 942-948
195. Ross P, Marín JG, Schulenburg S and Hart E (2003). Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics. In: Genetic and Evolutionary Computation Conference, GECCO 2003, Springer: Berlin, pp 1295-1306
196. Ross P, Marín JG and Hart E (2004). Hyper-heuristics applied to class and exam timetabling problems. In: IEEE Congress on Evolutionary Computation, IEEE Press: New York, pp 1691-1698
197. Runka A (2009). Evolving an edge selection formula for ant colony optimization. In: Genetic and Evolutionary Computation Conference (GECCO '09), ACM: New York, pp 1075-1081
198. Sabar NR, Ayob M, Qu R and Kendall G (2011). A graph coloring constructive hyperheuristic for examination timetabling problems. Applied Intelligence 37(1): 1-11
199. Schmiedle F, Drechsler N, Große D and Drechsler R (2002). Heuristic learning based on genetic programming. Genetic Programming and Evolvable Machines 4(4): 363-388
200. Schwefel HP (1977). Numerische Optimierung von Computer-Modellen mittels der Evolutionstrategie, ISR, vol 26. Birkhaeuser
201. Shaw P (1998). Using constraint programming and local search methods to solve vehicle routing problems. In: Proc. of International Conference on Principles and Practice of Constraint Programming (CP'98), Lecture Notes in Computer Science, Vol. 1520, Springer: Berlin, pp 417-431
202. Sim K, Hart E and Paechter B (2012). A hyper-heuristic classifier for one dimensional bin packing problems: Improving classification accuracy by attribute evolution. In: Parallel Problem Solving from Nature (PPSN XII), Lecture Notes in Computer Science, Vol. 7492, Springer: Berlin, pp 217-233
203. Smith J (2002). Co-evolving memetic algorithms: Initial investigations. In: Parallel Problem Solving from Nature, PPSN VII, Lecture Notes in Computer Science, Vol. 2439, Springer: Berlin, pp 537-546
204. Smith J (2008). Adaptive and multilevel metaheuristics. chap Self-Adaptation in Evolutionary Algorithms for Combinatorial Optimisation, Springer: Berlin, pp 31-57
205. Smith-Miles K (2008a). Towards insightful algorithm selection for optimisation using meta-learning concepts. In: Simpson PK (ed). IEEE World Congress on Computational Intelligence, WCCI 2008. IEEE: Hong Kong, China, pp 4118-4124
206. Smith-Miles KA (2008b). Cross-disciplinary perspectives on metalearning for algorithm selection. ACM Computing Surveys 41(6): 1-25
207. Stephenson M, OReilly U, Martin M and Amarasinghe S (2003). Meta optimization: Improving compiler heuristics with machine learning. In: Michael L (ed). Conference on Programming Language Design and Implementation (SIGPLAN03). ACM Press: New York, NY, pp 77-90
208. Storer RH, Wu SD and Vaccari R (1992). New search spaces for sequencing problems with application to job shop scheduling. Management Science 38(10): 1495-1509
209. Storer RH, Wu SD and Vaccari R (1995). Problem and heuristic space search strategies for job shop scheduling. ORSA Journal of Computing 7(4): 453-467
210. Sutton RS and Barto AG (1998). Reinforcement Learning: An Introduction. MIT Press: Boston, M.A.
211. Swan J, Özcan E and Kendall G (2011). Hyperion-A recursive hyper-heuristic framework. In: Coello CAC (ed). LION. Lecture Notes in Computer Science, Vol. 6683, Springer: Berlin, pp 616-630
212. Tavares J, Machado P, Cardoso A, Pereira FB and Costa E (2004). On the evolution of evolutionary algorithms. In: European Conference on Genetic Programming (EUROGP' 04), Coimbra, Portugal, Lecture Notes in Computer Science, Vol. 3003, Springer: Berlin, pp 389-398
213. Tay JC and Ho NB (2008). Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems. Computers and Industrial Engineering 54(3): 453-473
214. Terashima-Marín H, Ross P and Valenzuela-Rendón M (1999). Evolution of constraint satisfaction strategies in examination timetabling. In: Banzhaf W, et al (eds). Genetic and Evolutionary Computation Conference, GECCO'99.Morgan Kaufmann: Orlando, Florida, pp 635-642
215. Terashima-Marín H, Zarate CJF, Ross P and Valenzuela-Rendón M (2006). A ga-based method to produce generalized hyperheuristics for the 2d-regular cutting stock problem. In: Genetic and Evolutionary Computation, GECCO 2006, ACM Press: New York, pp 591-598
216. Terashima-Marín H, Zarate CJF, Ross P and Valenzuela-Rendón M (2007). Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem. In: Genetic and Evolutionary Computation Conference (GECCO 2007), ACM: New York, pp 2182-2189
217. Terashima-Marín H, Ortiz-Bayliss JC, Ross P and Valenzuela-Rendón M (2008). Hyperheuristics for the dynamic variable ordering in constraint satisfaction problems. In: Genetic and Evolutionary Computation Conference (GECCO 2008), ACM: New York, pp 571-578
218. Terashima-Marín H, Ross P, Farias-Zarate CJ, Lopez-Camacho E and Valenzuela-Rendon M (2009). Generalized hyper-heuristics for solving regular and irregular bin packing problems. Annals of Operations Research 179(1): 369-392
219. Thabtah F and Cowling P (2008). Mining the data from a hyperheuristic approach using associative classification. Expert Systems with Applications: An International Journal 34(2): 1093-1101
220. Thompson J and Dowsland K (1996). General cooling schedules for a simulated annealing based timetabling system. In: EK Burke PR (ed). Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, Vol. 1153, Springer: Berlin, pp 345-363
221. Tsai CW, Song HJ and Chiang MC (2012). A hyper-heuristic clustering algorithm. In: International Conference on Systems, Man, and Cybernetics, IEEE: New York, pp 2839-2844
222. Uludag G, Kiraz B, Etaner Uyar A and Özcan E (2012). Heuristic selection in a multiphase hybrid approach for dynamic environments. In: De Wilde P, Coghill GM and Kononova AV (eds). Computational Intelligence (UKCI). 12th UK Workshop on, IEEE: Edinburgh, UK, pp 1-8
223. Vancroonenburg W, Wauters T and Vanden Berghe G (2010). A two phase hyper-heuristic approach for solving the eternity ii puzzle. In: Proceedings of the International Conference on Metaheuristics and Nature Inspired Computing, Djerba Island, Tunisia
224. Vázquez-Rodríguez J and Petrovic S (2010). A new dispatching rule based genetic algorithm for the multi-objective job shop problem. Journal of Heuristics 16(6): 771-793
225. Vázquez-Rodri'guez J, Petrovic S and Salhi A (2007a). A combined meta-heuristic with hyper-heuristic approach to the scheduling of the hybrid flow shop with sequence dependent setup times and uniform machines. In: Baptiste P, Kendall G, Munier-Kordon A and Sourd F (eds). Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2007). Paris, France, pp 506-513
226. Vázquez-Rodri'guez J, Petrovic S and Salhi A (2007b). An investigation of hyper-heuristic search spaces. In: Tan KC and Xu JX (eds). IEEE Congress on Evolutionary Computation (CEC 2007). IEEE: Singapore, pp 3776-3783
227. Veerapen N, Maturana J and Saubion F (2012). A dynamic island model for adaptive operator selection. In: Genetic and Evolutionary Computation (GECCO 2012), ACM: New York, pp 1277-1284
228. Vrugt J and Robinson B (2007). Improved evolutionary optimization from genetically adaptive multimethod search. Proceedings of the National Academy of Sciences 104(3): 708-711
229. Wah BW and Ieumwananonthachai A (1999). Teacher: A genetics-based system for learning and for generalizing heuristics. In: Yao X (ed). Evolutionary Computation. World Scientific Publishing Co. Pte. Ltd: Singapore, pp 124-170
230. Wah BW, Ieumwananonthachai A, Chu LC and Aizawa A (1995). Genetics-based learning of new heuristics: Rational scheduling of experiments and generalization. IEEE Transactions on Knowledge and Data Engineering 7(5): 763-785
231. Walker JD, Ochoa G, Gendreau M and Burke EK (2012). Vehicle routing and adaptive iterated local search within the hyflex hyper-heuristic framework. In: International Conference on Learning and Intelligent Optimization (LION 6), Lecture Notes in Computer Science, Vol. 7219, Springer: Berlin, pp 265-276
232. Wilson S (1995). Classifier systems based on accuracy. Evolutionary Computation 3(2): 149-175