Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A beam search implementation for the irregular shape packing problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper investigates the irregular shape packing problem. We represent the problem as an ordered list of pieces to be packed where the order is decoded by a placement heuristic. A placement heuristic from the literature is presented and modified with a more powerful nofit polygon generator and new evaluation criteria. We implement a beam search algorithm to search over the packing order. Using this approach many parallel partial solutions can be generated and compared. Computational results for benchmark problems show that the algorithm generates highly competitive solutions in significantly less time than the best results currently in the literature.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Art, R.C.: An approach to the two dimensional irregular cutting stock problem. IBM Cambridge Scientific Centre, Report 36-Y08 (1966)

  • Albano, A., Sapuppo, G.: Optimal allocation of two-dimensional irregular shapes using heuristic-search methods. IEEE Trans. Syst. Man Cybern. 10, 242–248 (1980)

    Article  Google Scholar 

  • Babu, A.R., Babu, N.R.: A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms. Comput.-Aided Des. 33, 879–891 (2001)

    Article  Google Scholar 

  • Bennell, J.A., Dowsland, K.A.: A tabu thresholding implementation for the irregular stock cutting problem. Int. J. Prod. Res. 37, 4259–4275 (1999)

    Article  MATH  Google Scholar 

  • Bennell, J.A., Dowsland, K.A.: Hybridising tabu search with optimisation techniques for irregular stock cutting. Manage. Sci. 47, 1160–1172 (2001)

    Article  Google Scholar 

  • Bennell, J.A., Song, X.: A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums. Comput. Oper. Res. 35, 267–281 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  • Blum, C.: Beam-ACO-hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput. Oper. Res. 32, 1565–1591 (2005)

    Article  Google Scholar 

  • Burke, E., Hellier, R., Kendall, G., Whitwell, G.: A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Oper. Res. 54, 587–601 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Burke, E., Hellier, R., Kendall, G., Whitwell, G.: Complete and robust no-fit polygon generation for the irregular stock cutting problem. Eur. J. Oper. Res. 179, 27–49 (2007)

    Article  MATH  Google Scholar 

  • Dowsland, K.A., Dowsland, W.B., Bennell, J.A.: Jostling for position: local improvement for irregular cutting patterns. J. Oper. Res. Soc. 49, 647–658 (1998)

    MATH  Google Scholar 

  • Dowsland, K.A., Vaid, S., Dowsland, W.B.: An algorithm for polygon placement using a bottom-left strategy. Eur. J. Oper. Res. 141, 371–381 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Egeblad, J., Nielsen, B.K., Odgaard, A.: Fast neighbourhood search for two- and three-dimensional nesting problems. Eur. J. Oper. Res. 183, 1249–1266 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  • Ghirardi, M., Potts, C.N.: Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. Eur. J. Oper. Res. 165, 457–467 (2005)

    Article  MATH  Google Scholar 

  • Gomes, A.M., Oliveira, J.F.: A 2-exchange heuristic for nesting problems. Eur. J. Oper. Res. 141, 359–370 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Gomes, A.M., Oliveira, J.F.: Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur. J. Oper. Res. 171, 811–829 (2006)

    Article  MATH  Google Scholar 

  • Heckman, R., Lengauer, T.: A simulated annealing approach to the nesting problem in the textile manufacturing-industry. Ann. Oper. Res. 57, 103–133 (1995)

    Article  Google Scholar 

  • Heckman, R., Lengauer, T.: Computing closely matching upper and lower bounds on textile nesting problems. Eur. J. Oper. Res. 108, 473–489 (1998)

    Article  Google Scholar 

  • Jakobs, S.: On genetic algorithms for packing polygons. Eur. J. Oper. Res. 88, 165–181 (1996)

    Article  MATH  Google Scholar 

  • Kim, K.H., Kim, J.: Determining load patterns for the delivery of assembly components under JIT systems. Int. J. Prod. Econ. 77, 25–38 (2002)

    Article  Google Scholar 

  • Lowerre, B.T.: The HARPY speech recognition system. Ph.D. Thesis, Carnegie Mellon University, Pittsburgh, PA (1976)

  • Mehadevan, A.: Optimization in computer aided pattern packing. Ph.D. Dissertation, North Carolina State University (1984)

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

    Article  MATH  MathSciNet  Google Scholar 

  • Sabuncuoglu, I., Bayiz, M.: Job shop scheduling with beam search. Eur. J. Oper. Res. 118, 390–412 (1999)

    Article  MATH  Google Scholar 

  • Shayan, E., Al-Hakim, L.: Beam search for sequencing point operations in flat plate manufacturing. Comput. Industrial Engineering 42, 309–315 (2002)

    Article  Google Scholar 

  • Waescher, G., Haussner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, University of Southampton, Highfield, Southampton, SO17 1BJ, UK

    Julia A. Bennell & Xiang Song

Authors
  1. Julia A. Bennell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiang Song
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julia A. Bennell.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bennell, J.A., Song, X. A beam search implementation for the irregular shape packing problem. J Heuristics 16, 167–188 (2010). https://doi.org/10.1007/s10732-008-9095-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-008-9095-x

Keywords

Search

Navigation