中文摘要：

基于预判发货的背景，考虑订单处理中心和配送站之间存在第三方物流和自营物流两种配送模式，研究了B2C网络零售商的动态批量配送问题。首先利用混合整数规划构建了一个三级供应链系统下的动态批量配送模型，接着采用网络流规划的技术重新建模，并在其基础上对最优解的性质进行了分析，进而设计了计算时间复杂度为O（T^2）的精确动态规划求解算法。最后用算例实验验证了该算法的有效性和适用性。

英文摘要：

In an environment of anticipatory shipping, this paper deals with a dynamic batch delivery problem for a B2C online retailer, in which two shipping modes of common carrier and private carrier are between the order fulfillment center and the hub. A three-echelon dynamic batch delivery model is firstly developed through mixed integer programming. Then the model is reformulated through network flow representation. By analyzing the net- work flow model, several optimality properties are obtained. Based on these properties, we develop a dynamic programming algorithm with polynomial running time of O （ T^2 ） . Finally, this study uses a numerical case to veri- fy and validate the effectiveness and applicability of our method.