Abstract

This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of caving degree (CD) algorithm and variable neighborhood descent (VND) algorithm. More precisely, the first constructive phase is based on a caving degree (CD) heuristic developed for the single container loading problem. In the second improvement phase, four new moves are designed and combined in a VND structure. The resulting hybrid CD/VND algorithm is simple and quite fast and the extensive computational results on test instances from the literature show that the quality of the solutions is equal to or better than that obtained by the best existing heuristic procedures.

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.