SCM-2 Logistics Network Configuration 供应链管理.ppt

1、物流网络设计 Logistics Network Configuration,Outline,What is it? 方法Methodology 建模Modeling 数据合并Data Aggregation 确认可靠性Validation Solution Techniques,物流网络The Logistics Network,物流网络包括: 节点: Vendors（供应商）, Manufacturing Centers, Warehouse/ Distribution Centers, and Customers Raw materials原材料 and finished product

2、s that flow between the facilities.,决策的分类Decision Classifications,战略层面: 涉及到资本投入等有着长期影响的那些决策。如： 决定新工厂、配送中心、仓库的选址、数目、规模等。 新生产设备的购买及工厂内生产方式的选择etc.,策略层面: Effective allocation of manufacturing(生产等资源的有效分配) and distribution resources over a period of several months 工人规模 库存控制的方式 配送渠道的选择 运输、配送及替代方案的选择,决策的分类D

3、ecision Classifications,操作层面: Includes day-to-day operational decisions The assignment（分派） of customer orders to individual machines Dispatching, expediting（催单） and processing orders Vehicle scheduling （车辆路线设计）,决策的分类Decision Classifications,网络设计: 主要解决的问题,决定最优的库房、工厂的地点、数目、规模 决定最优的供应方案： 哪家工厂（供应商）生产（供应

4、）哪种产品或部件 决定最优的配送路径 哪个库房（配送中心）服务哪个区域的客户,主要目标为平衡服务水准与 生产、供应成本 库存持有成本 订单处理成本 运输成本 That is, we would like to find a minimal-annual-cost configuration of the distribution network that satisfies product demands at specified customer service levels.,网络设计: 主要解决的问题,网络设计的工具:Major Components,绘图Mapping Mapping

5、allows you to visualize（可视化） your supply chain and solutions Mapping the solutions allows you to better understand different scenarios（场景、方案） Color coding, sizing, and utilization indicators allow for further analysis 数据 Data specifies the costs of your supply chain The baseline cost data should mat

6、ch your accounting data The output data allows you to quantify changes to the supply chain 优化工具相关软件如LINGO、CMOS等。,Mapping Allows You to Visualize Your Supply Chain,Displaying the Solutions Allows you To Compare Scenarios,网络设计所需要的相关数据,1. 所有产品的清单 2. 客户、供应来源的地理区域 3. 每区域客户对每种产品的需求信息。 4. 运输费率 5. 库房的相关成本 6

7、. 订单的模式如订单频率、规模、内容特点、有无季节性等等。 7. 订单处理成本 8. 客户服务水平,信息太多怎么办？,Customers and Geocoding 按地理位置进行编码 销售数据通常是按照地理区域来统计的。,为什么要进行数据合并Why Aggregate?,节省数据处理成本 最详细的数据可能得不到如按每个县、村等。 保证模型的可操作性,数据合并Data Aggregation,合并的两种方式: 需求的合并:将顾客按位置或服务等级进行合并,在按位置进行合并的情况下,无数个顾客合并为少数的比如几十个顾客区域. 按物品进行合并, 比如按物品物理化学特性配送方式等.,按客户的地理位置进

8、行数据合并,Customers located in close proximity接近 are aggregated using a grid网格 network or clustering（分组） techniques. All customers within a single cell or a single cluster are replaced by a single customer located at the centroid中心 of the cell or cluster. We refer to a cell or a cluster as a customer zo

9、ne顾客区域.,可能产生的问题,过分合并会导致模型处理的不准确 什么影响了数据合并的有效性？ 合并后区域的数量 各区域内客户分布的不同形态,合理的数据合并的方法,合并后至少有150-200个区域。 确保每个区域的总需求量大致相同 使合并后的中心点在各区域的中心位置 In this case, the error is typically no more than 1%,例：最优库房数量的选择,1个工厂、1种产品 客户数据 原始数据有18,000 个客户地点 合并后有800 个客户地点,Comparing Output输出结果的比较,合并前的原始数据,合并后的数据,Minimize the co

10、st of your logistics network without compromising service levels,增加库房数量会。,提高对客户响应时间，从而提高服务水平 库存增加从而库存成本增加。 其它费用如日常管理成本增加 总体而言，运输成本会减少，但具体而言 Reduce outbound transportation costs Increase inbound transportation costs,优化的方法,数学优化技术: Exact algorithms算法: 寻找最优解 Heuristics启发式算法: 寻找满意解 模拟方法,Logistics Network

11、 Design,Logistics Network Design,Logistics Network Design,例,一种产品 两个工厂p1 与 p2 P1 年生产能力为200,000 units. p2年生产能力为60,000 units. 两工厂生产成本相同. 两个仓库w1 and w2 ，其库存处理成本相同。 三个市场c1,c2 and c3 ，需求分别为50,000, 100,000 and 50,000.,表 1 单位配送成本,Why Optimization Matters?,方案1,方案2,线性规划法求解,模型,The Optimal Strategy,HP中国售后备件供应网络

12、的构建,Presented by: Chen Wan, Kwan Sin Man, Liaw Chya yi, Tan Yan Ting, Yan Tao,问题描述,目前有两个中心备件库房Beijing and Shanghai From these 2 hubs, service parts are being delivered to 46 cities across the country 目前服务水准为 3D18 通过建立额外的HUB来提高对备件需求的响应时间 新的服务水准设定为2D10 To achieve this service level, they are willing t

