A review of the application of swarm intelligence algorithms to 2D cutting and packing problem

  • Authors:

  • Yanxin Xu;Gen Ke Yang;Jie Bai;Changchun Pan

  • Affiliations:

  • Department of Automation, Shanghai JiaoTong University and Key Laboratory of System, Control and Information Processing, Ministry of Education of China, MinHang District, Shanghai, China;Department of Automation, Shanghai JiaoTong University and Key Laboratory of System, Control and Information Processing, Ministry of Education of China, MinHang District, Shanghai, China;Department of Automation, Shanghai JiaoTong University and Key Laboratory of System, Control and Information Processing, Ministry of Education of China, MinHang District, Shanghai, China;Department of Automation, Shanghai JiaoTong University and Key Laboratory of System, Control and Information Processing, Ministry of Education of China, MinHang District, Shanghai, China

  • Venue:
  • ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.