Automating the packing heuristic design process with genetic programming

Evolutionary Computation

Volumn 20, Issue 1, 2012, Pages 63-89

  Burke, Edmund K ^a   Hyde, Matthew R ^a   Kendall, Graham ^a   Woodward, John ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM NINGBO CHINA   (China)

Author keywords

Cutting and packing; Evolutionary design; Genetic algorithms; Genetic programming; Hyper heuristics

Indexed keywords

DESIGN; GENETIC ALGORITHMS; GENETIC PROGRAMMING; HEURISTIC PROGRAMMING; PROBLEM SOLVING;

BIN PACKING PROBLEM; CUTTING AND PACKING; DESIGN HEURISTICS; EVOLUTIONARY DESIGN; GENETIC PROGRAMMING SYSTEM; HYPER-HEURISTICS; PACKING ALGORITHMS; THREE-DIMENSIONAL BIN PACKINGS;

HEURISTIC METHODS;

ALGORITHM; ARTICLE; COMPUTER AIDED DESIGN; COMPUTER PROGRAM; COMPUTER SIMULATION; THEORETICAL MODEL;

ALGORITHMS; COMPUTER SIMULATION; COMPUTER-AIDED DESIGN; MODELS, THEORETICAL; SOFTWARE;

EID: 84857560528     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00044     Document Type: Article

References (72)

