Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems

作者: H. Terashima-Marín , E. J. Flores-Álvarez , P. Ross

DOI: 10.1145/1068009.1068115

关键词:

摘要: This paper presents a method for combining concepts of Hyper-heuristics and Learning Classifier Systems solving 2D Cutting Stock Problems. The idea behind is to discover some combination straightforward heuristics solve wide range problems. To be worthwhile, such should outperform the single heuristics. In this paper, Hyper-heuristic formed using XCS-type System which learns solution procedure when individual XCS evolves behavior model determines possible actions (selection placement heuristics) given states problem. When tested with collection different problems, finds very competitive results most cases. testebed composed problems used in other similar studies literature. Some additional instances testbed were randomly generated.

参考文章(26)
B. C. H. Turton, E. Hopper, An Empirical Study of meta-Heuristics Applied to 2D Rectangular Bin Packing - Part II. Studia Informatica Universalis. ,vol. 2, pp. 77- 92 ,(2002)
Agoston E. Eiben, J. E. Smith, Introduction to evolutionary computing ,(2003)
Robert A Wilson, FG Keil, Manfred Fahle, The MIT encyclopedia of the cognitive sciences MIT Press. ,(1999)
Wolfgang Banzhaf, Robert E. Keller, Peter Nordin, Genetic Programming: An Introduction ,(1997)
Emma Hart, Sonia Schulenburg, Peter Ross, Javier G. Marín-Bläzquez, Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems genetic and evolutionary computation conference. pp. 942- 948 ,(2002)
C.H Cheng, B.R Feiring, T.C.E Cheng, The cutting stock problem — a survey International Journal of Production Economics. ,vol. 36, pp. 291- 305 ,(1994) , 10.1016/0925-5273(94)00045-X
Harald Dyckhoff, A typology of cutting and packing problems European Journal of Operational Research. ,vol. 44, pp. 145- 159 ,(1990) , 10.1016/0377-2217(90)90350-K