A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
3D cutting and packing problems have important applications and are of particular relevance to the transportation of cargo in the form of Container Loading Problems (CLP). Many algorithms have been proposed for solving the 2D/3D cutting stock problems but most of them consider single objective optimization. The goal of the problem is to load the boxes that would provide the highest total volume and weight to the container, without exceeding the container limits. These two objectives aredoi:10.1016/j.procs.2016.08.148 fatcat:5ziyjrxml5ctdf3jd5blvt5msq