WANGER-WHITIN MODEL

Wagner-Whitin模型是一个考虑了不同周期需求的动态经济订货量模型,包括固定成本、持有成本和购买成本。该模型通过动态规划算法求解,等价于寻找网络中最短路径。在给定的4期规划中,通过比较不同订购策略的成本,确定最优订货决策,例如在第1期订货210单位,总成本为1380。
摘要由CSDN通过智能技术生成

PERODIC REVIEW: WAGNER-WHITIN MODEL

Wagner and Whitin 1958

Features of the dynamic economic lot-sizing model

  1. Demand: different in each period, unlike the EOQ model
  2. having zero-inventory ordering(ZIO)
  3. finite horizon, consisting of T T T period
  4. place order and receive order instantly
  5. holding costs are assessed based on the on-hand inventor

MIP Formulation

decision variables:

variablesmeaning
q t q_t qtnumber of units orderd
y t y_t yt1 if we order ,0 otherwise
x t x_t xtinventory level

parameters:

parametersmeaning
d t d_t dtdemand
K K Kfixed cost
h h hholding cost
c c cpurchase cost

the Wagner-Whitin model

KaTeX parse error: Undefined control sequence: \mbox at position 74: …& \tag{3.33}\\ \̲m̲b̲o̲x̲{s.t.}\quad &x_…

M: large number, could be set to ∑ s = t T d s \sum_{s=t}^Td_s s=tTds

Dynamic Programming Algorithm

http://t.csdn.cn/iyQ5Q

Let θ t \theta_t θt be the optimal cost in period t t t. We can define θ t \theta_t θt recursively in terms of θ s \theta_s θs for later periods s s s.

First define θ T + 1 ≡ 0 \theta_{T+1}\equiv0 θT+10

Then
θ t = min ⁡ t < s ≤ T + 1 { K + h ∑ i = t s − 1 ( i − t ) d i + θ s } (3.39) \theta_t=\min_{t<s{\leq}T+1}\left\{K+h\sum_{i=t}^{s-1}(i-t)d_i+\theta_s\right\}\tag{3.39} θt=t<sT+1min{K+hi=ts1(it)di+θs}(3.39)
Algorithm:

  1. θ T + 1 ← 0 \theta_{T+1}\leftarrow0 θT+10
  2. f o r t = T , . . . , 1 d o \mathbf{for}{\quad}t=T,...,1\mathbf{do} fort=T,...,1do
  3. θ t ← right-hand side of(3.39) {\quad}{\quad}\theta_t{\leftarrow}\text{right-hand side of(3.39)} θtright-hand side of(3.39)
  4. s t ← argmin in right-hand side of(3.39) {\quad}{\quad}s_t{\leftarrow}\text{argmin in right-hand side of(3.39)} stargmin in right-hand side of(3.39)
  5. e n d f o r \mathbf{end}\quad\mathbf{for} endfor
  6. r e t u r n θ t , s ( t ) for all t = 1 , . . . T \mathbf{return}\quad\theta_t,s(t)\quad\text{for all}{\quad}t=1,...T returnθt,s(t)for allt=1,...T

equivalent problem

The Wagner-Whitin model is equivalent to a network with T + 1 T+1 T+1 modes in which each node represents a time period and an arc from period t t t to period s s s represents ordering in period t t t to satisfy the demands of period t , t + 1 , . . . s − 1 t,t+1,...s-1 t,t+1,...s1. The cost the this arc is
K + h ∑ i = t s − 1 ( i − t ) d i K+h\sum_{i=t}^{s-1}(i-t)d_i K+hi=ts1(it)di
solving the Wagner-Whitin problem is equivalent to finding a shortest path through the network below:

在这里插入图片描述

eg1: a 4-period planning horizon model

parametersmeaningvalue
d t d_t dtdemand[90,120,80,70]
K K Kfixed cost500
h h hholding cost2 per period

