This paper studies a new practical problem which can be decomposed into three three-dimensional packing problems: three-dimensional irregular packing with variable-size cartons problem, three-dimensional variable-size bin packing problem, and the single container loading problem. Since the three sub-problems are NP-hard, searching a good solution becomes more difficult. In this paper, mathematical models of each sub-problem are developed and three-stage heuristic algorithms are proposed to solve this new problem. Experiments are conducted with random instances generated by real-life case. Computational results indicate that the proposed algorithm is efficient and can yield satisfactory results. (C) 2016 Elsevier Inc. All rights reserved.

%8 2017-01 %D 2017 %I ELSEVIER SCIENCE INC %J APPLIED MATHEMATICAL MODELLING %P 431-444 %V 41 %@ 0307-904X %U http://repository.umac.mo/handle/10692/2332 %W UM