Policy matrix evolution for generation of heuristics

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 2011-2018

  Özcan, Ender ^a   Parkes, Andrew J ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Heuristics; Hyper heuristics; Index policies; Metaheuristics; Online problems

Indexed keywords

HEURISTICS; HYPER-HEURISTICS; INDEX POLICIES; META HEURISTICS; ONLINE PROBLEMS;

BINS; BIOLOGY;

MATRIX ALGEBRA;

EID: 84860389837     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001846     Document Type: Conference Paper

References (25)

1. Y. Bernstein, X. Li, V. Ciesielski, and A. Song. Multiobjective parsimony enforcement for superior generalisation performance. In G. Greenwood, editor, Proceedings of the IEEE Congress on Evolutionary Computation (CEC2004), pages 83-89. 2004.
2. E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg. Hyper-heuristics: An emerging direction in modern search technology. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 457-474. Kluwer, 2003.
3. E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, and J. R. Woodward. A classification of hyper-heuristic approaches. In M. Gendreau and J.-Y. Potvin, editors, Handbook of Metaheuristics, volume 146 of International Series in Operations Research and Management Science, pages 449-468. Springer US, 2010.
4. E. K. Burke, M. R. Hyde, and G. Kendall. Evolving bin packing heuristics with genetic programming. In Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN 2006), volume 4193 of Lecture Notes in Computer Science, pages 860-869, Reykjavik, Iceland, September 2006. (Pubitemid 44609462)
5. E. K. Burke, M. R. Hyde, G. Kendall, G. Ochoa, E. Özcan, and J. R. Woodward. Exploring hyper-heuristic methodologies with genetic programming. In J. Kacprzyk, L. C. Jain, C. L. Mumford, and L. C. Jain, editors, Computational Intelligence, volume 1 of Intelligent Systems Reference Library, pages 177-201. Springer Berlin Heidelberg, 2009.
6. 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 Proceedings of the 9th annual conference on Genetic and evolutionary computation, GECCO '07, pages 1559-1565, New York, NY, USA, 2007. ACM. (Pubitemid 47291762)
7. E. K. Burke, M. R. Hyde, G. Kendall, and J. R. Woodward. The scalability of evolved on line bin packing heuristics. In D. Srinivasan and L. Wang, editors, 2007 IEEE Congress on Evolutionary Computation, pages 2530-2537, Singapore, 25-28 Sept. 2007. IEEE Computational Intelligence Society, IEEE Press.
8. K. Chakhlevitch and P. Cowling. Hyperheuristics: Recent developments. In C. Cotta, M. Sevaux, and K. Sörensen, editors, Adaptive and Multilevel Metaheuristics, volume 136 of Studies in Computational Intelligence, pages 3-29. Springer Berlin / Heidelberg, 2008.
9. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey, pages 46-93. PWS Publishing Co., Boston, MA, USA, 1997.
10. E. G. Coffman Jr, G. Galambos, S. Martello, and D. Vigo. Bin packing approximation algorithms: Combinatorial analysis. In D.-Z. Du and P. Pardalos, editors, Handbook of Combinatorial Optimization, volume 1 of Intelligent Systems Reference Library, pages 151-207. Kluwer Academic Publishers, 1999.
11. J. Csirik and G. Woeginger. On-line packing and covering problems. In A. Fiat and G. Woeginger, editors, Online Algorithms, volume 1442 of Lecture Notes in Computer Science, pages 147-177. Springer Berlin / Heidelberg, 1998. 10.1007/BFb0029568. (Pubitemid 128123716)
12. E. Falkenauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30, 1996. 10.1007/BF00226291. (Pubitemid 126714024)
13. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.
14. J. C. Gittins. Bandit processes and dynamic allocation indices. Journal of the Royal Statistical Society. Series B (Methodological), 41(2):pp. 148-177, 1979.
15. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3(4):299-325, 1974.
16. S. Martello and P. Toth. Lower bounds and reduction procedures for the bin packing problem. Discrete Appl. Math., 28:59-70, July 1990.
17. E. Özcan, B. Bilgin, and E. E. Korkmaz. A comprehensive survey of hyperheuristics. Intelligent Data Analysis, 12(1):3-23, 2008.
18. R. Poli, W. B. Langdon, and N. F. McPhee. A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk, 2008. (With contributions by J. R. Koza).
19. W. T. Rhee and M. Talagrand. On line bin packing with items of random size. Mathematics of Operations Research, 18(2):pp. 438-445, 1993.
20. P. Ross. Hyper-heuristics. In E. K. Burke and G. Kendall, editors, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, chapter 17, pages 529-556. Springer, 2005.
21. P. Ross, S. Schulenburg, J. G. Marín-Blázquez, and E. Hart. Hyper-heurstics: learning to combine simple heuristics in bin-packing problems. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 942-948, New York NY, 2002. Morgan Kauffmann Publishers., 2002.
22. A. Scholl, R. Klein, and C. Jürgens. Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research, 24(7):627 - 645, 1997.
23. S. S. Seiden. On the online bin packing problem. Journal of the ACM, 49:640-671, September 2002.
24. S. K. Smit and A. E. Eiben. Comparing parameter tuning methods for evolutionary algorithms. In Proceedings of the Eleventh conference on Congress on Evolutionary Computation, CEC'09, pages 399-406, Piscataway, NJ, USA, 2009. IEEE Press.
25. O. Ülker, E. Korkmaz, and E. Özcan. A grouping genetic algorithm using linear linkage encoding for bin packing. In G. Rudolph, T. Jansen, S. Lucas, C. Poloni, and N. Beume, editors, Parallel Problem Solving from Nature - PPSN X, volume 5199 of Lecture Notes in Computer Science, pages 1140-1149. Springer Berlin / Heidelberg, 2008.