absorbing state
θ 5 = 0 \theta_5=0 θ5=0
no need for comparison the only arc from node 4 to node 5 is weighted K K K
θ 4 = K + h ( 0 ⋅ d 4 ) + θ 5 , s ( 4 ) = 5 \theta_4=K+h(0{\cdot}d_4)+\theta_5,s(4)=5 θ4=K+h(0d4)+θ5,s(4)=5
comparing arc K K K with arc K + h D 4 K+hD_4 K+hD4
θ 3 = min ⁡ { K + h ( 0 ⋅ d 3 ) + θ 4 , K + h ( 0 ⋅ d 3 + 1 ⋅ d 4 ) + θ 5 } = min ⁡ { 1000 , 640 } = 640 , s ( 3 ) = 5 \begin{aligned} \theta_3&=\min\{K+h(0{\cdot}d_3)+\theta_4,K+h(0{\cdot}d_3+1{\cdot}d_4)+\theta_5\}\\ &=\min\{1000,640\}\\ &=640\end{aligned},s(3)=5 θ3=min{K+h(0d3)+θ4,K+h(0d3+1d4)+θ5}=min{1000,640}=640,s(3)=5

comparison of K K K, K + h D 3 K+hD_3 K+hD3, K + h D 3 + 2 h D 4 K+hD_3+2hD_4 K+hD3+2hD4
θ 2 = min ⁡ { K + h ( 0 ⋅ d 2 ) + θ 3 , K + h ( 0 ⋅ d 2 + 1 ⋅ d 3 ) + θ 4 , K + h ( 0 ⋅ d 2 + 1 ⋅ d 3 + 2 ⋅ d 4 ) + θ 5 } = min ⁡ { 1140 , 1160 , 940 } = 940 , s ( 2 ) = 5 \begin{aligned} \theta_2& \begin{aligned}=\min\{&K+h(0{\cdot}d_2)+\theta_3,K+h(0{\cdot}d_2+1{\cdot}d_3)+\theta_4,\\ &K+h(0{\cdot}d_2+1{\cdot}d_3+2{\cdot}d_4)+\theta_5\}\end{aligned}\\ &=\min\{1140,1160,940\}\\ &=940\end{aligned},s(2)=5 θ2=min{K+h(0d2)+θ3,K+h(0d2+1d3)+θ4,K+h(0d2+1d3+2d4)+θ5}=min{1140,1160,940}=940,s(2)=5

θ 1 = min ⁡ { K + h ( 0 ⋅ d 1 ) + θ 2 , K + h ( 0 ⋅ d 1 + 1 ⋅ d 2 ) + θ 3 , K + h ( 0 ⋅ d 1 + 1 ⋅ d 2 + 2 ⋅ d 3 ) + θ 4 , K + h ( 0 ⋅ d 1 + 1 ⋅ d 2 + 2 ⋅ d 3 + 3 ⋅ d 4 ) + θ 5 } = min ⁡ { 1440 , 1380 , 1560 , 1480 } = 1380 , s ( 1 ) = 3 \begin{aligned} \theta_1& \begin{aligned}=\min\{ &K+h(0{\cdot}d_1)+\theta_2,\\ &K+h(0{\cdot}d_1+1{\cdot}d_2)+\theta_3,\\ &K+h(0{\cdot}d_1+1{\cdot}d_2+2{\cdot}d_3)+\theta_4,\\ &K+h(0{\cdot}d_1+1{\cdot}d_2+2{\cdot}d_3+3{\cdot}d_4)+\theta_5 \}\end{aligned}\\ &=\min\{1440,1380,1560,1480\}\\ &=1380\end{aligned},s(1)=3 θ1=min{K+h(0d1)+θ2,K+h(0d1+1d2)+θ3,K+h(0d1+1d2+2d3)+θ4,K+h(0d1+1d2+2d3+3d4)+θ5}=min{1440,1380,1560,1480}=1380,s(1)=3

in period 1 we order and s ( 1 ) = 3 , Q 1 = d 1 + d 2 = 210 s(1)=3,Q_1=d_1+d_2=210 s(1)=3,Q1=d1+d2=210, and Q 3 = d 3 + d 4 = 150 Q_3=d_3+d_4=150 Q3=d3+d4=150, total cost is 1380

  • 4
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值