基于欧氏距离聚合算法模型的仓库配货行走路径研究

Research on Warehouse Distribution Walking Path Based on Euclidean Distance Aggregation Algorithm Model

在新零售的供应链体系中,仓储物流对运营成本和效率有着至关重要的作用,分拣配货又是仓储流程的关键环节。鉴于仓库货架相对固定,提高仓库配货效率问题即可转化为拣货路径优化问题。文章基于欧式距离聚合分析模型,根据订单明细商品所对应库位的拣货顺序对订单进行数据抽象和定义,将批次路径聚合寻优的复杂问题转化为一个对二维空间点聚类的简单问题,以此快速求取仓库配货作业中拣货员最优行走路径,提高配货作业效率。

In the new retail supply chain system,warehousing and logistics play a vital role in operating costs and efficiency,and sorting and distribution is the key part of the warehousing process.In view of the relatively fixed shelves in the warehouse,the problem of improving the efficiency of warehouse distribution can be transformed into the problem of sorting path optimization.Based on the Euclidean distance aggregation analysis model,this paper abstracts and defines the data of the order according to the sorting order of the corresponding storage location of the order details,and transforms the complex problem of batch path aggregation optimization into a simple problem of two-dimensional space point clustering,so as to quickly find the optimal walking path of the sorting personnel in the warehouse distribution operation and improve the efficiency of the distribution operation.