Cowling, P., Kendall, G., Han, L. (2002) An Investigation of a Hyperheuristic Genetic Algorithm Applied to a Trainer Scheduling Problem. In proceedings of the 2002 Congress on Evolutionary Computation, Vol. 2, 12-17 May 2002, Honolulu, pp. 1185 - 1190, doi:10.1109/CEC.2002.1004411.
Drake, J.H., Hyde, M., Ibrahim, K., Ozcan, E. (2014) A Genetic Programming Hyper-Heuristic for the Multidimensional Knapsack Problem. Kybernetes, Vol. 43, Issue 9/10, pp.1500 - 1511.
Drake, J.H., Killis, N., Ozcan, E. (2013)Generation of vns components with grammatical evolution for vehicle routing. In: Proceedings of the 16th European Conference on Genetic Programming (EuroGP ’13), pp. 25–36.
Fukunaga, A.S.(2008) Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation 16(1), 31–61.
Han, L., Kendall, G. (2003) Guided Operators for a Hyper-Heuristic Genetic Algorithm. AI 2003: Advances in Artificial Intelligence, Lecture Notes in Computer Science Volume 2903, 2003, pp. 807-820.
Hyde, M. (2010) A Genetic Programming Hyper-Heuristic Approach to Automated Packing. PhD thesis, School of Computer Science, University of Nottingham, UK.
Keller, R.E., Poli, R. (2008) Self-adaptive hyper-heuristic and greedy search. In: Proceedings of 2008 IEEEWorld Congress on Computational Intelligence (WCCI ’08), pp. 3801–3801.
Lopez-Camacho, E., Terashima-Marin, H., Ross, P., Ochoa, G. (2014) A Unified Hyper-Heuristic Framework for Solving Bin Packing Problems. Expert Systems with Applications, Vol. 41, pp. 6876-6889.
Nguyen, S., Zhang, M., Johnston, M. A Genetic Programming Based Hyper-Heuristic
for Combinatorial Optimization. In proceedings of the 2011 Annual Conference on
Genetic and Evolutionary Computation (GECCO 2011), pp. 1299-1306.
Ochoa, G., Qu, R., Burke, E.K. (2009) Analyzing the Landscape of Graph Based Hyper-Heuristics for Timetabling Problems. In proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO '09), 341-348.
Ozcan, E., Parkes, A. (2011) Policy matrix evolution for generation of heuristics. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, pp. 2011–2018.
Pillay N. (2009) Evolving Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem, in proceedings of the Multidisciplinary International Conference on Scheduling 2009 (MISTA 2009), Dublin, August 2009, 409-422.
Pillay, N. (2010) Evolving Hyper-Heuristics for a Highly Constrained Examination Timetabling Problem, in Proceedings of PATAT 2010, Belfast, UK, August 2010, 336-346.
Pillay, N. (2011) A Hyper-Heuristic Approach to Solving School Timetabling Problems, in Proceedings of MISTA (2011, Phoenix, Arizona, August 2011, 628-632.
Pillay, N. (2011) Evolving Heuristics for the School Timetabling Problem, in Proceedings of the 2011 IEEE Conference on Intelligent Computing and Intelligent Systems (ICIS 2011), Guangzhou, China, November 2011, Vol. 3, 281-286, IEEE Press.
Pillay, N. (2012) A Study of Evolutionary Algorithm Selection Hyper-Heuristics for the One-Dimensional Bin Packing Problem, South African Computer Journal, No. 48, 31-40.
Pillay, N. (2012) Evolving Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem, Journal of the Operational Research Society, 63, 47-58.
Pillay, N. (2013) A Comparative Study of Hyper-Heuristics for Solving the School Timetabling Problem, in the proceedings of SAICSIT 2013, October 2013, South Africa, 278-285, ACM Press.
Pillay, N. (2014) A Review of Hyper-Heuristics for Educational Timetabling. Annals of Operations Research, August 2014, doi: :10.1007/s10479-014-1688-1.
Pillay, N. (2016) Evolving Construction Heuristics for the Curriculum Based University Course Timetabling Problem. Proceedings of the IEEE 2016 Congress on Evolutionary Computation(CEC 2016), pp. 4437-4443, IEEE.
Pillay N., Banzhaf W. (2007) A Genetic Programming Approach to the Generation of Hyper Heuristics for the Uncapacitated Examination Timetabling Problem, in Neves et al. (eds.), Progress in Artificial Intelligence, Lecture Notes in Artificial Intelligence, Vol. 4874, 223 234, Springer, 2007.
Pillay N., Banzhaf W. (2009) A Study of Heuristic Combinations for Hyper Heuristic Systems for the Uncapacitated Examination Timetabling Problem, European Journal of Operational Research, Vol. 197, September 2009, 482-491. Poli, R. (2008) Some Ideas About No-Free Lunch for Hyper-Heuristics. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.1971
Poli, R., Graff, M. (2009) There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists. Proceedings of the 12th European Conference on Genetic Programming (EuroGP '09), 195-207.
Qu, R., Burke, E.K. (2005) Analysing the High Level Heuristics within a Graph Based Hyper-Heuristic (Computer Science Technical Report No. NOTTCS-TR-2005-3). School of Computer Science and Information, University of Nottingham.
Ross, P., Marin-Blazquez, J., Hart, E.: Hyper-heuristics applied to class and exam timetabling problems. In: Proceedings of the IEEE congress of evolutionary computation CEC ’04, pp.1691–1698 (2004)
Ross, P., Marn-Blazquez, J.G., Schulenburg, S., Hart, E.: Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics. In: Lecture Notesi n Computer Science - GECCO 2003, vol. 2724, pp. 1295–1306. Springer (2003)
Ross, P., Schulenburg, S., Marin-Blazquez, J.G., Hart, E.: Hyper-heuristics: Learning to combine simple heuristics in bin-packing problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’02), pp. 942–948. Morgan Kaufman Publishers (2002)
Ross, P., Marin-Blazquez, J., Hart, E.: Hyper-heuristics applied to class and exam timetabling problems. In: Proceedings of the IEEE congress of evolutionary computation CEC ’04, pp.1691–1698 (2004)
Ross, P., Marn-Blazquez, J.G., Schulenburg, S., Hart, E.: Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics. In: Lecture Notesi n Computer Science - GECCO 2003, vol. 2724, pp. 1295–1306. Springer (2003)
Ross, P., Schulenburg, S., Marin-Blazquez, J.G., Hart, E.: Hyper-heuristics: Learning to combine simple heuristics in bin-packing problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’02), pp. 942–948. Morgan Kaufman Publishers (2002)
Ross, P., Marin-Blazquez, J., Hart, E. (2004) Hyper-heuristics applied to class and exam timetabling problems. In: Proceedings of the IEEE congress of evolutionary computation CEC ’04, pp.1691–1698.
Ross, P., Marn-Blazquez, J.G., Schulenburg, S., Hart, E.(2003) Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics. In: Lecture Notes in Computer Science - GECCO 2003, vol. 2724, pp. 1295–1306.
Ross, P., Schulenburg, S., Marin-Blazquez, J.G., Hart, E. (2002) Hyper-heuristics: Learning to combine simple heuristics in bin-packing problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’02), pp. 942–948. Morgan Kaufman Publishers
Ryser-Welsh, P., Miller, J.F., Asta, S. (2015) Generating Human-readable
Algorithms for the Travelling Salesman Problem using Hyper-Heuristics. In
proceedings of the 2015 Annual Conference on Genetic and Evolutionary
Computation(GECCO 2015) pp. 1067-1074.
Ryser-Welsh, P., Miller, J.F., Asta, S. (2015) Generating Human-readable Algorithms for the Travelling Salesman Problem using Hyper-Heuristics. In proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation(GECCO 2015) pp. 1067-1074.
Ryser-Welsh, P., Miller, J.F., Swan, J., Tefzer, M.A. (2016) Iterative Cartesian Genetic Programming: Creating General Algorithms for Solving Travelling Salesman Problems. In EuroGP 2016, LNCS, Vol. 9594, pp. 294-310.
Sabar, N.R., Ayob, M., Kendall, G., Qu, R. (2013) Grammatical Evolution Hyper-heuristic for Combinatorial Optimization problems. IEEE Transactions of Evolutionary Computation, Vol. 17, No. 6, pp. 840-861.
Segredo, E., Segura, C., Leon, C. (2012) Analysing the Adaptation Level of Parallel Hyperheuristics Applied to Mono-objective Optimisation Problems. Nature Inspired Cooperative Strategies for Optimization (NICSO 2011), Studies in Computational Intelligence Volume 387, 169-182.
Segura, C., Miranda, G., Leon, C. (2011) Parallel Hyperheuristics for the Frequency Assignment Problems. Memetic Computing, 3(1), 33-49.
Sim, K., Hart, E. (2013) Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model. In: Proceedings of the 5th Annual Conference on Genetic and Evolutionary Computation(GECCO’13), pp. 1549–1556. ACM
Sim, K., Hart, E. (2016) A combined generative and selective hyper-heuristic for the vehicle routing problem. In: Proceedings of the 21st Annual Conference on Genetic and Evolutionary Computation (GECCO’16), pp. 1093–1100.
Sosa-Ascencio, A., Ochoa, G., Terashima-Marin, H., Conant-Pablos, S.E. (2015) Grammar-based generation of variable-selection heuristics for constraint satisfaction problems. Genetic Programming and Evolvable Machines 17(2), 119–144.
Sotelo-Figueroa, M.A., Soberanes, H.J. P., Carpio, J.M. (2013) Evolving and Reusing Bin Packing Heuristic through Grammatical Differential Evolution. In proceedings of the 2013 World Congress on Nature and Biologically Inspired Computing, 12-14 August 2014, Fargo, pp.92-98.
Terashima-Marın, H., Ross, P., Lopez-Camacho, E., Valenzuela-Rend´on, M. (2010) Generalized hyper-heuristics for solving 2d regular and irregular packing problems. Annals of Operations Research 179, 369–392.
Terashima-Marin, H., Zarate, C.F., Ross, P., Valenzuela-Rendon, M. (2006) A ga-based method toproduce generalized hyper-heuristics for the 2d-regular cutting stock problem. In: Proceedings of the 8th Annual Conference on Genetic Programming and Evolutionary Algorithms, pp. 591–598. ACM.
Terashima-Marin, H., Ortiz-Bayliss, J., Ross, P., Valenzuela-Rendon, M. (2008) Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problem. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (GECCO ’08), pp. 571–578. ACM.
Terashima-Marın, H., Ross, P., Lopez-Camacho, E., Valenzuela-Rend´on, M. (2010) Generalized hyper-heuristics for solving 2d regular and irregular packing problems. Annals of Operations Research 179, 369–392.
Urra, E., Cabrera-Paniagua, D., Cubillos, C. (2014) Towards a Distributed Hyperheuristic Deploy Architecture. Proceedings of Proceedings of the 7th Euro American Conference on Telematics and Information Systems (EAIS '14), Article no. 31, April 02 - 04 2014, Valparaiso, Chile.
Van Onsem, W., Demoen, B. (2013) ParHyFlex:A Framework for Parallel Hyper-Heuristics. BNAIC 2013: Proceedings of the 25th Benelux Conference on Artificial Intelligence, Delft, The Netherlands, November 7-8.
Vazquez-Rodrıguez, J.A., Petrovic, S.: A new dispatching rule based genetic algorithm forthe multi-objective job shop problem for the multi-objective job shop problem. Journal ofHeuristics 16, 771–793 (2010)