Skip to main content
SpringerLink
Log in

Application of Genetic Algorithms to Packing Problems — A Review

  • Conference paper
Book cover Soft Computing in Engineering Design and Manufacturing

Abstract

This paper reviews two and three-dimensional packing problems and their solution utilising genetic algorithms. The dimensions and the geometry of the figures involved in the allocation process classify packing problems. Since the genetic representation of the problem is vital to the performance of the genetic algorithm, particular emphasis is put on the techniques used for the representation of the problem and the genetic operators. With most of the approaches being hybrid genetic algorithms their decoding strategies are also briefly discussed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Sedgewick R, 1992, Algorithms in C++, Addison-Wesley, Reading.

    Google Scholar 

  2. Reeves C., 1993, Modern Heuristics for Computational Problems, Basil Blackwell, Oxford.

    Google Scholar 

  3. van Laarhoeven P. J. M., Aarts, E. H., 1987, Simulated Annealing: Theory and Applications, D. Reidel Publishing Company, Dordrecht.

    Book  Google Scholar 

  4. Dowsland K. A., Dowsland W. B., 1992, Packing problems, European Journal of OR, vol. 56, pp. 2–14.

    Article  MATH  Google Scholar 

  5. Dowsland K. A., Dowsland W. B., 1995, Solution approaches to irregular nesting problems, European Journal of Operational Research, vol. 84, no. 3, pp. 506–521.

    Article  MATH  Google Scholar 

  6. Dyckhoff H., 1990, Typology of cutting and packing problems, Eur. J. of OR, vol. 44, no. 2, pp. 145–159.

    Article  MathSciNet  MATH  Google Scholar 

  7. Hässler R. W., Sweeney, P. E., 1991, Cutting stock problems and solution procedures, European Journal of Operational Research, vol. 54, part 2, pp. 141–150.

    Article  MATH  Google Scholar 

  8. Hinxman A. I., 1980, The trim loss and assortment problems, Eur. J. of OR, vol. 5, part I, pp. 8–18.

    Article  MathSciNet  MATH  Google Scholar 

  9. Davis L, 1991, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York.

    Google Scholar 

  10. Goldberg D. E., 1989, Genetic Algorithms in Search, Optimisation and Machine Learning, Addison-Wesley Publishing Company, Reading.

    Google Scholar 

  11. Mitchell M., 1996, An introduction to genetic algorithms, MIT Press, Massachusetts.

    Google Scholar 

  12. Smith D., 1985, Bin-packing with adaptive search, in: Grefcnstcttc (ed.), Proceedings of an International Conference on Genetic Algorithms and their Applications, Lawrence Erlbaum, pp. 202–206.

    Google Scholar 

  13. Davis L, 1985, Applying adaptive search algorithms to epistatic domains, Proceedings of the 9th Int. Joint Conference on Artificial Intelligence, Los Angeles, pp. 162–164.

    Google Scholar 

  14. Kröger B., 1995, Guillontineable bin-packing: A genetic approach, Eur. J. of OR, vol. 84, pp. 645–661.

    Article  MATH  Google Scholar 

  15. Jakobs S, 1996, On genetic algorithms for the packing of polygons, Eur. J. of OR, vol. 88, pp. 165–181.

    Article  MATH  Google Scholar 

  16. Kröger B., Schwendcrling P., Vornbergcr O., 1991, Parallel genetic packing of rectangles, in: Parallel Problem Solving from Nature 1st Workshop, Springer Verlag, pp. 160–164.

    Google Scholar 

  17. Kröger B., Schwenderling P., Vornberger O., 1991, Genetic packing of rectangles on transputers, in: P. Welch (ed.), Transputing, part 2, IOS Press, Amsterdam pp. 593–608.

    Google Scholar 

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

    Google Scholar 

  19. Falkenauer E., Delchambre A., 1992, A genetic algorithm for bin-packing and line balancing, Proceedings of the 1992 IEEE International Conference on Robotics and Automation, Nice, Fr, vol. 2, 1186–1192.

    Article  Google Scholar 

  20. Syswerda D., 1991, Schedule optimization using genetic algorithms: in: Davis (ed.); Handbook of Genetic Algorithms; Van Nostrand Reinhold, New York.

    Google Scholar 

  21. András P., András, A., Zsuzsa, S., 1996, A genetic solution for the cutting stock problem, Proceedings of the First On-line Workshop on Soft Computing, Aug. 1996, Nagoya University, pp. 87–92.

    Google Scholar 

  22. George J. A., George, J. M., Lamar, B. W., 1995, Packing different-sized circles into a rectangular container, European Journal of Operational Research, vol. 84, pp. 693–712.

    Article  MATH  Google Scholar 

  23. Fujita K., Akagji, S., Kirokawa, N., 1993, Hybrid approach for optimal nesting using a genetic algorithm and a local minimisation algorithm, Proceedings of the 19th Annual ASME Design Automation Conference, Part I (of 2), Albuquerque, NM, USA, vol. 65, part 1, pp. 477–484.

    Google Scholar 

  24. 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, vol. 30, part 4, pp. 825–837.

    Article  MATH  Google Scholar 

  25. Ismail H. S., Hon K. K. B., 1995, Nesting of two-dimensional shapes using genetic algorithms, Proceedings of the Institution of Mechanical Engineers, Part B, vol. 209, pp. 115–124.

    Article  Google Scholar 

  26. Ismail H. S., Hon K. K. B., 1995, Nesting of two-dimensional shapes using genetic algorithms, Proceedings of the Institution of Mechanical Engineers, Part B, vol. 209, pp. 115–124.

    Article  Google Scholar 

  27. Prosser P., 1988, A hybrid genetic algorithm for pallet loading, in: B. Radig (ed.), ECAI 88 Proceedings 8th European Conference on Artificial Intelligence, Pitman, London pp. 159-164.

    Google Scholar 

  28. Lin J. L., Foote B., Pulat S., Chang C. H., Cheung, J. Y., 1993, Hybrid genetic algorithm for container packing in three dimensions, Proc. of the 9th Conf. on Artificial Intelligence for Applications, pp. 353-359.

    Google Scholar 

  29. Bortfeldt A., 1994, A genetic algorithm for (he container loading problem, in Rayward-Smith (ed.): Proceedings of the Unicom Seminar on Adaptive Computing and Information Processing, pp. 749-757.

    Google Scholar 

  30. Corcoran A. L., Wainwright R. L., 1992, Genetic algorithm for packing in three dimensions, Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing SAC ′92, Kansas City, pp. 1021-1030.

    Google Scholar 

  31. Ikonen I., Biles W. E., Kumar A., Ragade R. K., 1996, Concept for a genetic algorithm for packing 3D objects of complex shape, Proc. 1st Online Workshop on Soft Computing, Nagoya University, pp. 211-215.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering, University of Wales, Cardiff Newport Road, Cardiff, CF2 3TD, UK

    E. Hopper & B. Turton

Authors
  1. E. Hopper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Turton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mechanical Engineering, University of Bath, Bath, BA2 7AY, UK

    P. K. Chawdhry Ph.D.

  2. The CIM Institute, Cranfield University, Cranfield, Bedford, MK43 0AL, UK

    R. Roy Ph.D.

  3. Department of Aerospace Engineering, Indian Institute of Technology, Powai, Mumbai, 400 076, India

    R. K. Pant PhD

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag London

About this paper

Cite this paper

Hopper, E., Turton, B. (1998). Application of Genetic Algorithms to Packing Problems — A Review. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds) Soft Computing in Engineering Design and Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-0427-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0427-8_30

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-76214-0

  • Online ISBN: 978-1-4471-0427-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation