research-article

Evolving reusable 3d packing heuristics with genetic programming

Authors:

Edmund K. Burke,

Graham KendallAuthors Info & Claims

GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation

Pages 931 - 938

https://doi.org/10.1145/1569901.1570029

Published: 08 July 2009 Publication History

Abstract

This paper compares the quality of reusable heuristics designed by genetic programming (GP) to those designed by human programmers. The heuristics are designed for the three dimensional knapsack packing problem. Evolutionary computation has been employed many times to search for good quality solutions to such problems. However, actually designing heuristics with GP for this problem domain has never been investigated before. In contrast, the literature shows that it has taken years of experience by human analysts to design the very effective heuristic methods that currently exist.

Hyper-heuristics search a space of heuristics, rather than directly searching a solution space. GP operates as a hyper-heuristic in this paper, because it searches the space of heuristics that can be constructed from a given set of components. We show that GP can design simple, yet effective, stand-alone constructive heuristics. While these heuristics do not represent the best in the literature, the fact that they are designed by evolutionary computation, and are human competitive, provides evidence that further improvements in this GP methodology could yield heuristics superior to those designed by humans.

References

[1]

]]S. Allen, E. K. Burke, and G. Kendall. A new hybrid placement strategy for the three-dimensional strip packing problem. Technical report, University of Nottingham, Dept of Computer Science, 2009.

[2]

]]E. Bischoff and M. Ratcliff. Issues in the development of approaches to container loading. Omega, 23(4):377--390, 1995.

[3]

]]A. Bortfeldt and H. Gehring. A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research, 131(1):143--161, 2001.

[4]

]]E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, and S. Schulenburg. Hyper-heuristics: An emerging direction in modern search technology. In F. Glover and G. Kochenberger, editors, Handbook of Meta-Heuristics, pages 457--474. Kluwer, Boston, Massachusetts, 2003.

[5]

]]E. K. Burke, M. R. Hyde, and G. Kendall. Evolving bin packing heuristics with genetic programming. In LNCS 4193, Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN 2006), pages 860--869, 2006.

Digital Library

[6]

]]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 Proceedings of the 9th ACM Genetic and Evolutionary Computation Conference (GECCO 2007), pages 1559--1565, 2007.

Digital Library

[7]

]]E. K. Burke, M. R. Hyde, G. Kendall, and J. Woodward. The scalability of evolved on line bin packing heuristics. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007), pages 2530--2537, 2007.

[8]

]]E. K. Burke, G. Kendall, and E. Soubeiga. A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics, 9(6):451--470, 2003.

Digital Library

[9]

]]E. K. Burke, S. Petrovic, and R. Qu. Case-based heuristic selection for timetabling problems. J. of Scheduling, 9(2):115--132, 2006.

Digital Library

[10]

]]C. K. Chua, V. Narayanan, and J. Loh. Constraint-based spatial representation technique for the container packing problem. Integrated Manufacturing Systems, 9(1):23--33, 1998.

[11]

]]K. Dowsland, E. Soubeiga, and E. K. Burke. A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research, 179(3):759--774, 2007.

[12]

]]J. Egeblad and D. Pisinger. Heuristic approaches for the two- and three-dimensional knapsack packing problem. Computers and Operations Research, 36(4):1026--1049, 2009.

Digital Library

[13]

]]M. Eley. Solving container loading problems by block arrangement. European Journal of Operational Research, 141(2):393--409, 2002.

[14]

]]A. S. Fukunaga. Automated discovery of composite sat variable-selection heuristics. In Eighteenth national conference on Artificial intelligence, pages 641--648, Menlo Park, CA, USA, 2002.

Digital Library

[15]

]]A. S. Fukunaga. Evolving local search heuristics for SAT using genetic programming. In LNCS 3103. Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO '04), pages 483--494, Seattle, WA, USA, 2004. Springer-Verlag.

[16]

]]A. S. Fukunaga. Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation (MIT Press), 16(1):31-1, 2008.

Digital Library

[17]

]]C. D. Geiger, R. Uzsoy, and H. Aytug. Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach. Journal of Scheduling, 9(1):7--34, 2006.

Digital Library

[18]

]]W. Huang and K. He. A new heuristic algorithm for cuboids packing with no orientation constraints. Computers and Operations Research, In Press, Corrected Proof, Available online 21 September 2007.

Digital Library

[19]

]]N. Ivancic, K. Mathur, and B. Mohanty. An integer-programming based heuristic approach to the three-dimensional packing problem. Journal of Manufacturing and Operations Management, 2:268--298, 1989.

[20]

]]R. E. Keller and R. Poli. Linear genetic programming of parsimonious metaheuristics. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007), pages 4508--4515, Singapore, September 2007.

Digital Library

[21]

]]J. R. Koza. Genetic programming: on the programming of computers by means of natural selection. The MIT Press, Boston, Massachusetts, 1992.

Digital Library

[22]

]]A. Lim, B. Rodrigues, and Y. Wang. A multi-faced buildup algorithm for three-dimensional packing problems. OMEGA International Journal of Management Science, 31(6):471--481, 2003.

[23]

]]H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani. Vlsi module placement based on rectangle-packing by the sequence-pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 15(12):1518--1524, 1996.

Digital Library

[24]

]]B. K. A. Ngoi, M. L. Tay, and E. S. Chua. Applying spatial representation techniques to the container packing problem. International Journal of Production Research, 32(1):111--123, 1994.

[25]

]]D. Pisinger and J. Egeblad. Heuristic approaches for the two and three dimensional knapsack packing problems. Technical report, No.06-13. University of Copenhagen, Dept of Computer Science, 2006.

