Skip to main content
SpringerLink
Log in
Book cover

Optimization and Industry: New Frontiers pp 159–179Cite as

Metaheuristic Algorithms for the Strip Packing Problem

  • Chapter

Part of the book series: Applied Optimization ((APOP,volume 78))

Abstract

Given a set of rectangular items and a strip of given width, we consider the problem of allocating all the items to a minimum height strip. We present a Tabu search algorithm, a genetic algorithm and we combine the two into a hybrid approach. The performance of the proposed algorithms is evaluated through extensive computational experiments on instances from the literature and on randomly generated instances.

This is a preview of subscription content, 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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Baker, B. S., Brown, D. J., and Katseff, H. P. (1981). A 5/4 algorithm for two-dimensional packing. Journal of Algorithms, 2: 348–368.

    Article  MathSciNet  MATH  Google Scholar 

  • Baker, B. S., Coffman, Jr., E. G., and Rivest, R. L. (1980). Orthogonal packing in two dimensions. SIAM Journal on Computing, 9: 846–855.

    Article  MathSciNet  MATH  Google Scholar 

  • Baker, D. S. and Schwarz, J. S. (1983). Shelf algorithms for two-dimen- sional packing problems. SIAM Journal on Computing, 12: 508–525.

    Article  MathSciNet  MATH  Google Scholar 

  • Beasley, J. E. (1985a). Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society, 36: 297–306.

    MATH  Google Scholar 

  • Beasley, J. E. (1985b). An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 33: 49–64.

    Article  MathSciNet  MATH  Google Scholar 

  • Beasley, J. E. (1990). Or-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41 (11): 1069–1072.

    Google Scholar 

  • Bengtsson, B. E. (1982). Packing rectangular pieces — a heuristic approach. The Computer Journal, 25: 353–357.

    MathSciNet  Google Scholar 

  • Berkey, J. O. and Wang, P. Y. (1987). Two dimensional finite bin packing algorithms. Journal of the Operational Research Society, 38: 423–429.

    MATH  Google Scholar 

  • Brown, D. J. (1980). An improved BL lower bound. Information Processing Letters, 11: 37–39.

    Article  MathSciNet  MATH  Google Scholar 

  • Chazelle, B. (1983). The bottom-left bin packing heuristic: An efficient implementation. IEEE Transactions on Computers, 32: 697–707.

    Article  MATH  Google Scholar 

  • Christofides, N. and Whitlock, C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25: 30–44.

    Article  MATH  Google Scholar 

  • Coffman, Jr., E. G., Garey, M. R., Johnson, D. S., and Tarjan, R. E. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9: 801–826.

    MathSciNet  Google Scholar 

  • Davis, L. (1985). Applying adaptive algorithms to epistatic domains. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 162–64. Morgan Kaufmann

    Google Scholar 

  • Davis, L., editor (1991). A Handbbok of Genetic Algorithms. Van Nostrand Reinhold.

    Google Scholar 

  • De Jong, K. A. (1975). An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan.

    Google Scholar 

  • Dyckhoff, H., Scheithauer, G., and Terno, J. (1997). Cutting and Packing (C&P). In Dell’Amico, M., Maffioli, F., and Martello, S., editors, Annotated Bibliographies in Combinatorial Optimization. John Wiley & Sons, Chichester.

    Google Scholar 

  • Fekete, S. and Schepers, J. (1997a). On more-dimensional packing I: Modeling. Technical Report ZPR97–288, Mathematisches Institut, Universität zu Köln.

    Google Scholar 

  • Fekete, S. and Schepers, J. (1997b). On more-dimensional packing II: Bounds. Technical Report ZPR97–289, Mathematisches Institut, Universität zu Köln.

    Google Scholar 

  • Fekete, S. and Schepers, J. (1997c). On more-dimensional packing III: Exact algorithms Technical Report ZPR97–290, Mathematisches Institut, Universität zu Köln.

    Google Scholar 

  • Golan, I. (1981). Performance bounds for orthogonal oriented two-dimensional packing algorithms SIAM Journal on Computing, 10: 571–582.

    Article  MathSciNet  MATH  Google Scholar 

  • Goldberg, D. E. and Lingle, R. L. (1985). Alleles, loci and the traveling salesman problem. In Proceedings of the 1st International Conference on Genetic Algorithms and their Applications, pages 154–159. Erlbaum.

    Google Scholar 

  • Gomez, A. and de la Fuente, D. (2000). Resolution of strip-packing problems with genetic algorithms. Journal of the Operational Research Society, 51: 1289–1295.

    MATH  Google Scholar 

  • Hifi, M. (1999). The strip cutting/packing problem: incremental substrip algorithms-based heuristics. Pesquisa Operacional, Special Issue on Cutting and Packing Problems, 19 (2): 169–188.

    Google Scholar 

  • Holland, J. (1975). Adaptation in Natural and Artificial Systems. Michigan Press.

    Google Scholar 

  • Hopper, E. and Turton, B. (1999). An empirical investigation of meta-heuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research. (to appear).

    Google Scholar 

  • Hoyland, S. (1988). Bin-packing in 1.5 dimension. In Karlsson, R. and Lingas, A., editors, Lecture Notes in Computer Science, pages 129–137. Springer-Verlag, Berlin.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • Lodi, A., Martello, S., and Monaci, M. (2001). Two-dimensional packing problems: a survey. European Journal of Operational Research. (to appear).

    Google Scholar 

  • Lodi, A., Martello, S., and Vigo, D. (1998). Neighborhood search algorithm for the guillotine non-oriented two-dimensional bin packing problem. In Voss, S., Martello, S., Osman, I., and Roucairol, C., editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 125–139. Kluwer Academic Publishers, Boston.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • Lodi, A., Martello, S., and Vigo, D. (1999b). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11: 345–357.

    Article  MathSciNet  MATH  Google Scholar 

  • Lodi, A., Martello, S., and Vigo, D. (1999c). Recent advances on two-dimensional bin packing problems. Technical Report OR/99/2, DEIS - Università di Bologna.

    Google Scholar 

  • Martello, S., Monaci, M., and Vigo, D. (2000). An exact approach to the strip packing problem. Technical Report OR/00/4, Dipartimento di Elettronica, Informatica e Sistemistica, Università di Bologna.

    Google Scholar 

  • Martello, S. and Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44: 388–399.

    Article  MATH  Google Scholar 

  • Poon, P. W. and Carter, J. N. (1995). Genetic algorithm crossover operators for ordering applications. Computers and Operations Research, 22 (1): 135–147.

    Article  MATH  Google Scholar 

  • Reeves, C. (1996). Hybrid genetic algorithms for the bin-packing and related problems. Annals of Operations Research, 63: 371–396.

    Article  MATH  Google Scholar 

  • Reeves, C. R., editor (1993). Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications.

    MATH  Google Scholar 

  • Sleator, D. (1980). A 2.5 times optimal algorithm for packing in two dimensions. Information Processing Letters, 10: 37–40.

    Article  MathSciNet  MATH  Google Scholar 

  • Steinberg, A. (1997). A strip-packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26: 401–409.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Informatica e Sistemistica, Università di Bologna, Viale Risorgimento, 2 - 40136, Bologna, Italy

    Manuel Iori, Silvano Martello & Michele Monaci

Authors
  1. Manuel Iori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvano Martello
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michele Monaci
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Central Queensland University, Mackay, Queensland, Australia

    Victor Korotkikh

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Kluwer Academic Publishers

About this chapter

Cite this chapter

Iori, M., Martello, S., Monaci, M. (2003). Metaheuristic Algorithms for the Strip Packing Problem. In: Pardalos, P.M., Korotkikh, V. (eds) Optimization and Industry: New Frontiers. Applied Optimization, vol 78. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0233-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0233-9_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7953-9

  • Online ISBN: 978-1-4613-0233-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation