A genetic programming based hyper-heuristic approach for combinatorial optimisation

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 1299-1306

  Su, Nguyen ^a   Zhang, Mengjie ^a   Johnston, Mark ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Genetic programming; Hyper heuristic; Optimization

Indexed keywords

ADAPTIVE MECHANISM; HEURISTIC SELECTIONS; HYPER-HEURISTICS; HYPERHEURISTIC; NEW APPLICATIONS; OPTIMISATIONS; THREE PROBLEMS;

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; GENETIC PROGRAMMING; HEURISTIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

HEURISTIC METHODS;

EID: 84860408366     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001752     Document Type: Conference Paper

References (23)

1. A. Boite and U. W. Thonemann. Optimizing simulated annealing schedules with genetic programming. European Journal of Operational Research, 92(2):402-416, 1996.
2. E. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg. Hyper-heuristics: An emerging direction in modern search technology. In Handbook of Metaheuristics, pages 457-474, 2003.
3. E. Burke, J. Landa Silva, and S. E. Multi-objective hyper-heuristic approaches for space allocation and timetabling. Meta-heuristics: Progress as Real Problem Solvers, pages 129-158, 2005.
4. E. K. Burke, T. Curtois, M. R. Hyde, G. Kendall, G. Ochoa, S. Petrovic, J. A. V. Rodriguez, and M. Gendreau. Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms. In IEEE CEC'10: Congress on Evolutionary Computation, pages 1-8, 2010.
5. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and R. Qu. Hyper-heuristics: A survey of the state of the art. Technical Report Computer Science Technical Report No. NOTTCS-TR-SUB-0906241418-2747, School of Computer Science and Information Technology, University of Nottingham, 2010.
6. E. K. Burke, M. R. Hyde, and G. Kendall. Evolving bin packing heuristics with genetic programming. In PPSN, pages 860-869, 2006. (Pubitemid 44609462)
7. E. K. Burke, M. R. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J. R. Woodward. Exploring hyper-heuristic methodologies with genetic programming. Artificial Evolution, 1:177-201, 2009.
8. E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward. Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. In GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary commutation, pages 1559-1565, 2007. (Pubitemid 47291762)
9. E. K. Burke, M. R. Hyde, G. Kendall, and J. R. Woodward. The scalability of evolved online bin packing heuristics. In IEEE CEC '07, pages 2530-2537, 2007.
10. E. K. Burke, G. Kendall, and E. Soubeiga. A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9(6):451-470, 2003.
11. P. Cowling, G. Kendall, and E. Soubeiga. A hyperheuristic approach to scheduling a sales summit. In PATAT '00: Selected papers from, the Third International Conference on Practice and Theory of Automated Timetabling III, pages 176-190, 2000.
12. P. Cowling, G. Kendall, and E. Soubeiga. A parameter-free hyperheuristic for scheduling a sales summit. In Proceedings of the 4th Metaheuristic International Conference, MIC 2001, pages 127-131, 2001.
13. P. Cowling, G. Kendall, and E. Soubeiga. Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In EvoWorkShops. LNCS, pages 1-10. Springer, 2002.
14. A. Cuesta-Canada, L. Garrido, and H. Terashima-Marin. Building hyper-heuristics through ant colony optimization for the 2D bin packing problem. In Knowledge-Based Intelligent Information and Engineering Systems, LNCS 3684, pages 654-660, 2005. (Pubitemid 43936353)
15. K. A. Dowsland, E. Soubeiga, and E. Burke. A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation. European Journal of Operational Research, 179(3):759-774, 2007. (Pubitemid 46038588)
16. A. Fukunaga. Automated discovery of composite sat variable-selection heuristics. In Eighteenth national conference on Artificial intelligence, pages 641-648, 2002.
17. M. Hyde and G. Ochoa. Cross-domain heuristic search challenge (CHeSC), http://www.asap.cs.nott.ac.uk/chesc2011/.
18. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.
19. N. Krasnogor and J. Smith. Emergence of profitable search strategies based on a simple inheritance mechanism. In GECCO '01, pages 432-439, 2001.
20. S. Luke. Essentials of Metaheuristics Lulu, 2009. available at http://cs.gmu.edu/~sean/book/metaheuristics/.
21. H. Ramalhinho-Lourenco, O. C. Martin, and T. Stutzle. Iterated local search. In Handbook of Metaheuristics, International Series in Operations Research & Management Science, pages 321-353, 2003.
22. P. Ross, J. G. Marïn-Blâzquez, S. Schulenburg, and E. Hart. Learning a procedure that can solve hard bin-packing problems: a new ga-based approach to hyper-heuristics. In GECCO '03, pages 1295-1306, 2003.
23. J. Woodward, A. Parkes, and G. Ochoa. A mathematical formalization of hyper-heuristics, workshop on hyper-heuristics automating the heuristic design process. In 10th International Conference on Parallel Problem Solving From Nature (PPSN-08), 2008.