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

Abstract: 3D container loading problem (3D-CLP) is a classic NP-hard optimization problem. Although computer scientists and discrete mathematicians have studied this problem for decades, there are ...

The instances provided in this depository are the instances used in the article "Optimizing 3D container loading problem based on a hybrid multi-objective algorithm with multi-drop constraints". The ...