带批次和临时库存的越库配送车辆路径问题研究

从零售业供应链整合入手,构建供应商、配送中心和零售点构成的协同配送网络,研究带批次和临时库存的越库配送车辆路径问题.将越库过程分为取货、分拣和配货三个阶段,考虑配送中心分拣能力,分批次设置车辆协同到达配送中心的服务时刻,据此建立以最小化车辆运输成本、临时库存成本和固定成本为目标的数学模型.考虑问题特征,设计一种混合变邻域搜索粒子群算法求解,并将结果进行横纵向比较.结果表明,所提算法有效且可靠,能够为带批次和临时库存的越库配送问题提供解决方案.

Research on Vehicle Routing Problem with Cross-Docking under Batch and Temporary Inventory

From the integration of the retail supply chain,a collaborative distribution network consisting of suppliers,distribution centers and retail outlets is constructed to research the vehicle routing problem with cross-docking under batch and temporary inventory.The process of cross-docking is divided into three stages:pickup,sorting,and distribution.Considering the sorting capacity of the distribution center,the service time of vehicles arriving at the distribution center in batches is set up.Based on this,a mathematical model is established to minimize the vehicle transportation cost,temporary inventory cost,and fixed cost.Considering the characteristics of the problem,a hybrid variable neighborhood search particle swarm optimization algorithm is designed.In order to verify the effectiveness of the algorithm,the algorithm results are compared horizontally and vertically.The results show that the proposed algorithm is effective and reliable,and can provide a solution for the vehicle routing problem with cross-docking under batch and temporary inventory.