电子商业物流系统中一种新的仓位设计问题及高性能算法
A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System
摘要:
包装成本在电子商业物流成本中占很大一部分。挖掘客户订单的模式,设计合适的包装箱,有助于降低运营成本。在经典的装箱问题中,一组给定的长方体形状的物品应该被装入具有给定和固定尺寸(长、宽和高)的箱子中,以最小化所使用的箱子的数量。然而,本文提出了一种新的bin设计问题。决策变量是箱的几何尺寸,目标是最小化总表面积。针对该问题,提出了一种基于动态规划和深度优先树搜索的低计算复杂度、高性能的启发式算法DPTS。基于物流场景下的真实历史数据,数值实验表明,DPTS算法比贪婪局部搜索(GLS)算法在总成本上提高了5.8%。DPTS算法所需的计算资源仅为GLS算法的1/50左右。这表明DPTS算法在解决货箱设计问题上是非常有效的,可以帮助物流公司做出合理的设计。
英文摘要:
Packing cost accounts for a large part of the e-commerce logistics cost. Mining the patterns of customer orders and designing suitable packing bins help to reduce operating cost. In the classical bin packing problem, a given set of cuboid-shaped items should be packed into bins with given and fixed-sizes (length, width and height) to minimize the number of bins that are used. However, a novel bin design problem is proposed in this paper. The decision variables are the geometric sizes of bins, and the objective is to minimize the total surface area. To solve the problem, a low computational-complexity, high-performance heuristic algorithm based on dynamic programming and depth-first tree search, named DPTS, is developed. Based on real historical data that are collected from logistics scenario, numerical experiments show that the DPTS out-performed 5.8% than the greedy local search (GLS) algorithm in the total cost. What's more, DPTS algorithm requires only about 1/50 times of the computational resources compared to the GLS algorithm. This demonstrates that DPTS algorithm is very efficient in bin design problem and can help logistics companies to make appropriate design.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。