半柔性覆盖的多配送中心路线优化问题研究

为应对“双十一”“618”需求突发性爆涨下物流配送网络的爆仓、滞缓等问题，提出能够兼顾配送系统稳定性和配送路线竞争性的“半柔性覆盖策略”，研究半柔性覆盖的多配送中心路线优化问题。在传统配送中心路线优化问题的基础上，根据地理位置，区分固定需求点和柔性需求点，定义固定需求点只能由所属配送中心服务，而柔性需求点可由多个配送中心协同服务；以总成本最小为目标，建立半柔性覆盖的多配送中心路线优化模型；设计遗传算法求解，使用Matlab编译；选取申通快递在西安北郊地区的五个配送站点为实例进行求解，将求解结果与原始路线、“全柔性覆盖策略”和“固定分区策略”进行对比，验证了“半柔性覆盖策略”的有效性。

Research on Multi-depots Vehicle Routing Problem with Semi-flexible Coverage Service

To solve the?warehouse?explosion and delivery stagnation for last-mile logistics network with the soaring demand at the “Double 11” and “618”, this paper proposes a semi-flexible coverage service strategy which considers both the high solution quality and high system stability. As?a?result, the Multi-depots Vehicle Routing Problem with Semi-flexible Service（MVRP-SFS） is studied. Firstly, according to the geographical location information, this paper distinguishes all customer nodes into fixed coverage nodes and flexible coverage nodes. The fixed coverage nodes can only be served by one depot, while the flexible coverage nodes can be served by any one of multiple depots that allow to service cooperatively. Secondly, with the goal of minimizing the total cost, this paper establishes an MVRP-SFS model. Thirdly, this paper designs the genetic algorithm using Matlab compiler to solve the proposed model. Finally, the numerical experiments verify the effectiveness of the semi-flexible coverage service strategy.