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

被引:0
作者
Xu, Yanxin [1 ]
Yang, Gen Ke [1 ]
Bai, Jie [1 ]
Pan, Changchun [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Automat, Minist Educ China, Key Lab Syst Control & Informat Proc, 800 DongChuan Rd, Shanghai 200030, Peoples R China
来源
ADVANCES IN SWARM INTELLIGENCE, PT I | 2011年 / 6728卷
基金
中国国家自然科学基金;
关键词
cutting and packing problem; swarm intelligence; ACO; PSO; ANT COLONY OPTIMIZATION; STRIP-PACKING; BIN PACKING;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:64 / 70
页数:7
相关论文
共 18 条