A multi-round partial beam search approach for the single container loading problem with shipment priority
A multi-round partial beam search approach for the single container loading problem with shipment priority
复制标题
DOI：
10.1016/j.ijpe.2013.04.028
复制
发表时间：
2013-10
影响因子：
12
通讯作者：
Ning Wang;A. Lim;Wenbin Zhu
中科院分区：
文献类型：
--
作者：
Ning Wang;A. Lim;Wenbin Zhu
我们在单个集装箱装载问题中考虑了运输优先级，所有具有高优先级的箱子必须在具有低优先级的箱子之前被装载到集装箱中。在真实的应用程序中，发货优先级是一个非常常见的考虑因素，但它很少受到研究界的关注。我们提出了一个多轮部分波束搜索方法，明确考虑航运优先级时，评估部分解决方案来解决这个问题的潜力。现有的基准上的实验表明，我们的方法比目前的方法更有效。平均利用率提高了近1%，而运行时间比最先进的方法更短。由于现有的基准测试数据只涵盖弱异构的实例，我们扩展的基准测试数据，强异构的实例，并产生各种比例的高优先级框，以涵盖更广泛的应用程序的实例。
We consider shipping priority in the single container loading problem, where all boxes with high priority must be loaded into the container before those with low priority. Shipping priority is a very common consideration in real applications, but it has received very little attention from the research community. We propose a multi-round partial beam search method that explicitly considers shipping priority when evaluating the potential of partial solutions to solve this problem. Experiments on existing benchmarks suggest that our approach is more effective than current methods. The average utilization is improved by almost 1% while the running time is shorter than the state of the art method. Since existing benchmark data covers only weakly heterogeneous instances, we extend the benchmark data to strongly heterogeneous instances and also generate instances with various proportions of high priority boxes to cover a wider spectrum of applications.