面向网络零售商的批量补货与发货模型研究

发布时间：2018-01-24 02:06

本文关键词： 网络零售批量计划模型产品预售预判发货动态规划多项式算法　出处：《华中科技大学》2016年博士论文　论文类型：学位论文

【摘要】：随着电子商务的蓬勃发展,越来越多的网络零售企业开始涌现。繁荣的网络零售市场给企业带来了新的发展机遇,也带来了诸多挑战。大多数网络零售商的利润不高,因此,在日益激烈的竞争环境下,通过科学有效的管理手段来降低运营成本,就显得十分有意义。网络零售商的运作成本主要来自与订单履行相关的一系列流程,仓库的补货和订单的发货配送过程则占据了该成本的主要部分,而现有研究对这两方而的问题关注却较少。另外,网络零售商在实际运营中大多采用MRP技术来管理库存,其核心在于基于BOM的批量计划模型。在此背景下,本研究针对网络零售商的特点构建了多个批量补货与发货模型,来帮助企业在动态的竞争环境中优化补货与发货的决策方法,进而降低相应的运作成本。本文的研究工作主要集中在以下四个方面：首先,从整体运营方式和订单处理方式这两方面对网络零售商的特征进行了深入分析。然后,系统地介绍了网络零售商围绕订单履行中心的供应链运作体系,将其分为上游补货系统、中游订单处理系统和下游订单发货与配送系统,并对各系统中的运作问题做了细致分析。最后,着重对网络零售环境下的补货问题与发货问题进行了详细探讨。其二,针对网络零售环境下顾客需求不必立即被满足的特点,引入提前需求信息概念,详细分析了四种网络零售情境下的库存补给问题：(1)需求提前期相同的单一顾客类型的纯网络零售情境；(2)考虑顾客配送优先级的纯网络零售情境；(3)零售商在线上与线下双渠道独立经营的情境；(4)零售商在线上与线下双渠道互动经营的情境,即允许线上顾客下单后到线下实体商店自取货物。同时,为每种情境下的补货计划问题构建了考虑需求提前期的动态批量模型,并分析了各模型之间的关系。进一步,在需求时间窗的视角下,为所有网络零售情境下的动态批量补货问题重新构建了一个统一模型,并分析了其最优解性质,设计了多项式时间的动态规划求解算法。最后,采用实际网络零售商的数据进行案例实验,发现所提出的补货方法显著地降低了补货与库存成本。其三,基于网络预售新产品销售期较短,且商家在预傅期内缺货完全拖后的特点,根据预傅期是否固定,构建了起始有缺货的一次批量补货模型和两次批量补货模型。然后,对两种模型分别进行性质分析,证明了其最优解存在,并给出了相应的求解步骤。最后,进行了算例实验,分别求得了预售期不固定情形下的最优一次补货策略和预售期固定情形下的最优两次补货策略。结果可以指导商家根据不同产品的参数水平,在不同的预售策略下找到相应的最佳补货方案。最后,基于一种全新运作概念—“预判发货”的应用背景,考虑网络零售商的订单履行中心与配送站之间存在第三方物流和自营物流两种配送模式,研究了双模式动态批量发货问题。首先利用混合整数规划构建了一个两级供应链系统下的动态批量配送模型,然后采用网络流规划的技术重新建模,并在其基础上对最优解的性质进行了分析,进而设计了计算时间复杂度为O(T2)的精确动态规划求解算法。最后用算例实验验证了该算法的有效性和适用性。
[Abstract]:With the rapid development of e-commerce, online retail business more and more began to emerge. The online retail market boom has brought new development opportunities for the enterprise, also bring many challenges. Most Internet retailers profit is not high, therefore, in the increasingly fierce competitive environment, to reduce operating costs through scientific and effective management means and it is very meaningful. The online retailer operating costs mainly from a series of processes related to order fulfillment, delivery and distribution process of warehouse replenishment orders and occupy the main part of the cost, and the existing research on this problem and the two party pays less attention. In addition, in the actual operation of most online retailers using MRP technology to manage the inventory, which is the core of batch planning model based on BOM. Under this background, based on the characteristics of online retailers build multiple batches Replenishment and delivery model, decision making method to help enterprises optimize replenishment and delivery in the dynamic competition environment, thereby reducing the corresponding operation cost. The main research work of this paper focuses on the following four aspects: firstly, analyzed from the two aspects of the overall operation and order processing methods on network retailer's characteristics. Then, systematically introduces the network retailers around the fulfillment centers of the supply chain operation system, which is divided into the upper middle order replenishment system, processing system and downstream order delivery and distribution system, and the operation of the system to do a detailed analysis. Finally, focuses on the problems and issues of network retail replenishment delivery environment were discussed in detail. Secondly, according to the characteristics of customer demand of network retail environment need not be satisfied immediately, ahead of the introduction the concept of demand information is analyzed in detail. Stock replenishment problems of four kinds of network retail situations: (1) the lead time the same single customer type pure network retail situation; (2) consider a pure online retail situation customer delivery priority; (3) retailers online and offline dual channel independent operating situation; (4) the situation of double channel interaction retailers online and offline, which allows online customer orders to pick up the goods store line. At the same time, establishes a dynamic batch model of lead time demand for replenishment plan each kind of situation, and analyzes the relationship between the models. Further, the demand time window perspective as a dynamic lot sizing problem all retail network under the situation of re construct a unified model, and analyzes the properties of the optimal solution, a dynamic programming algorithm for solving polynomial time design. Finally, the actual retail network Taking the data of the experimental case, found that replenishment of the proposed method significantly reduces the cost and inventory replenishment. Thirdly, based on the sales network sale new products is shorter, and the characteristics of businesses in the pre stock completely dragged period after Fu Fu, according to the pre period is fixed, the construction starting out of stock a batch replenishment model and two batch replenishment model. Then, on two models of property analysis, proved that the optimal solution exists, and gives the corresponding solution steps. Finally, the experimental results are obtained, the optimal conditions of the pre-sale period is not fixed a replenishment strategy and the pre-sale period is fixed under the two replenishment strategy. Results can guide the business according to the parameters of different products, to find the optimal replenishment plan accordingly in the pre-sale of different strategies. Finally, based on a new concept of "pre delivery operation" The application background, consider the network retailer's order fulfillment has two kinds of distribution mode of the third party logistics and the logistics between center and distribution station, studied the dual mode dynamic batch delivery problems. Firstly, using mixed integer programming to create a dynamic distribution model of a batch of two echelon supply chain system, and then the network flow programming the technology and properties of re modeling, optimal solution on the basis of the analysis, design and calculation of time complexity is O (T2) the exact dynamic programming algorithm. Finally, experimental results verify the validity and applicability of the algorithm.

【学位授予单位】：华中科技大学
【学位级别】：博士
【学位授予年份】：2016
【分类号】：F724.6;F724.2

【相似文献】