13、o set aside additional budget,模型与项目说明,仅考虑32个最重要的中心城市 备件需求量数据为过去12个月用量的平均 每天接受订单的截至试点为下午5点，因此，从HUB满足该订单的最长时间为17个小时。 Holding cost includes labour cost, insurance and other related costs Transportation cost includes labour cost, fuel cost, loading/unloading cost 库房建立成本Setup cost包括库房租金、设备维护费用、材料费等等。,研究目

14、的,Minimize the budget to establish additional hubs whilst satisfying the coverage industry benchmark Coverage（覆盖区域） is defined as the percentage of demand that can meet the new service level, 2D10.,需要求解的问题,Number of hubs Location of hubs Assignment of non-hubs to hubs Trade-off between the total tra

15、nsportation cost and the setup costs of additional hubs,问题的建模,非线性整数规划Nonlinear Integer Programming Problem 各集合的定义: Demand Cities, C = Shenzhen深圳, Zhuhai珠海, Shantou汕头, Zhanjiang湛江, Dongguan 东莞, Taizhou台洲, Zhongshan中山, Chongqing重庆, Changsha长沙,Zhengzhou 郑州, Hefei合肥, Nanchang南昌, Yichang宜昌, Harbin哈尔滨, Ch

16、angchun长春, Dalian大连, Nanning南宁, Lanzhou兰州, Yinchuan银川, Xiamen厦门, Quanzhou泉州, Qingdao青岛, Yantai烟台, Jinan济南, Fuzhou福州,Xian西安, Shenyang沈阳, Chengdu成都,Guangzhou 广州, Wuhan武汉, Beijing北京, Shanghai上海 ,Problem Formulation,Sets Definition (cont) Possible supply cities, C2 = same as C + Beijing 2北京2, Shanghai 2

17、 上海2 我们规定Beijing 2 and Shanghai 2来满足那些无法被任何一个城市在2D10的时间内覆盖的区域，即我们规定在那样的情况下，这些城市的备件直接由北京或上海供应,决策变量,Kij is a binary integer and is 1 when city i is being serviced by city j, 0 otherwise. Kjj is 1 when city j is chosen as a hub to service other cities. U(i,j)=0, Di Uij, the units of product shipped fro

18、m hub city j to demand city i Coverage is the ratio of demand covered by the hubs at 2D10 to the total demand at the old 3D18 service level,参数说明,D(i) = 城市i 的月平均备件用量 HO(j) = 城市j 的单位库存持有成本 ST(j) =在城市j建立库房的成本 transcost(i,j) = cost of transportation per unit from hub city j to city i If travelling time

19、between city i and city j is beyond 17hrs, transcost(i,j) is set to M, where M is an infinitely large integer.,目标函数,包括3个部分 库存持有成本 = Kij x Uij x HOj represents the holding cost of item being held at hub j that is to be transported to service city i 运输成本 = Kij x Uij x transcost(i,j) represents the tra

20、nsportation cost of Uij amount of items from hub city j to service city i 库房建立成本 = Kjj x STj represents the setup cost of a hub in city j Min Budget,约束条件,1 city to only 1 hub matching requirements 一个城市仅仅能被一个HUB来供货，进一步，一个城市如果被选为HUB的话，那么其自己的需求仅能由自己来满足。Since the sum of Kij is 1, each demand city is onl

21、y matched to 1 hub city. The hub city is matched to itself when Kij=1 for i=j. Only hub cities can service demand cities A city can only be served by another city if it is identified as a hub since j is only a hub if Kjj=1, and thus Kij can then be 1. Therefore, city i can only be served by city j i

22、f j is identified as a hub.,约束条件,Usage constrain Since one demand city is only served by one hub, the usage should be equal to the city demand such that no shortage should occur. Coverage constraint This constrain ensures that the new hub network would be able to cover at least 85% of the total dema

23、nd with the new 2D10 service level,Non-negativity Constraints No negative transportation flow from hub to demand cities A cities is either served (kij=1) or not served (kij=0) Budget 0 There cannot be negative budget Coverage 0 There cannot be negative coverage, worst scenario is 0,约束条件,Budget = 744

24、,503 Coverage = 93.31% 6 additional hubs to be set up, besides SH and BJ Zhongshan, Chengdu, Wuhan, Shenyang, Jinan and Xian,结果,Cities that cannot be served within 2D10 by any hubs. These are cities with low demand. It is not cost efficient to set up a hub specially to serve these cities.,结果,Compari

25、son of Coverage against Budget,Min Cost,结果,Discussion,2002年HP的实际做法 Heuristics Cluster cities with geographical proximity to form a hub Designate the city with the highest sales revenue and historical demand as the hub Budget = 803,945 with 97.39% coverage,Re,Add one more cost component to the proble

26、m Evaluate the risk pooling effect Assumptions Average lead time for vendor to deliver to each hub is 1 month All vendors have the same lead time Safety factor, k is set at 97%,Model Extension,Re,Min Budget where is the standard dev. of the total demand for each cluster cover by the hub j Dmi the historical demand of city j in month m L is the average lead time for the vendors to deliver the goods to