Skip to main content
SpringerLink
Log in

A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

This paper is a review of the approachesdeveloped to solve 2D packing problems withmeta-heuristic algorithms. As packing tasks arecombinatorial problems with very large searchspaces, the recent literature encourages theuse of meta-heuristic search methods, inparticular genetic algorithms. The objective ofthis paper is to present and categorise thesolution approaches in the literature for 2Dregular and irregular strip packing problems.The focus is hereby on the analysis of themethods involving genetic algorithms. Anoverview of the methods applying othermeta-heuristic algorithms including simulatedannealing, tabu search, and artificial neuralnetworks is also given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adamowicz, M. & Albano, A. (1976). Nesting two-dimensional shapes in rectangular modules. Computer Aided Design 8: 27-33.

    Google Scholar 

  • Albano, A. & Sappupo, G. (1980). Optimal Allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Transactions on Systems, Man and Cybernetics SMC 10: 242-248.

    Google Scholar 

  • András, P., András, A. & Zsuzsa, S. (1996). A genetic solution for the cutting stock problem. In Proceedings of the First On-line Workshop on Soft Computing, 87-92. Nagoya University.

  • Blazewicz, J., Hawryluk, P. & Walkowiak, R. (1993). Using a tabu search approach for solving the two-dimensional irregular cutting problem. Annals of Operations Research 41: 313-327.

    Google Scholar 

  • Bounsaythip, C., Maouche, S. & Neus, M. (1995). Evolutionary search techniques application in automated lay-planning optimization problem. In Proceedings of the IEEE Conference on SMC, 4497-4502.

  • Bounsaythip, C. & Maouche, S. (1997). Irregular Shape Nesting and Placing with Evolutionary Approach. In Proceedings of the IEEE International Conference On Systems, Man and Cybernetics 4: 3425-3430.

    Google Scholar 

  • Burke, E. & Kendall, G. (1999). Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem. In Proceedings of the World Manufacturing Congress, 27-30. Durham, UK.

  • Coffman, E. G., Garey, M. R. & Johnson, D. S. (1984). Approximation algorithms for binpacking-an updated survey. In Ausiello, G., Lucertini, M. & Serafini, P. (eds.) Algorithms Design for Computer Systems Design, 49-106. Springer, Vienna.

    Google Scholar 

  • Coffman, E. G. & Shor, P. W. (1990). Average-case analysis of cutting and packing in two dimensions. European Journal of Operational Research 44: 134-144.

    Google Scholar 

  • Corno, F., Prinetto, P., Rebaudengo, M. & Sonza Reorda, M. (1997). Optimising area loss in flat glass cutting. In Proceedings of Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, GALESIA' 97, 450-455. Glasgow, University of Strathclyde, UK.

    Google Scholar 

  • Dagli, C. H. & Poshyanonda, P. (1997). New approaches to nesting rectangular patterns. Journal of Intelligent Manufacturing 8: 177-190.

    Google Scholar 

  • Davis, L. (1985). Applying adaptive search algorithms to epistatic domains. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, 162-164. Los Angeles.

  • Davis, L. (1991). Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.

    Google Scholar 

  • Dighe, R. & Jakiela, M. J. (1996). Solving Pattern Nesting Problems with Genetic Algorithms Employing Task Decomposition And Contact Detection. Evolutionary Computation 3: 239-266.

    Google Scholar 

  • Dowsland, K.A. (1993). Some experiments with simulated annealing techniques for packing problems. European Journal of Operational Research 68: 389-399.

    Google Scholar 

  • Dowsland, K. A. & Dowsland, W. B. (1992). Packing problems. European Journal of Operational Research 56: 2-14.

    Google Scholar 

  • Dowsland, K. A. & Dowsland, W. B. (1995). Solution approaches to irregular nesting problems. European Journal of Operational Research 84: 506-521.

    Google Scholar 

  • Dowsland, W. B. (1985). Two and three dimensional packing problems and solution methods. New Zealand Journal of Operational Research 13: 1-18.

    Google Scholar 

  • Dowsland, W. B. (1991). Three-dimensional packing-solution approaches and heuristic development. International Journal of Production Research 29: 1673-1685.

    Google Scholar 

  • Dyckhoff, H. (1990). Typology of cutting and packing problems. European Journal of Operational Research 44: 145-159.

    Google Scholar 

  • Dyckhoff, H. & Finke, U. (1992). Cutting and Packing in Production and Distribution. Springer Verlag, Berlin.

    Google Scholar 

  • Eglese, R.W. (1990). Simulated annealing. A tool for operational research. European Journal of Operational Research 46: 271-281.

    Google Scholar 

  • Faina, L. (1999). Application of simulated annealing to the cutting stock problem. European Journal of Operational Research 114: 542-556.

    Google Scholar 

  • Falkenauer, E. (1996). Hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2: 5-30.

    Google Scholar 

  • Fowler, R. J., Paterson, M. S. & Tatimoto, S. L. (1981). Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12: 133-137.

    Google Scholar 

  • Fujita K., Akagji, S. & Kirokawa, N. (1993). Hybrid approach for optimal nesting using a genetic algorithm and a local minimisation algorithm. In Proceedings of the 19th Annual ASME Design Automation Conference 1: 477-484. Albuquerque, NM, USA.

    Google Scholar 

  • Gary Parker, R. (1995). Deterministic Scheduling Theory. Chapman Hall.

  • George, J. A., George, J. M. & Lamar, B. W. (1995). Packing different-sized circles into a rectangular container. European Journal of Operational Research 84: 693-712.

    Google Scholar 

  • Glover, F. & Laguna, M. (1993). Tabu search. In Reeves, C. R. (ed.) Modern Heuristics for Computational Problems. Basil Blackwell, Oxford.

    Google Scholar 

  • Golden, B. (1976). Approaches to the cutting stock problem. AIIE Transactions 8: 265-274.

    Google Scholar 

  • Gwee, B. H. & Lim, M. H. (1996). Polyominoes tiling by a genetic algorithm. Computational Optimisation and Applications 6: 273-291.

    Google Scholar 

  • Han, G. C. & Na, S. J. (1996). Two-stage approach for nesting in two-dimensional cutting problems using neural network and simulated annealing. Proceedings of the Institute of Mechanical Engineers, Part B, Journal of Engineering Manufacture 210(B6): 509-519.

    Google Scholar 

  • Healy, P. & Moll, R. (1996). A local optimisation-based solution to the rectangle layout problem. Journal of the Operational Research Society 47: 523-537.

    Google Scholar 

  • Herbert, E. A. & Dowsland, K. A. (1996). A family of genetic algorithms for the pallet loading problem. Annals of Operations Research 63: 415-436.

    Google Scholar 

  • Hinxman, A. I. (1980). The trim loss and assortment problems. European Journal of Operational Research 5: 8-18.

    Google Scholar 

  • Hopper, E. (2000). Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods. Ph.D. diss., Cardiff University.

  • Hopper, E. & Turton, B. C. H. (1997). Application of Genetic Algorithms to Packing Problems-A Review. In Chawdry, P. K., Roy, R. & Kant, R. K. (eds.) In Proceedings of the 2nd On-line World Conference on Soft Computing in Engineering Design and Manufacturing, 279-288. Springer Verlag, London.

    Google Scholar 

  • Hopper, E. & Turton, B. C. H. (1999). A genetic algorithm for a 2D industrial packing problem. Computers in Engineering 37: 375-378.

    Google Scholar 

  • Hopper, E. & Turton, B. C. H. (2000). An Empirical Investigation of Meta-heuristic and Heuristic Algorithms for a 2D Packing Problem. European Journal of Operational Research 128(1): 34-57.

    Google Scholar 

  • Hwang, S. M., Cheng, Y. K. & 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 2: 1583-1590. San Antonio, TX, USA.

    Google Scholar 

  • Ismail, H. S. & Hon, K. K. B. (1992). New approaches for the nesting of two-dimensional shapes for press tool design. International Journal of Production Research 30: 825-837.

    Google Scholar 

  • Ismail, H. S. & Hon, K. K. B. (1995). Nesting of two-dimensional shapes using genetic algorithms. Proceedings of the Institution of Mechanical Engineers 209(B): 115-124.

    Google Scholar 

  • Jain, P., Fenyes, P. & Richter, R. (1988). Optimal blank nesting using simulated annealing. Journal of Mechanical Design-Transactions of the ASME 114: 160-165.

    Google Scholar 

  • Jain, S. & Chang, Gea H. (1998). Two dimensional packing problems using genetic algorithms. Engineering with Computers 14: 206-213.

    Google Scholar 

  • Jakobs, S. (1996). On genetic algorithms for the packing of polygons. European Journal of Operational Research 88: 165-181.

    Google Scholar 

  • Kämpke, T. (1988). Simulated annealing: use of a new tool in bin-packing. Annals of Operations Research 16: 327-332.

    Google Scholar 

  • Kröger, B. (1995). Guillontineable bin-packing: A genetic approach. European Journal of Operational Research 84: 645-661.

    Google Scholar 

  • Kröger, B., Schwenderling, P. & Vornberger, O. (1991a). Parallel genetic packing of rectangles. In Parallel Problem Solving from Nature 1st Workshop, 160-164. Springer Verlag, Berlin.

    Google Scholar 

  • Kröger, B., Schwenderling, P. & Vornberger, O. (1991b). Genetic packing of rectangles on transputers. In Welch, P. (ed.) Transputing 2, 593-608. IOS Press, Amsterdam.

    Google Scholar 

  • Kröger, B., Schwenderling, P. & Vornberger, O. (1993). Parallel genetic packing on transputers. In Stender, J. (ed.) Parallel Genetic Algorithms: Theory and Applications, 151-185. IOS Press, Amsterdam.

    Google Scholar 

  • Lai, K. K. & Chan, W. M. (1997). An evolutionary algorithm for the rectangular cutting stock problem. International Journal of Industrial Engineering 4: 130-139.

    Google Scholar 

  • Leung, T. W., Yung, C. H. & Chan, C. K. (1999). Applications of genetic algorithm and simulated annealing to the 2-dimensional non-guillotine cutting stock problem. IFORS' 99. Beijing, China.

  • Liu, D. & Teng, H. (1999). An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. European Journal of Operational Research 112: 413-419.

    Google Scholar 

  • Lodi, A., Martello, S. & Vigo, D. (1999). Approximation algorithms for the oriented twodimensional bin packing problem. European Journal of Operational Research 112: 158-166.

    Google Scholar 

  • Marques, V. M. M., Bispo, C. F.G. & Sentieiro, J. J. S. (1991). A system for the compaction of two-dimensional irregular shapes based on simulated annealing. In Proceedings of the 1991 International Conference on Industrial Electronics, Control and Instrumentation-IECON' 91, 1911-1916. Kobe, Japan.

  • Martello, S. & Toth, P. (1990). Knapsack problems: algorithms and computer implementations. John Wiley & Sons Ltd., Chichester.

    Google Scholar 

  • Oliveira, J. F., Gomes, A. M. & Ferreira, S. (2000). A new constructive algorithm for nesting problems. OR Spektrum 22: 263-284.

    Google Scholar 

  • Pargas, R. P. & Jain, R. (1993). A parallel stochastic optimisation algorithm for solving 2D bin packing problems. In Proceedings of the 9th Conference on Artificial Intelligence for Applications, 18-25.

  • Petridis, V. & Kazarlis, S. (1994). Varying quality function in genetic algorithms and the cutting problem. In Proceedings of the IEEE Conference on Evolutionary Computation, 166-169.

  • Poshyanonda, P. & Dagli, C. H. (1993). Genetic neuro-nester for irregular patterns. In Proceedings for Artificial Neural Networks in Engineering Conference (ANNIE' 93) 3: 825-830. ASME Press, New York.

    Google Scholar 

  • Rahmani, A. T. & Ono, N. (1995). An evolutionary approach to two-dimensional guillotine cutting problem. In Proceedings of the IEEE Conference on Evolutionary Computation, 148-151.

  • Ratanapan, K. & Dagli, C. H. (1997a). An object-based evolutionary algorithm for solving rectangular piece nesting problems. In Proceedings of the IEEE Conference on Evolutionary Computation, ICEC, 989-994. IEEE, Piscataway, NJ, USA.

    Google Scholar 

  • Ratanapan, K. & Dagli, C. H. (1997b). An object-based evolutionary algorithm for solving irregular nesting problems. In Proceedings for Artificial Neural Networks in Engineering Conference (ANNIE' 97) 7: 383-388. ASME Press, New York.

    Google Scholar 

  • Ratanapan, K. & Dagli, C. H. (1998). An object-based evolutionary algorithm: the nesting solution. In Proceedings of the International Conference on Evolutionary Computation 1998, ICEC' 98, 581-586. IEEE, Piscataway, NJ, USA.

    Google Scholar 

  • Rayward-Smith, V. J. & Shing, M. T. (1983). Bin packing. Bulletin of the Institute of Mathematics and its Applications 19: 142-146.

    Google Scholar 

  • Reeves, C. (1993). Modern Heuristics for Computational Problems. Basil Blackwell, Oxford.

    Google Scholar 

  • Sarin, S. C. (1983). Two-dimensional stock cutting problems and solution methodologies. ASME Transactions, Journal of Engineering for Industry 104: 155-160.

    Google Scholar 

  • Smith, D. (1985). Bin-packing with adaptive search. In Grefenstette (ed.) Proceedings of an International Conference on Genetic Algorithms and their Applications, 202-206. Lawrence Erlbaum.

  • Sweeney, P. E. & Paternoster, E. (1992). Cutting and packing problems: a categorised, application-orientated research bibliography. Journal of the Operational Research Society 43: 691-706.

    Google Scholar 

  • Theodoracatos, V. E. & Grimsley, J. L. (1995). Optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules. Computer Methods in Applied Mechanics and Engineering 125: 53-70.

    Google Scholar 

  • Whelan, P. F. & Batchelor, B. G. (1993). Automated packing systems: Review of industrial implementations. SPIE, Machine Vision Architectures, Integration and Applications 2064: 358-369.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering, Cardiff University, PO Box 689, Cardiff, CF24 3TF, UK E-mail

    E. Hopper & B. C. H. Turton

Authors
  1. E. Hopper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. C. H. Turton
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hopper, E., Turton, B.C.H. A Review of the Application of Meta-Heuristic Algorithms to 2D Strip Packing Problems. Artificial Intelligence Review 16, 257–300 (2001). https://doi.org/10.1023/A:1012590107280

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012590107280

Search

Navigation