三维多箱异构货物装载优化及其可视化

Optimization and Visualization of Multiple 3D Container Loading Problem with Non-identical Items

针对七种现实约束的集装箱三维多箱异构货物装载优化问题,提出了一种基于"块"和"空间"的启发式搜索算法。算法采用树搜索策略,根据可用空间,对每一次搜索的货物块进行评估,得到最佳的货物块,直到无可用空间或无可装载的货物为止。基于开放式标准测试数据的计算结果表明,该算法在时间效率和体积利用率上均优于已有的同类研究。并基于Net平台开发了一款3D装箱布局优化可视化软件,已在相关物流企业中得到推广应用,验证了算法的实用性。

In order to solve the three-dimensional heterogeneous multiple container loading problems with seven realistic constraints, we propose a heuristic search algorithm based on ＂block＂ and ＂space＂. The algorithm uses a tree search strategy, according to the available space, evaluating each cargo block to assess the best one, until no free space or cargo is loaded. The open standards-based test data results show that the algorithm is superior to existing similar studies in time and volume utilization. Furthermore, we develop a 3D visualization loading soft- ware, and it has been applied to the logistics business to verify the practicability of the algorithm.