A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 1, Issue , 2006, Pages 591-598

  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 Stock; Evolutionary Computation; Hyper heuristics; Optimization

Indexed keywords

COMPUTATIONAL METHODS; HEURISTIC METHODS; LEARNING SYSTEMS; OPTIMIZATION; PERSONNEL TRAINING; PROBLEM SOLVING;

CUTTING STOCK PROBLEMS; HYPER HEURISTICS; LEARNING PROCESS;

GENETIC ALGORITHMS;

EID: 33750228990     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144102     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 cuting 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. A. I. Hinxman. The trim-loss and assortment problems: A survey. EJOR, 5:8-18, 1980.
13. J. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
14. 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.
15. S. Jakobs. On genetic algorithms for the packing of polygons. European Journal of Operations Research, 88:165-181, 1966.
16. L. V. Kantorovich. Mathematical methods of organizing and planning production. Management Science, 6:366-422, 1960.
17. 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.
18. S. Martello and D. Vigo. Exact solution of the two-dimensional finite bin packing problem. Dipartimento di Elettronica, Informatica e Sistematica, 1998.
19. I. Rechenberg. Evolutionstrategie: Optimierung technischer systeme nach Prinzipien dier biolischen evolution. Frommann-Holzboog, Stuttgart, 1973.
20. P. Ross, J. M. 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. Proceedings of GECCO 2003, pages 1295-1306, 2003.
21. 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.
22. H. P. Schwefel. Numerical Optimization of Computer Models. Wiley, Chinchester, UK, 1981.
23. H. Terashima-Marin, E. J. Flores-Álvarez, 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.
24. H. Terashima-Marín, A. Morán-Saavedra, and P. Ross. Forming hyper-heuristics with GAs when solving 2D-regular cutting stock problems. Proceedings of the Congress on Evolutionary Computation, pages 1104-1110, 2005.
25. R. A. Wilson and F. C. Keil. The MIT. Encyclopedia of the Cognitive Science. MIT Press, Cambridge, Massachussets, 1999.