基于供需双向服务的共享仓储配送路径优化

Distribution Path Optimization of Public Warehouse Based on Supply-demand Services

共享仓储是"制造业+互联网+共享经济"智能制造大背景下,通过集成智能仓库产品与专业化的"集中采购+智能存储+JIT配送"服务于工业园区。针对园区企业与共享仓储之间的供需双向服务的物流特征,需要考虑在交货硬时间窗、运输小车承载量和小车数量等约束条件下较优的配送路径问题。首先,建立了共享仓储配送路径优化数学模型,并采用车辆平均负荷作为综合评价指标。然后,基于贪心策略选择初始点,以最佳行程长度确定选择概率,对基本烟花算法进行了改进来求解优化。最后,仿真案例的结果表明,改进的离散烟花算法在计算共享仓储最优配送路径方面具有较好的收敛性和合理性。

Under the background of"manufacturing industry+Internet+sharing economy"intelligent manufacturing,Shared warehouse serves industrial parks by integrating intelligent warehouse products with specialized"centralized procurement+intelligent storage+JIT distribution".In view of supplydemand service characteristics between enterprises and shared warehouse,it is necessary to consider the optimal distribution path with the constraints of the delivery hard time window,the carrying capacity of the transport vehicles and the number of vehicles.Firstly,the mathematical model of distribution path optimization of shared warehouse is established,and the average vehicle load is used as the comprehensive evaluation index.Then,basic fireworks algorithm is improved based on the greedy strategy to select the initial point,the optimal travel length to determine the selection probability.Finally,the simulation results show that the improved discrete fireworks algorithm has better convergence and rationality in calculating the optimal distribution path of shared warehouse.