Abstract

A three-dimensional single container loading problem (3D-CLP) is aimed to load kinds of rectangular boxes into a single container with maximal volume utilization. This paper presents a multi-stage search based simulated annealing algorithm (MSSA) for single container loading problem (3D-CLP). An approach for representation of feasible solution is presented. An empty maximal-space list is used to manage the free spaces and difference process is applied in space decomposition. For simulated annealing algorithm is an individual improve approach which rely on a large number of trials, a multi-stage search process is applied to improve accuracy. This approach is tested on the set of test cases proposed by Bischoff and Ratcliff [1], and a comparative result is presented.

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 call

Disclaimer: 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.