We propose a two-phase algorithm for solving the manufacturer's pallet loading problem (MPLP). A new integer linear programming model is developed to obtain the maximum number of items that could be packed onto a pallet in the first phase. The solution obtained in the first phase is then adopted to generate a layout pattern for the MPLP with a constraint programming model in the second phase. The computational results indicate that this algorithm can solve difficult instances to the optimality within reasonable computational times.
机构:
Nanjing Univ, Sch Management & Engn, Nanjing 210093, Peoples R China
E China Jiao Tong Univ, Dept Ind Engn & Logist, Nanchang 330013, Peoples R ChinaNanjing Univ, Sch Management & Engn, Nanjing 210093, Peoples R China
Yi, Junmin
Chen, Xing-Guang
论文数: 0引用数: 0
h-index: 0
机构:
Nanjing Univ, Sch Management & Engn, Nanjing 210093, Peoples R ChinaNanjing Univ, Sch Management & Engn, Nanjing 210093, Peoples R China
Chen, Xing-Guang
Zhou, Jing
论文数: 0引用数: 0
h-index: 0
机构:
Nanjing Univ, Sch Management & Engn, Nanjing 210093, Peoples R ChinaNanjing Univ, Sch Management & Engn, Nanjing 210093, Peoples R China
机构:
Brazilian Space Res Inst, LAC, Comp & Appl Math Lab, INPE, BR-12227010 Sao Jose Dos Campos, BrazilBrazilian Space Res Inst, LAC, Comp & Appl Math Lab, INPE, BR-12227010 Sao Jose Dos Campos, Brazil
Ribeiro, Glaydston Mattos
Nogueira Lorena, Luiz Antonio
论文数: 0引用数: 0
h-index: 0
机构:
Brazilian Space Res Inst, LAC, Comp & Appl Math Lab, INPE, BR-12227010 Sao Jose Dos Campos, BrazilBrazilian Space Res Inst, LAC, Comp & Appl Math Lab, INPE, BR-12227010 Sao Jose Dos Campos, Brazil