Skip to main content
SpringerLink
Log in

A Review of the Application of Swarm Intelligence Algorithms to 2D Cutting and Packing Problem

  • Conference paper
Advances in Swarm Intelligence (ICSI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6728))

Included in the following conference series:

Abstract

Cutting and packing (C & P) problem is to allocate a set of items to larger rectangular standardized units by minimizing the waste. Bin packing, strip packing and cutting stock problem is well-known classical C & P problem. An overview is provided of several meta-heuristics algorithms of swarm intelligence from the literature for the 2D C & P problem. The objective of this paper is to present and categorize the solution approaches in the literature for 2D regular and irregular C & P problem. The focus is hereby on the analysis of the methods and application of swarm intelligence algorithms.

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.

References

  1. Bitam, S., Batouche, M., Talbi, E.g.: A survey on bee colony algorithms. In: The 24th IEEE Parallel & Distributed Processing Symposium Workshops (IPDPSW), Georgia, pp. 19–23 (2010)

    Google Scholar 

  2. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  3. Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: A survey. European Journal of Operational Research 141, 241–252 (2002)

    Article  MATH  Google Scholar 

  4. 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 (2000)

    Article  MATH  Google Scholar 

  5. Dyckhoff, H.: A typology of cutting and packing problems. European Journal of Operational Research 44, 45–159 (1990)

    Article  MATH  Google Scholar 

  6. Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)

    Article  MATH  Google Scholar 

  7. Bennell, J.A., Oliveira, J.F.: A tutorial in irregular shape packing problems. Journal of the Operational Research Society 60, 93–105 (2009)

    Article  MATH  Google Scholar 

  8. Riff, M., Bonnaire, X., Neveu, B.: A revision of recent approaches for two-dimensional strip-packing problems. Engineering Applications of Artificial Intelligence 22, 823–827 (2009)

    Article  Google Scholar 

  9. Hopper, E., Turton, B.C.H.: An empirical investigation on meta-heuristic and heuristic algorithms for a 2d packing problem. European Journal of Operational Research 128, 34–57 (2001)

    Article  MATH  Google Scholar 

  10. Bennell, J.A., Song, X.: A beam search implementation for the irregular shape packing problem. J. Heuristics 16, 167–188 (2008)

    Article  MATH  Google Scholar 

  11. Blum, C.: Ant colony optimization: Introduction and recent trends. Phys. Life Reviews 2, 353 (2005)

    Article  Google Scholar 

  12. Ducatelle, F., Levine, J.: Ant Colony Optimization for Bin Packing and Cutting Stock Problems. In: UK Workshop on Computational Intelligence, Edinburgh (2001)

    Google Scholar 

  13. Levine, J., Ducatelle, F.: Ant colony optimization and local search for bin packing and cutting stock problems. J. Oper. Res. Soc. 55, 705 (2004)

    Article  MATH  Google Scholar 

  14. Thiruvady, D.R., Meyer, B., Ernst, A.T.: Strip packing with hybrid ACO Placement order is learnable. In: IEEE Congress on Evolutionary Computation, Hong Kong, pp. 1207–1213 (2008)

    Google Scholar 

  15. Xu, Y.C., Dong, F.M., Liu, Y., Xiao, R.B.: Ant Colony Algorithm for the Weighted Item Layout Optimization Problem. eprint arXiv:1001.4099 (2010)

    Google Scholar 

  16. Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization: an overview. Swarm Intelligence Journal 1(1), 33–57 (2007)

    Article  Google Scholar 

  17. Liu, D.S., Tan, K.C., Goh, C.K., Ho, W.K.: On solving multi-objective bin packing problems using particle swarm optimization. In: IEEE Congress on Evolutionary Computation, Vancouver, pp. 7448–7455 (2006)

    Google Scholar 

  18. Liu, D., Tan, K., Huang, S., Goh, C., Ho, W.: On solving multi-objective bin packing problems using evolutionary particle swarm optimization. European Journal of Operational Research 190, 357–382 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Automation, Key Laboratory of System Control Information Processing, Ministry of Education of China, Shanghai JiaoTong University, 800 DongChuan Rd, MinHang District, Shanghai, China

    Yanxin Xu, Gen Ke Yang, Jie Bai & Changchun Pan

Authors
  1. Yanxin Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gen Ke Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jie Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Changchun Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Key Laboratory of Machine Perception, Department of Machine Intelligence, School of Electronics Engineering and Computer Science, Peking University, 100871, Beijing, China

    Ying Tan

  2. Department of Electrical and Electronic Engineering, Xi’an Jiaotong-Liverpool University, 215123, Suzhou, China

    Yuhui Shi

  3. Automation College, Chongqing University, 400030, Chongqing, China

    Yi Chai

  4. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, 400065, Chongqing, P.R. China

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, Y., Yang, G.K., Bai, J., Pan, C. (2011). A Review of the Application of Swarm Intelligence Algorithms to 2D Cutting and Packing Problem. In: Tan, Y., Shi, Y., Chai, Y., Wang, G. (eds) Advances in Swarm Intelligence. ICSI 2011. Lecture Notes in Computer Science, vol 6728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21515-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21515-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21514-8

  • Online ISBN: 978-3-642-21515-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation