A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics

IEEE Transactions on Evolutionary Computation

Volumn 14, Issue 6, 2010, Pages 942-958

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

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM NINGBO CHINA   (China)

Author keywords

2 D stock cutting; genetic programming; hyper heuristics

Indexed keywords

GENETIC ALGORITHMS; GENETIC PROGRAMMING;

BUILDING BLOCKES; CREATIVE PROCESS; GENETIC PROGRAMMING SYSTEM; HEURISTIC DESIGNS; HYPER-HEURISTICS; SOLUTION METHODS; STOCK CUTTING; STRIP PACKING PROBLEM;

HEURISTIC METHODS;

EID: 78649837181     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2010.2041061     Document Type: Article

References (63)

1. P. Ross, "Hyper-heuristics," in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, E. K. Burke and G. Kendall, Eds. Boston, MA: Kluwer, 2005, pp. 529-556.
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
3. E. K. Burke, R. S. R. Hellier, G. Kendall, and G. Whitwell, "A new bottom-left-fill heuristic algorithm for the 2-D irregular packing problem," Oper. Res., vol. 54, no. 3, pp. 587-601, 2006.
4. G. Wäscher, H. Haußner, and H. Schumann, "An improved typology of cutting and packing problems," Eur. J. Oper. Res., vol. 183, no. 3, pp. 1109-1130, 2007.
5. E. Hopper and B. C. H. Turton, "An empirical investigation of meta-heuristic and heuristic algorithms for a 2-D packing problem," Eur. J. Oper. Res., vol. 128, no. 1, pp. 34-57, 2001.
6. S. Jakobs, "On genetic algorithms for the packing of polygons," Eur. J. Oper. Res., vol. 88, no. 1, pp. 65-181, 1996.
7. D. Whitley and J. P. Watson, "Complexity theory and the no free lunch theorem," in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, E. K. Burke and G. Kendall, Eds. Boston, MA: Kluwer, 2005, pp. 317-339.
8. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.
9. D. Whitley and J. P. Watson, "Complexity and no free lunch," in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, E. K. Burke and G. Kendall, Eds. Boston, MA: Kluwer, 2005, pp. 317-339.
10. E. K. Burke and S. Petrovic, "Recent research trends in automated timetabling," Eur. J. Oper. Res., vol. 140, no. 2, pp. 266-280, 2002.
11. R. Lewis, "A survey of metaheuristic-based techniques for University Timetabling problems," OR Spectrum, vol. 30, no. 1, pp. 167-190, 2008.
12. Z. P. Lu and J. K. Hao, "Adaptive tabu search for course timetabling," Eur. J. Oper. Res., vol. 200, no. 1, pp. 235-244, 2010.
13. R. Qu, E. K. Burke, B. McCollum, L. G. T. Merlot, and S. Y. Lee, "A survey of search methodologies and automated system development for examination timetabling," J. Scheduling, vol. 12, no. 1, pp. 55-89, 2009.
14. E. K. Burke, D. G. Elliman, P. H. Ford, and R. F. Weare, "Examination timetabling in British universities-A survey," in The Practice and Theory of Automated Timetabling (Lecture Notes in Computer Science 1153), E. K. Burke and P. Ross, Eds. Berlin, Germany: Springer, 1996, pp. 76-92.
15. K. Schimmelpfeng and S. Helber, "Application of a real-world university-course timetabling model solved by integer programming," OR Spectrum, vol. 29, no. 4, pp. 783-803, 2007.
16. A. S. Fukunaga, "Automated discovery of composite SAT variable-selection heuristics," in Proc. 18th Natl. Conf. Artif. Intell., Menlo Park, CA: American Association for Artificial Intelligence, 2002, pp. 641-648.
17. E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg, "Hyper-heuristics: An emerging direction in modern search technology," in Handbook of Meta-Heuristics, F. Glover and G. Kochenberger, Eds. Boston, MA: Kluwer, 2003, pp. 457-474.
18. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Boston, MA: MIT Press, 1992.
19. J. R. Koza and R. Poli, "Genetic programming," in Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, E. K. Burke and G. Kendall, Eds. Boston, MA: Kluwer, 2005, pp. 127-164.
20. W. Banzhaf, P. Nordin, R. Keller, and F. Francone, Genetic Programming, an Introduction: On the Automatic Evolution of Computer Programs and Its Applications. San Francisco, CA: Morgan Kaufmann, 1998.
21. P. Ross, J. G. Marin-Blazquez, S. Schulenburg, and E. Hart, "Learning a procedure that can solve hard bin-packing problems: A new GA-based approach to hyperheuristics," in Proc. Genetic Evol. Comput. Conf. (GECCO), Chicago, IL, 2003, pp. 1295-1306.
22. P. Ross, S. Schulenburg, J. G. Marin-Blazquez, and E. Hart, "Hyper heuristics: Learning to combine simple heuristics in bin packing problems," in Proc. Genetic Evol. Comput. Conf. (GECCO), New York, 2002, pp. 942-948.
23. L. Han and G. Kendall, "Investigation of a tabu assisted hyper-heuristic genetic algorithm," in Proc. Congr. Evol. Comput. (CEC), vol. 3. Canberra, Australia, Dec. 2003, pp. 2230-2237.
24. E. K. Burke, S. Petrovic, and R. Qu, "Case-based heuristic selection for timetabling problems," J. Schedul., vol. 9, no. 2, pp. 115-132, 2006.
25. K. Dowsland, E. Soubeiga, and E. K. Burke, "A simulated annealing hyper-heuristic for determining shipper sizes," Eur. J. Oper. Res., vol. 179, no. 3, pp. 759-774, 2007.
26. E. K. Burke, G. Kendall, and E. Soubeiga, "A tabu-search hyper-heuristic for timetabling and rostering," J. Heurist., vol. 9, no. 6, pp. 451-470, 2003.
27. E. K. Burke, B. McCollum, A. Meisels, S. Petrovic, and R. Qu, "A graph-based hyper heuristic for timetabling problems," Eur. J. Oper. Res., vol. 176, no. 1, pp. 177-192, Jan. 2007.
28. E. Ozcan, B. Bilgin, and E. E. Korkmaz, "Hill climbers and mutational heuristics in hyperheuristics," in Proc. 9th Int. Conf. Parallel Problem Solving Nature (PPSN), LNCS 4193. Reykjavik, Iceland, Sep. 2006, pp. 202-211.
29. P. Cowling, G. Kendall, and E. Soubeiga, "A hyperheuristic approach to scheduling a sales summit," in Proc. 3rd Int. Conf. Practice Theory Automated Timetabling (PATAT), Konstanz, Germany, Aug. 2000, pp. 176-190.
30. P. Rattadilok, A. Gaw, and R. Kwan, "Distributed choice function hyper-heuristics for timetabling and scheduling," in Proc. 5th Int. Conf. Practice Theory Automated Timetabling (PATAT), LNCS 3616. 2005, pp. 51-67.
31. A. S. Fukunaga, "Evolving local search heuristics for SAT using genetic programming," in Proc. Assoc. Comput. Machinery Genetic Evol. Com-put. Conf. (GECCO), LNCS 3103. Seattle, WA: Springer-Verlag, 2004, pp. 483-494.
32. A. Fukunaga, "Automated discovery of local search heuristics for satisfiability testing," in Evol. Comput., vol. 16, no. 1, pp. 31-61, 2008.
33. M. B. Bader-El-Din and R. Poli, "Generating SAT local-search heuristics using a GP hyper-heuristic framework," in Proc. 8th Int. Conf. Artif. Evol., LNCS 4926. Oct. 2007, pp. 37-49.
34. E. K. Burke, M. R. Hyde, and G. Kendall, "Evolving bin packing heuristics with genetic programming," in Proc. 9th Int. Conf. Parallel Problem Solving Nature (PPSN), Reykjavik, Iceland, Sep. 2006, pp. 860-869.
35. E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward, "Automatic heuristic generation with genetic programming: Evolving a jack-of-all-trades or a master of one," in Proc. 9th Assoc. Comput. Machinery Genetic Evol. Comput. Conf. (GECCO), London, U.K., Jul. 2007, pp. 1559-1565.
36. E. K. Burke, M. Hyde, G. Kendall, and J. Woodward, "The scalability of evolved on line bin packing heuristics," in Proc. IEEE Congr. Evol. Comput. (CEC), Singapore, Sep. 2007, pp. 2530-2537.
37. R. E. Keller and R. Poli, "Linear genetic programming of parsimonious metaheuristics," in Proc. IEEE Congr. Evol. Comput. (CEC), Singapore, Sep. 2007, pp. 4508-4515.
38. C. D. Geiger, R. Uzsoy, and H. Aytug, "Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach," J. Schedul., vol. 9, no. 1, pp. 7-34, 2006.
39. P. Gilmore and R. Gomory, "Multistage cutting stock problems of two and more dimensions," Oper. Res., vol. 13, no. 1, pp. 94-120, 1965.
40. N. Christofides and C. Whitlock, "An algorithm for 2-D cutting problems," Oper. Res., vol. 25, no. 1, pp. 30-44, 1977.
41. J. E. Beasley, "An exact 2-D nonguillotine cutting tree search procedure," Oper. Res., vol. 33, no. 1, pp. 49-64, 1985.
42. M. Hifi and V. Zissimopoulos, "A recursive exact algorithm for weighted 2-D cutting," Eur. J. Oper. Res., vol. 91, no. 3, pp. 553-564, 1996.
43. V. D. Cung, M. Hifi, and B. Le Cun, Constrained 2-D cutting stock problems: A best-first branch-and-bound algorithm," Int. Trans. Oper. Res., vol. 7, 3, 185-210, 2000.
44. F. Clautiaux, A. Jouglet, J. Carlier, and A. Moukrim, "A new constraint programming approach for the orthogonal packing problem," Comput. Oper. Res., vol. 35, no. 3, pp. 944-959, 2008.
45. M. Kenmochi, T. Imamichi, K. Nonobe, M. Yagiura, and H. Nagamochi, "Exact algorithms for the 2-D strip packing problem with and without rotations," Eur. J. Oper. Res., vol. 198, no. 1, pp. 73-83, 2009.
46. R. Macedo, C. Alves, and J. M. V. de Carvalho, "Arc-flow model for the 2-D guillotine cutting stock problem," Comput. Oper. Res., vol. 37, no. 6, pp. 991-1001, 2010.
47. R. Alvarez-Valdes, F. Parreno, and J. M. Tamarit, "A branch and bound algorithm for the strip packing problem," OR Spectrum, vol. 31, no. 2, pp. 431-459, 2009.
48. B. S. Baker, E. G. Coffman, Jr., and R. L. Rivest, "Orthogonal packings in two dimensions." Soc. Ind. Appl. Math. J. Comput., vol. 9, no. 4, pp. 846-855, 1980.
49. B. Chazelle, "The bottom-left bin packing heuristic: An efficient implementation," IEEE Trans. Comput., vol. 32, no. 8, pp. 697-707, Aug. 1983.
50. D. J. Brown, B. S. Baker, and H. P. Katseff, "Lower bounds for online 2-D packing algorithms," Acta Inform., vol. 18, no. 2, pp. 207-226, 1982.
51. D. Zhang, Y. Kang, and A. Deng, "A new heuristic recursive algorithm for the strip rectangular packing problem," Comput. Oper. Res., vol. 33, no. 8, pp. 2209-2217, 2006.
52. F. Rinaldi and A. Franz, "A 2-D strip cutting problem with sequencing constraint," Eur. J. Oper. Res., vol. 183, no. 3, pp. 1371-1384, 2007.
53. E. K. Burke, G. Kendall, and G. Whitwell, "A new placement heuristic for the orthogonal stock-cutting problem," Oper. Res., vol. 55, no. 4, pp. 655-671, 2004.
54. E. K. Burke, G. Kendall, and G. Whitwell, "A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock cutting problem," Inst. Oper. Res. Manage. Sci. J. Comput., vol. 21, no. 3, pp. 505-516, 2009.
55. D. Liu and H. Teng, "An improved BL-algorithm for genetic algorithms of the orthogonal packing of rectangles," Eur. J. Oper. Res., vol. 112, no. 2, pp. 413-419, 1999.
56. G. Belov, G. Scheithauer, and E. A. Mukhacheva, "1-D heuristics adapted for 2-D rectangular strip packing," J. Oper. Res. Soc., vol. 59, no. 6, pp. 823-832, 2008.
57. A. Ramesh Babu and N. Ramesh Babu, "Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms," Int. J. Prod. Res., vol. 37, no. 7, pp. 1625-1643, 1999.
58. C. L. Valenzuela and P. Y. Wang, "VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions," IEEE Trans. Evol. Comput., vol. 6, no. 4, pp. 390-401, Aug. 2002.
59. K. K. Lai and J. W. M. Chan, "Developing a simulated annealing algorithm for the cutting stock problem," Comput. Ind. Eng., vol. 32, no. 1, pp. 115-127, 1997.
60. L. Faina, "An application of simulated annealing to the cutting stock problem," Eur. J. Oper. Res., vol. 114, no. 3, pp. 542-556, 1999.
61. A. Bortfeldt, "A genetic algorithm for the 2-D strip packing problem with rectangular pieces," Eur. J. Oper. Res., vol. 172, no. 3, pp. 814-837, 2006.
62. R. Alvarez-Valdes, F. Parreno, and J. M. Tamarit, "Reactive grasp for the strip-packing problem," Comput. Oper. Res., vol. 35, no. 4, pp. 1065-1083, 2008.
63. R. Poli, "A simple but theoretically-motivated method to control bloat in genetic programming," in Proc. 6th Eur. Conf. Genetic Program. (EuroGP), C. Ryan, T. Soule, M. Keijzer, E. Tsang, R. Poli, and E. Costa, Eds. Essex, U.K.: Springer-Verlag, Apr. 2003, pp. 211-223.