作者: Hongteng Wu , Stephen C.H. Leung , Yain-whar Si , Defu Zhang , Adi Lin
DOI: 10.1016/J.APM.2016.09.018
关键词:
摘要: Abstract This paper studies a new practical problem which can be decomposed into three three-dimensional packing problems: irregular with variable-size cartons problem, bin and the single container loading problem. Since sub-problems are NP-hard, searching good solution becomes more difficult. In this paper, mathematical models of each sub-problem developed three-stage heuristic algorithms proposed to solve Experiments conducted random instances generated by real-life case. Computational results indicate that algorithm is efficient yield satisfactory results.