基于TLV三维约束的多配送中心VRP问题

Study on Multi-depot VRP Based on TLV Three-fold Constraints

针对电商配送中的VRP问题,根据大件快递和小件快递两个变量,建立了一种基于软时间窗(Time windows)、车辆载重量(Load capacity)、车辆容积(Volume)约束(简称TLV三维约束)的多配送中心车辆路径优化模型,采用遗传算法对该模型进行求解。通过对武汉市291个快递网点的仿真实验,验证了所构建的模型能够得到合理的配送路径。

In this paper, in view of the vehicle routing problem(VRP) in the context of e-commerce distribution, we built the multidepot VRP model with three-fold constraints which were time window, load capacity and volume(or TLV for short), solved it using genetic algorithm and at last, through a simulation test on 291 express delivery outlets in Wuhan, demonstrated that the model established could yield reasonable distribution route.