随机需求连锁餐厅联合配送规划仿真研究

Simulation study on joint distribution planning of chain restaurants with stochastic demand

为了解决连锁餐厅之间派送员相互调度与自我调度问题,研究了基于聚类分配的时间轴派送员调度算法。不失一般性,以3家近距离连锁餐厅为对象,以总配送成本最小为目标函数建立连锁订单分配与派送员调度模型,以配送里程、派送员单程承载量、客户需求时间作为约束条件。设计基于紧密程度的订单聚类算法,改进C-W节约法混合蚁群算法求解配送路线。利用计算机仿真方法进行动态路径规划仿真模拟,验证算法有效性。本文算法为连锁餐饮企业订单分配与物流派送提供参考。

To solve the problem of mutual scheduling and self scheduling between chain restaurants,a time axis dispatcher scheduling algorithm based on clustering assignment is studied.Without losing generality,this paper takes three close chain restaurants as the object,establishes a chain order allocation and dispatcher scheduling model with the minimum total distribution cost as the objective function,and takes the distribution mileage,one-way carrying capacity of the dispatcher and customer demand time as constraints.Design order clustering algorithm based on compactness,improve C-W saving method and hybrid ant colony algorithm to solve the distribution route.The simulation of dynamic path planning is carried out by using computer simulation method to verify the effectiveness of the algorithm.This algorithm provides a reference for order allocation and logistics delivery of chain catering enterprises.