An improved best-first branch and bound algorithm for the pallet-loading problem using a staircase structure

作者：

Highlights：

• This paper concerns the pallet-loading problem (PLP).

• A best-first branch and bound algorithm to solve the PLP is developed.

• The proposed algorithm generates layouts of the staircase structure.

• Efficient methods to remove dominated and duplicated patterns is proposed.

摘要

•This paper concerns the pallet-loading problem (PLP).•A best-first branch and bound algorithm to solve the PLP is developed.•The proposed algorithm generates layouts of the staircase structure.•Efficient methods to remove dominated and duplicated patterns is proposed.

论文关键词：Packing,Combinatorial optimization,Pallet loading problem,Branch and bound

论文评审过程：Available online 29 May 2015, Version of Record 24 June 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.05.045