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

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 637-643

  Terashima Marin H ^a   Flores Alvarez E J ^a   Ross, P ^b  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^b EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

Author keywords

Classifier Systems; Cutting Stock; Evolutionary Computation; Hyper heuristics; Optimization

Indexed keywords

EVOLUTIONARY ALGORITHMS; HEURISTIC PROGRAMMING; LEARNING ALGORITHMS; OPTIMIZATION;

CLASSIFIER SYSTEMS; CUTTING STOCK; HYPER-HEURISTICS;

PROBLEM SOLVING;

EID: 32444447039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068115     Document Type: Conference Paper

References (25)

1. W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone. Genetic programming: An Introduction, Morgan Kaufmann Publishers, Inc, London, 1998.
2. J. E. Beasley. Beasley operations research library. Collection of problems for 2D packing and cutting, 2003.
3. L. Bull. Applications of Learning Classifier Systems. Springer, Berlin, 2004.
4. E. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg. Hyper-heuristics: An emerging direction in modern research technolology. In Handbook of Metaheuristics, pages 457-474. Kluwer Academic Publishers, 2003.
5. C. H. Cheng, B. R. Fiering, and T. C. Chang. The cutting stock problem, a survey. International Journal of Production Economics, 36:291-305, 1994.
6. L. Davis. Handbook of Genetic Algorithms. Van Nostrtand Reinhold, New York, 1991.
7. H. Dyckhoff. A topology of cuting and packing problems. European Journal of Operation Research, 44:145-159, 1990.
8. A. E. Eiben and J. E. Smith. Introduction to Evolutionary Computing. Springer Verlag, Berlin, 2003.
9. D. B. Fogel, L. A. Owens, and M. Walsh. Artificial Intelligence through Simulated Evolution. Wiley, New York, 1966.
10. M. Garey and D. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, 1979.
11. D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Adison Wesley, 1989.
12. B. L. Golden. Approaches to the cutting stock problem. AIIE Transactions, 8:256-274, 1976.
13. A. I. Hinxman. The trim-loss and assortment problems: A survey. EJOR, 5:8-18, 1980.
14. J. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
15. E. Hopper and B. C. Turton. An empirical study of meta-heuristics applied to 2d rectangular bin packing. Studia Informatica Universalis, pages 77-106, 2001.
16. S. Jakobs. On genetic algorithms for the packing of polygons. European Journal of Operations Research, 88:165-181, 1966.
17. L. V. Kantorovich. Mathematical methods of organizing and planning production. Management Science, 6:366-422, 1960.
18. D. Liu and H. Teng. An improved bl-algorithm for genetic algorithm of the orthogonal packing of rectangle. European Journal of Operations Research, 112:413-419, 1999.
19. S. Martello and D. Vigo. Exact solution of the two-dimensional finite bin packing problem. Dipartimento di Elettronica, Informatica e Sistematica, 1998.
20. M. Mitchell. An Introduction to Genetic Algorithms. MIT Press, Cambridge, Massachussets, 1996.
21. I. Rechenberg. Evolutionstrategie: Optimierung technischer systeme nach prinzipien dier biolischen evolution. Frommann-Holzboog, Stuttgart, 1973.
22. P. Ross, S. Schulenburg, J. M. Blázquez, and E. Hart. Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. Proceedings of GECCO 2002, pages 942-948, 2002.
23. H. P. Schwefel. Numerical Optimization of Computer Models. Wiley, Chinchester, UK, 1981.
24. R. A. Wilson and F. C. Keil. The MIT Encyclopedia of the Cognitive Science. MIT Press, Cambridge, Massachussets, 1999.
25. S. W. Wilson. Classifier fitness based on accuracy. Evolutionary Computation, pages 149-175, 1995.