Comparing two models to generate hyper-heuristics for the 2d-regular bin-packing problem

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 2182-2189

  Terashima Marin, H ^a   Farias Zarate, C J ^a   Ross, P ^b   Valenzuela Rendon, M ^a  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^b EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

Author keywords

Cutting and packing problems; Evolutionary computation; Hyper heuristics; Optimization

Indexed keywords

COMPUTATION THEORY; LEARNING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

CUTTING PROBLEMS; HYPER HEURISTICS; PACKING PROBLEMS;

HEURISTIC ALGORITHMS;

EID: 34548102729     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277377     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. J. O. Berkey and P. Y. Wang. Two-dimensional finite bin packing algorithms. Journal of Operational Research Society, 38:423-429, 1987.
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. H. Dyckhoff. A topology of cutting and packing problems. European Journal of Operation Research, 44:145-159, 1990.
7. D. B. Fogel, L. A. Owens, and M. Walsh. Artificial Intelligence through Simulated Evolution. Wiley, New York, 1966.
8. M. Garey and D. Johnson. Computers and Intractability. W. H. Freeman and Company, New York, 1979.
9. D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Adison Wesley, 1989.
10. D. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis and first results. Complex Systems, pages pp. 93-130, 1989.
11. B. L. Golden. Approaches to the cutting stock problem. AIIE Transactions, 8:256-274, 1976.
12. J. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
13. 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.
14. S. Jakobs. On genetic algorithms for the packing of polygons. European Journal of Operations Research, 88:165-181, 1966.
15. L. V. Kantorovich. Mathematical methods of organizing and planning production. Management Science, 6:366-422, 1960.
16. 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.
17. S. Martello and D. Vigo. Exact solution of the two-dimensional finite bin packing problem. Dipartimento di Elettronica, Informatica e Sistematica, 1998.
18. I. Rechenberg. Evolutionstrategie: Optimierung technischer systeme nach prinzipien dier biolischen evolution. Frommann-Holzboog, Stuttgart, 1973.
19. 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.
20. H. P. Schwefel. Numerical Optimization of Computer Models. Wiley, Chinchester, UK, 1981.
21. H. Terashima-Marín, C. J. Farías-Zárate, P. Ross, and M. Valenzuela-Rendón. A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem. Proceedings of the Genetic and Evolutionary Computation Conference 2006, pages 591-598, 2006.
22. H. Terashima-Marín, E. J. Flores-Alvarez, and P. Ross. Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems. Proceedings of the Genetic and Evolutionary Computation Conference 2005, pages 637-643, 2005.
23. R. A. Wilson and F. C. Keil. The MIT Encyclopedia of the Cognitive Science. MIT Press, Cambridge, Massachussets, 1999.
24. S. W. Wilson. Generalization in the XCS classifier system. Evolutionary Computation, 1998.
25. G. Wäscher, H. Haussner, and H. Schumann. An improved typology of cutting and packing problems. European Journal of Operation Research, 171, 2006.