1. Alvarez-Valdes, R., Parreno, F., and Tamarit, J. M. (2009). A branch and bound algorithm for the strip packing problem. Operations Research Spectrum, 31(2):431-459.
2. Baker, B. S., Coffman, E. G., and Rivest, R. L. (1980). Orthogonal packings in two dimensions. SIAM Journal on Computing, 9(4):846-855.
3. Banzhaf, W., Nordin, P., Keller, R., and Francone, F. (1998). Genetic programming; An introduction: On the automatic evolution of computer programs and its applications. San Mateo, CA: Morgan Kaufmann.
4. Beasley, J. E. (1985). An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 33(1):49-64.
5. Bengtsson, B. E. (1982). Packing rectangular pieces-A heuristic approach. The Computer Journal, 25(3):353-357.
6. Bischoff, E., and Ratcliff, M. (1995). Issues in the development of approaches to container loading. Omega, 23(4):377-390.
7. Bortfeldt, A., and Gehring, H. (2001). A hybrid genetic algorithm for the container loading problem. European Journal of Operations Research, 131(1):143-161.
8. Bortfeldt, A., Gehring, H., and Mack, D. (2003). A parallel TABU search algorithm for solving the container loading problem. Parallel Computing, 29(5):641-662.
9. Burke, E., Kendall, G., and Whitwell, G. (2004). A new placement heuristic for the orthogonal stock-cutting problem. Operations Research, 55(4):655-671.
10. Burke, E., Kendall, G., and Whitwell, G. (2009). A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem. INFORMS Journal on Computing, 21(3):505-516.
11. Burke, E. K., Hart, E., Kendall, G., Newall, J., Ross, P., and Schulenburg, S. (2003). Hyperheuristics: An emerging direction in modern search technology. In F. Glover and G. Kochenberger (Eds.), Handbook of meta-heuristics (pp. 457-474). Dordrecht, The Netherlands: Kluwer.
12. Burke, E. K., Hellier, R. S. R., Kendall, G., and Whitwell, G. (2006). A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Operations Research, 54(3):587-601.
13. Burke, E. K., Hyde, M., and Kendall, G. (2010). Providing a memory mechanism to enhance the evolutionary design of heuristics. In Proceedings of the IEEE World Congress on Computational Intelligence (WCCI'10), pp. 3883-3890.
14. Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., and Woodward, J. (2009). Exploring hyper-heuristic methodologies with genetic programming. In C. Mumford and L. Jain (Eds.), Computational intelligence: Collaboration, fusion and emergence (pp. 177-201). Berlin: Springer.
15. Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., andWoodward, J. (2010). Aclassification of hyper-heuristics approaches. In M. Gendreau and J. Potvin (Eds.), Handbook of metaheuristics, 2nd ed. (pp. 449-468). Berlin: Springer.
16. Burke, E. K., Hyde, M. R., and Kendall, G. (2006). Evolving bin packing heuristics with genetic programming. In T. Runarsson, H.-G. Beyer, E. Burke, J. Merelo-Guervos, D. Whitley, and X. Yao (Eds.), Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN 2006). Lecture Notes in Computer Science, Vol. 4193 (pp. 860-869). Berlin: Springer-Verlag.
17. Burke, E. K., Hyde, M. R., Kendall, G., andWoodward, J. (2007a). Automatic heuristic generation with genetic programming: Evolving a jack-of-all-trades or amaster of one. In Proceedings of the 9th ACM Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 1559-1565.
18. Burke, E. K., Hyde, M. R., Kendall, G., and Woodward, J. (2007b). The scalability of evolved on line bin packing heuristics. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007), pp. 2530-2537.
19. Burke, E. K., Hyde, M. R., Kendall, G., andWoodward, J. (2010). A genetic programming hyperheuristic approach for evolving two dimensional strip packing heuristics. IEEE Transactions on Evolutionary Computation, 14(6):942-958.
20. Burke, E. K., Kendall, G., and Soubeiga, E. (2003). A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics, 9(6):451-470.
21. Burke, E. K., Petrovic, S., and Qu, R. (2006). Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9(2):115-132.
22. Christofides, N., and Whitlock, C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25(1):30-44.
23. Chua, C. K., Narayanan, V., and Loh, J. (1998). Constraint-based spatial representation technique for the container packing problem. Integrated Manufacturing Systems, 9(1):23-33.
24. Clautiaux, F., Jouglet, A., Carlier, J., and Moukrim, A. (2008). A new constraint programming approach for the orthogonal packing problem. Computers and Operations Research, 35(3):944-959.
25. Coffman, E. G., Jr., Courcoubetis, C., Garey, M., Johnson, D. S., Shor, P. W., Weber, R. R., and Yannakakis, M. (2000). Bin packing with discrete item sizes, Part I: Perfect packing theorems and the average case behavior of optimal packings. SIAM Journal on Discrete Mathematics, 13:384-402.
26. Coffman, E. G., Jr., Galambos, G., Martello, S., and Vigo, D. (1998). Bin packing approximation algorithms: Combinatorial analysis. In D. Z. Du and P. M. Pardalos (Eds.), Handbook of combinatorial optimization. Dordrecht, The Netherlands: Kluwer.
27. Cuesta-Canada, A., Garrido, L., and Terashima-Marin, H. (2005). Building hyper-heuristics through ant colony optimization for the 2D bin packing problem. In Proceeding of the 9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES'05). Lecture Notes in Computer Science, Vol. 3684 (pp. 654-660). Berlin: Springer-Verlag.
28. Dowsland, K., Soubeiga, E., and Burke, E. K. (2007). A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operations Research, 179(3):759-774.
29. Egeblad, J., and Pisinger, D. (2009). Heuristic approaches for the two-and three-dimensional knapsack packing problem. Computational and Operations Research, 36(4):1026-1049.
30. Eley, M. (2002). Solving container loading problems by block arrangement. European Journal of Operations Research, 141(2):393-409.
31. Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30.
32. Falkenauer, E., and Delchambre, A. (1992). Agenetic algorithm for bin packing and line balancing. In Proceedings of the IEEE 1992 International Conference on Robotics and Automation, pp. 1186-1192.
33. Fukunaga, A. S. (2002). Automated discovery of composite SAT variable-selection heuristics. In Proceedings of Eighteenth National Conference on Artificial Intelligence, pp. 641-648.
34. Fukunaga, A. S. (2004). Evolving local search heuristics for SAT using genetic programming. In K. Deb et al. (Ed.), Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO '04). Lecture Notes in Computer Science, Vol. 3103 (pp. 483-494). Berlin: Springer-Verlag.
35. Fukunaga, A. S. (2008). Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation, 16(1):31-61.
36. Geiger, C. D., Uzsoy, R., and Aytug, H. (2006). Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. Journal of Scheduling, 9(1):7-34.
37. Gilmore, P., and Gomory, R. (1961). A linear programming approach to the cutting-stock problem. Operations Research, 9(6):849-859.
38. Hadjiconstantinou, E., and Iori, M. (2007). Ahybrid genetic algorithm for the two-dimensional single large object placement problem. European Journal of Operations Research, 183(3):1150-1166.
39. Hopper, E., and Turton, B. C. H. (2001). An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operations Research, 128(1):34-57.
40. Huang, W., and He, K. (2009). A new heuristic algorithm for cuboids packing with no orientation constraints. Computers and Operations Research, 36(2):425-432.
41. Hwang, S. M., Kao, C. Y., and Horng, J. T. (1994). On solving rectangle bin packing problems using genetic algorithms. In Proceedings of the 1994 IEEE International Conference on Systems, Man, and Cybernetics, Vol. 2, pp. 1583-1590.
42. Ivancic, N., Mathur, K., and Mohanty, B. (1989). An integer-programming based heuristic approach to the three-dimensional packing problem. Journal ofManufacturing and Operations Management, 2:268-298.
43. Johnson, D., Demers, A., Ullman, J., Garey, M., and Graham, R. (1974). Worst-case performance bounds for simple one-dimensional packaging algorithms. SIAM Journal on Computing, 3(4):299-325.
44. Keller, R. E., and Poli, R. (2007). Linear genetic programming of parsimonious metaheuristics. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007), pp. 4508-4515.
45. Kenmochi, M., Imamichi, T., Nonobe, K., Yagiura, M., and Nagamochi, H. (2009). Exact algorithms for the two-dimensional strip packing problem with and without rotations. European Journal of Operational Research, 198(1):73-83.
46. Kenyon, C. (1996). Best-fit bin-packing with random order. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 359-364.
47. Koza, J. R. (1992). Genetic programming: On the programming of computers by means of natural selection. Cambridge, MA: MIT Press.
48. Koza, J. R., and Poli, R. (2005). Genetic programming. In E. K. Burke and G. Kendall (Eds.), Search methodologies: Introductory tutorials in optimization and decision support techniques (pp. 127-164). Dordrecht, The Netherlands: Kluwer.
49. Lagus, K., Karanta, I., and Yla-Jaaski, J. (1996). Paginating the generalized newspaper, A comparison of simulated annealing and a heuristic method. In Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN '96), pp. 549-603.
50. Lim, A., Rodrigues, B., and Wang, Y. (2003). A multi-faced buildup algorithm for threedimensional packing problems. OMEGA International Journal of Management Science, 31(6):471-481.
51. Lim, A., and Zhang, X. (2005). The container loading problem. In Proceedings of the 2005 ACM Symposium on Applied Computing (SAC'05), pp. 913-917.
52. Macedo, R., Alves, C., and Valerio de Carvalho, J. M. (2010). Arc-flow model for the two-dimensional guillotine cutting stock problem. Computers and Operations Research, 37(6):991-1001.
53. Martello, S., and Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. New York: JohnWiley.
54. Martello, S., and Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44(3):388-399.
55. Ngoi, B. K. A., Tay, M. L., and Chua, E. S. (1994). Applying spatial representation techniques to the container packing problem. International Journal of Production Research, 32(1):111-123.
56. O'Neill, M., Cleary, R., and Nikolov, N. (2004). Solving knapsack problems with attribute grammars. In Proceedings of the Third Grammatical Evolution Workshop (GEWS'04).
57. Rhee, W. T., and Talagrand, M. (1993). On line bin packing with items of random size. Mathematics Operations Research, 18:438-445.
58. Richey, M. B. (1991). Improved bounds for harmonic-based bin packing algorithms. Discrete Applied Mathematics, 34:203-227.
59. Ross, P. (2005). Hyper-heuristics. In E. K. Burke and G. Kendall (Eds.), Search methodologies: Introductory tutorials in optimization and decision support techniques (pp. 529-556). Dordrecht, The Netherlands: Kluwer.
60. Ross, P., Marin-Blazquez, J. G., Schulenburg, S., and Hart, E. (2003). Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyperheurstics. In Proceedings of the Genetic and Evolutionary Computation Conference 2003 (GECCO '03), pp. 1295-1306.
61. Ross, P., Schulenburg, S., Marin-Blazquez, J. G., and Hart, E. (2002). Hyper heuristics: Learning to combine simple heuristics in bin packing problems. In Proceedings of the Genetic and Evolutionary Computation Conference 2002 (GECCO '02).
62. Schneider, W. (1988). Trim-loss minimization in a crepe-rubber mill; Optimal solution versus heuristic in the 2 (3)-dimensional case. European Journal of Operations Research, 34(3):249-412.
63. Scholl, A., Klein, R., and Jurgens, C. (1997). Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computer and Operations Research, 24(7):627-645.
64. Schwerin, P., and Wascher, G. (1997). The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP. International Transactions in Operations Research, 4(5):377-389.
65. Seiden, S., Van Stee, R., and Epstein, L. (2003). New bounds for variable-sized online bin packing. SIAM Journal on Computing, 32(2):455-469.
66. Terashima-Marin, H., Flores-Alvarez, E. J., and Ross, P. (2005). Hyper-heuristics and classifier systems for solving 2D-regular cutting stock problems. In Proceeedings of the ACM Genetic and Evolutionary Computation Conference (GECCO'05), pp. 637-643.
67. Terashima-Marin, H., Ross, P., Farias-Zarate, C. J., Lopez-Camacho, and Valenzuela-Rendon (2008). Generalized hyper-heuristics for solving 2D regular and irregular packing problems. Annals of Operations Research, 1(10): 1-10.
68. Terashima-Marin, H., Zarate, C. J. F., Ross, P., and Valenzuela-Rendon, M. (2006). A GA-based method to produce generalized hyper-heuristics for the 2D-regular cutting stock problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'06), pp. 591-598.
69. Terashima-Marin, H., Zarate, C. J. F., Ross, P., and Valenzuela-Rendon, M. (2007). Comparing two models to generate hyper-heuristics for the 2D-regular bin-packing problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'07), pp. 2182-2189.
70. Vasko, F. J., Wolf, F. E., and Stott, K. L. (1989). A practical solution to a fuzzy two-dimensional cutting stock problem. Fuzzy Sets and Systems, 29(3):259-275.
71. Yao, A. C.-C. (1980). New algorithms for bin packing. Journal of the ACM, 27(2):207-227.
72. Yue, M. (1991). A simple proof of the inequality ff d(l) ≤ 11/9opt (l) + 1, for all l for the FFD bin-packing algorithm. Acta Mathematicae Applicatae Sinica (English Series), 7(4):321-331.