Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