[26]

]]R. Poli. A simple but theoretically-motivated method to control bloat in genetic programming. In Genetic Programming, Proceedings of the 6th European Conference, EuroGP 2003, pages 211--223, Essex, April 2003. Springer-Verlag.

Digital Library

[27]

]]P. Ross. Hyper-heuristics. In E. K. Burke and G. Kendall, editors, Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pages 529--556. Kluwer, 2005.

Cited By

Ortiz-Bayliss JJuárez JFalcón-Cardona J(2023)Using μ Genetic Algorithms for Hyper-heuristic Development: A Preliminary Study on Bin Packing Problems2023 10th International Conference on Soft Computing & Machine Intelligence (ISCMI)10.1109/ISCMI59957.2023.10458597(54-58)Online publication date: 25-Nov-2023
https://doi.org/10.1109/ISCMI59957.2023.10458597
Tan BMa HMei YZhang M(2022)A Cooperative Coevolution Genetic Programming Hyper-Heuristics Approach for On-Line Resource Allocation in Container-Based CloudsIEEE Transactions on Cloud Computing10.1109/TCC.2020.302633810:3(1500-1514)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.3026338
Hiruta YNishihara KKoguma YFujii MNakata M(2022)Automatic Construction of Loading Algorithms With Interactive Genetic ProgrammingIEEE Access10.1109/ACCESS.2022.322554310(125167-125180)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3225543
Show More Cited By

Recommendations

Evolving human-competitive reusable 2D strip packing heuristics
GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers

This extended abstract presents preliminary work on reusable automatically generated heuristics for the 2D strip packing problem. It builds on our previous work, where the heuristics were not shown to be reusable. The best constructive heuristic for ...
A Hyper-Heuristic Using GRASP with Path-Relinking: A Case Study of the Nurse Rostering Problem

The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic ...
A genetic programming approach to the generation of hyper-heuristics for the uncapacitated examination timetabling problem
EPIA'07: Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence

Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second takes an indirect approach to the problem and examines the generation of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation

July 2009

2036 pages

ISBN:9781605583259

DOI:10.1145/1569901

General Chair:
Franz Rothlauf
University of Mainz, Germany

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 July 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO09

Sponsor:

GECCO09: Genetic and Evolutionary Computation Conference

July 8 - 12, 2009

Québec, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
352
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ortiz-Bayliss JJuárez JFalcón-Cardona J(2023)Using μ Genetic Algorithms for Hyper-heuristic Development: A Preliminary Study on Bin Packing Problems2023 10th International Conference on Soft Computing & Machine Intelligence (ISCMI)10.1109/ISCMI59957.2023.10458597(54-58)Online publication date: 25-Nov-2023
https://doi.org/10.1109/ISCMI59957.2023.10458597
Tan BMa HMei YZhang M(2022)A Cooperative Coevolution Genetic Programming Hyper-Heuristics Approach for On-Line Resource Allocation in Container-Based CloudsIEEE Transactions on Cloud Computing10.1109/TCC.2020.302633810:3(1500-1514)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.3026338
Hiruta YNishihara KKoguma YFujii MNakata M(2022)Automatic Construction of Loading Algorithms With Interactive Genetic ProgrammingIEEE Access10.1109/ACCESS.2022.322554310(125167-125180)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3225543
Kieffer EDuflo GDanoy GVarrette SBouvry P(2022)A RNN-Based Hyper-heuristic for Combinatorial ProblemsEvolutionary Computation in Combinatorial Optimization10.1007/978-3-031-04148-8_2(17-32)Online publication date: 4-Apr-2022
https://doi.org/10.1007/978-3-031-04148-8_2
Burke EGendreau MHyde MKendall GOchoa GÖzcan EQu R(2017)Hyper-heuristics: a survey of the state of the artJournal of the Operational Research Society10.1057/jors.2013.7164:12(1695-1724)Online publication date: 21-Dec-2017
https://doi.org/10.1057/jors.2013.71
Hyde MBurke EKendall G(2017)Automated code generation by local searchJournal of the Operational Research Society10.1057/jors.2012.14964:12(1725-1741)Online publication date: 21-Dec-2017
https://doi.org/10.1057/jors.2012.149
Drake JHyde MIbrahim KOzcan E(2014)A genetic programming hyper-heuristic for the multidimensional knapsack problemKybernetes10.1108/K-09-2013-020143:9/10(1500-1511)Online publication date: 3-Nov-2014
https://doi.org/10.1108/K-09-2013-0201
Sotelo-Figueroa MPuga Soberanes HCarpio JFraire Huacuja HReyes LSoria Alcaraz J(2014)Clustering Bin Packing Instances for Generating a Minimal Set of Heuristics by Using Grammatical EvolutionFuzzy Logic Augmentation of Nature-Inspired Optimization Metaheuristics10.1007/978-3-319-10960-2_10(151-162)Online publication date: 21-Sep-2014
https://doi.org/10.1007/978-3-319-10960-2_10
Ortiz-Bayliss JOzcan EParkes ATerashima-Marin H(2013)A genetic programming hyper-heuristic: Turning features into heuristics for constraint satisfaction2013 13th UK Workshop on Computational Intelligence (UKCI)10.1109/UKCI.2013.6651304(183-190)Online publication date: Sep-2013
https://doi.org/10.1109/UKCI.2013.6651304
Sosa-Ascencio ATerashima-Marin HValenzuela-Rendon M(2013)Grammar-based Genetic Programming for evolving variable ordering heuristics2013 IEEE Congress on Evolutionary Computation10.1109/CEC.2013.6557696(1154-1161)Online publication date: Jun-2013
https://doi.org/10.1109/CEC.2013.6557696
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten