Hybrid algorithm for the two-dimensional rectangular layer-packing problem

被引:10
作者
Chen, Weidong [1 ]
Zhai, Pengfei [1 ]
Zhu, Heng [2 ]
Zhang, Yongbo [2 ]
机构
[1] Tianjin Univ, Tianjin 300072, Peoples R China
[2] Tianjin 20th Met Construct Co Ltd, Tianjin, Peoples R China
基金
中国国家自然科学基金;
关键词
packing; genetic algorithm; rectangular layer problem; particle swarm optimization; ORTHOGONAL PACKING; GENETIC ALGORITHM; SEARCH ALGORITHM;
D O I
10.1057/jors.2013.54
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, a rectangular layer-packing algorithm (RLPA) combined with modified genetic algorithm (GA) or particle swarm optimization (PSO) algorithm is developed to solve the problem with emerging restraints, which is raised from the two-dimensional rectangular packing problem with some small rectangles that need to be packed into a fixed rectangular object. RLPA is designed from the BL algorithm and lowest horizontal line algorithm. GA and PSO are also modified to satisfy the constraint conditions. Best GA or PSO parameters are obtained by conducting experiments on some typical instances. The results are also compared, which validate the quality of the solutions and show the effectiveness of the modified algorithm.
引用
收藏
页码:1068 / 1077
页数:10
相关论文
共 31 条
[1]   A polynomial-time DNA computing solution for the Bin-Packing Problem [J].
Alonso Sanches, Carlos Alberto ;
Soma, Nei Yoshihiro .
APPLIED MATHEMATICS AND COMPUTATION, 2009, 215 (06) :2055-2062
[2]   A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems [J].
Alvarez-Valdes, R ;
Parreno, F ;
Tamarit, JM .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (04) :414-425
[3]   AN EXACT TWO-DIMENSIONAL NON-GUILLOTINE CUTTING TREE-SEARCH PROCEDURE [J].
BEASLEY, JE .
OPERATIONS RESEARCH, 1985, 33 (01) :49-64
[4]   A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting [J].
Belov, G ;
Scheithauer, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 171 (01) :85-106
[5]   Complete and robust no-fit polygon generation for the irregular stock cutting problem [J].
Burke, E. K. ;
Hellier, R. S. R. ;
Kendall, G. ;
Whitwell, G. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (01) :27-49
[6]   A two-level search algorithm for 2D rectangular packing problem [J].
Chen, Mao ;
Huang, Wenqi .
COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (01) :123-136
[7]   A new constraint programming approach for the orthogonal packing problem [J].
Clautiaux, Francois ;
Jouglet, Antoine ;
Carlier, Jacques ;
Moukrim, Aziz .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (03) :944-959
[8]   A new exact method for the two-dimensional orthogonal packing problem [J].
Clautiaux, Francois ;
Carlier, Jacques ;
Moukrim, Aziz .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (03) :1196-1211
[9]   PACKING PROBLEMS [J].
DOWSLAND, KA ;
DOWSLAND, WB .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 56 (01) :2-14
[10]  
Golberg D. E., 1989, GENETIC ALGORITHMS S, V1989, P36