The value chain

Diseño de redes de distribución

Modelo base

𝑐𝑖𝑗 = 𝐶𝑜𝑠𝑡𝑜 𝑑𝑒 𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡𝑎𝑟 𝑢𝑛𝑎 𝑢𝑛𝑖𝑑𝑎𝑑 𝑑𝑒𝑙 𝑜𝑟𝑖𝑔𝑒𝑛 𝑖 𝑎𝑙 𝑑𝑒𝑠𝑡𝑖𝑛𝑜 𝑗.

𝑥𝑖𝑗 = 𝐶𝑎𝑛𝑡𝑖𝑑𝑎𝑑 𝑑𝑒 𝑢𝑛𝑖𝑑𝑎𝑑𝑒𝑠 𝑎 𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡𝑎𝑟 𝑑𝑒𝑙 𝑜𝑟𝑖𝑔𝑒𝑛 𝑖 𝑎𝑙 𝑑𝑒𝑠𝑡𝑖𝑛𝑜 𝑗.
𝐾𝑖 = 𝐶𝑎𝑝𝑎𝑐𝑖𝑑𝑎𝑑 𝑑𝑒 𝑒𝑙 𝑜𝑟𝑖𝑔𝑒𝑛 𝑖.
𝑛 𝑚

𝑀𝑖𝑛 𝑧 = ∑ ∑ 𝑐𝑖𝑗 𝑥𝑖𝑗

𝑖=1 𝑗=1

S.A.
𝑛

∑ 𝑥𝑖𝑗 = 𝐷𝑗 , ∀𝑗
𝑖=1

∑ 𝑥𝑖𝑗 ≤ 𝐾𝑖 , ∀𝑖
𝑗=1
𝑥𝑖𝑗 ≥ 0, ∀𝑖, ∀𝑗

Variación uno del modelo base

𝑐𝑖𝑗 = 𝐶𝑜𝑠𝑡𝑜 𝑑𝑒 𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡𝑎𝑟 𝑢𝑛𝑎 𝑢𝑛𝑖𝑑𝑎𝑑 𝑑𝑒𝑙 𝑜𝑟𝑖𝑔𝑒𝑛 𝑖 𝑎𝑙 𝑑𝑒𝑠𝑡𝑖𝑛𝑜 𝑗.

𝑥𝑖𝑗 = 𝐶𝑎𝑛𝑡𝑖𝑑𝑎𝑑 𝑑𝑒 𝑢𝑛𝑖𝑑𝑎𝑑𝑒𝑠 𝑎 𝑡𝑟𝑎𝑛𝑠𝑝𝑜𝑟𝑡𝑎𝑟 𝑑𝑒𝑙 𝑜𝑟𝑖𝑔𝑒𝑛 𝑖 𝑎𝑙 𝑑𝑒𝑠𝑡𝑖𝑛𝑜 𝑗.
𝐾𝑖 = 𝐶𝑎𝑝𝑎𝑐𝑖𝑑𝑎𝑑 𝑑𝑒 𝑒𝑙 𝑜𝑟𝑖𝑔𝑒𝑛 𝑖.
1 𝑠𝑖 𝑑𝑒𝑐𝑖𝑑𝑒 𝑎𝑏𝑟𝑖𝑟 𝑏𝑜𝑑𝑒𝑔𝑎
𝑦𝑖 = 𝑣𝑎𝑟𝑖𝑎𝑏𝑙𝑒 𝑏𝑖𝑛𝑎𝑟𝑖𝑎 𝑑𝑒 𝑑𝑒𝑐𝑖𝑠𝑖ó𝑛 {
0 𝑑𝑒 𝑙𝑜 𝑐𝑜𝑛𝑡𝑟𝑎𝑟𝑖𝑜
𝑓𝑖 = 𝐶𝑜𝑠𝑡𝑜 𝑑𝑒 𝑎𝑏𝑟𝑖𝑟 𝑢𝑛𝑎 𝑏𝑜𝑑𝑒𝑔𝑎.
𝑛 𝑚 𝑚

𝑀𝑖𝑛 𝑧 = ∑ ∑ 𝑐𝑖𝑗 𝑥𝑖𝑗 + ∑ 𝑓𝑖 𝑦𝑖

𝑖=1 𝑗=1 𝑗=1

S.A.
𝑛

∑ 𝑥𝑖𝑗 = 𝐷𝑗 , ∀𝑗
𝑖=1

∑ 𝑥𝑖𝑗 ≤ 𝐾𝑖 𝑌𝑖 , ∀𝑖
𝑗=1

𝑋𝑖𝑗 ≥ 0, ∀𝑗, ∀𝑗
Inventarios

EOQ (Economic Order Quantity)

𝐷 = 𝐴𝑛𝑛𝑢𝑎𝑙 𝑑𝑒𝑚𝑎𝑛𝑑
𝑆 = 𝑆𝑒𝑡𝑢𝑝 𝑜𝑟 𝑜𝑟𝑑𝑒𝑟 𝑐𝑜𝑠𝑡
𝐶 = 𝐶𝑜𝑠𝑡 𝑝𝑒𝑟 𝑢𝑛𝑖𝑡
ℎ = 𝐻𝑜𝑙𝑑𝑖𝑛𝑔 𝑐𝑜𝑠𝑡 𝑝𝑒𝑟 𝑦𝑒𝑎𝑟 𝑎𝑠 𝑎 𝑓𝑟𝑎𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 𝑐𝑜𝑠𝑡
𝐻 = 𝐻𝑜𝑙𝑑𝑖𝑛𝑔 𝑐𝑜𝑠𝑡 𝑝𝑒𝑟 𝑢𝑛𝑖𝑡 𝑝𝑒𝑟 𝑦𝑒𝑎𝑟 = ℎ𝐶
𝑄 ∗ = 𝑂𝑝𝑡𝑖𝑚𝑎𝑙 𝑙𝑜𝑡𝑒 𝑠𝑖𝑧𝑒
𝑛∗ = 𝑂𝑝𝑡𝑖𝑚𝑎𝑙 𝑜𝑟𝑑𝑒𝑟 𝑓𝑟𝑒𝑞𝑢𝑒𝑛𝑐𝑦
𝐿 = 𝐿𝑒𝑎𝑑 𝑡𝑖𝑚𝑒
𝑅𝑂𝑃 = 𝑅𝑒𝑜𝑟𝑑𝑒𝑟 𝑝𝑜𝑖𝑛𝑡

Sin faltantes

2𝐷𝑆
𝑄∗ = √
𝐻

𝐷𝐻 𝐷
𝑛∗ = √ = ∗
2𝑆 𝑄
𝐷 𝑄∗
𝐶𝑇(𝑄 ∗ ) = ∙ 𝑆 + ∙ 𝐻 + 𝐶𝐷
𝑄∗ 2
𝑄∗
𝐼𝑃 = 𝐼𝑛𝑣𝑒𝑛𝑡𝑎𝑟𝑖𝑜 𝑝𝑟𝑜𝑚𝑒𝑑𝑖𝑜 =
2
𝑄∗
𝐴𝐹𝑇 = 𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑓𝑙𝑜𝑤 𝑡𝑖𝑚𝑒 =
2𝐷
𝑅𝑂𝑃 = 𝐷 ∙ 𝐿

Con faltantes

𝐹 = 𝑁ú𝑚𝑒𝑟𝑜 𝑚á𝑥𝑖𝑚𝑜 𝑑𝑒 𝑓𝑎𝑙𝑡𝑎𝑛𝑡𝑒𝑠

𝐶𝐹 = 𝐶𝑜𝑠𝑡𝑜 𝑝𝑜𝑟 𝑓𝑎𝑙𝑡𝑎𝑛𝑡𝑒

2𝐷𝑆 𝐻 + 𝐶𝐹
𝑄∗ = √ ∙√
𝐻 𝐶𝐹
 𝐷𝐻 𝐷
𝑛∗ = √ = ∗
2𝑆 𝑄
𝐻
𝐹 = 𝑄∗ ∙ ( )
𝐻 + 𝐶𝐹
𝑅 = (𝐷 ∙ 𝐿) − 𝐹
𝐷 (𝑄 ∗ − 𝐹)2 𝐹2
𝐶𝑇(𝑄 ∗ ) = ∙ 𝑆 + ∙ 𝐻 + ∙𝐶
𝑄∗ 2 2𝑄 ∗ 𝐹
𝑄∗
𝐼𝑛𝑣𝑒𝑛𝑡𝑎𝑟𝑖𝑜 𝑝𝑟𝑜𝑚𝑒𝑑𝑖𝑜 =
2
𝑄∗
𝑇𝐹𝑃 = 𝑇𝑖𝑒𝑚𝑝𝑜 𝑑𝑒 𝐹𝑙𝑢𝑗𝑜 𝑃𝑟𝑜𝑚𝑒𝑑𝑖𝑜 =
2𝐷

EPL (Economic Production Lot-size)

𝐷 = 𝐴𝑛𝑛𝑢𝑎𝑙 𝑑𝑒𝑚𝑎𝑛𝑑
𝑆 = 𝑆𝑒𝑡𝑢𝑝 𝑜𝑟 𝑜𝑟𝑑𝑒𝑟 𝑐𝑜𝑠𝑡
𝐶 = 𝐶𝑜𝑠𝑡 𝑝𝑒𝑟 𝑢𝑛𝑖𝑡
ℎ = 𝐻𝑜𝑙𝑑𝑖𝑛𝑔 𝑐𝑜𝑠𝑡 𝑝𝑒𝑟 𝑦𝑒𝑎𝑟 𝑎𝑠 𝑎 𝑓𝑟𝑎𝑐𝑡𝑖𝑜𝑛 𝑜𝑓 𝑝𝑟𝑜𝑑𝑢𝑐𝑡 𝑐𝑜𝑠𝑡
𝐻 = 𝐻𝑜𝑙𝑑𝑖𝑛𝑔 𝑐𝑜𝑠𝑡 𝑝𝑒𝑟 𝑢𝑛𝑖𝑡 𝑝𝑒𝑟 𝑦𝑒𝑎𝑟 = ℎ𝐶
𝑄 ∗ = 𝐿𝑜𝑡𝑒 ó𝑝𝑡𝑖𝑚𝑜 𝑑𝑒 𝑝𝑟𝑜𝑑𝑢𝑐𝑐𝑖ó𝑛
𝑛∗ = 𝑁ú𝑚𝑒𝑟𝑜 𝑑𝑒 𝑐𝑜𝑟𝑟𝑖𝑑𝑎𝑠 𝑑𝑒 𝑝𝑟𝑜𝑑𝑢𝑐𝑐𝑖ó𝑛 (𝐴𝑛𝑢𝑎𝑙)
𝐿 = 𝐿𝑒𝑎𝑑 𝑡𝑖𝑚𝑒
𝑅𝑂𝑃 = 𝑅𝑒𝑜𝑟𝑑𝑒𝑟 𝑝𝑜𝑖𝑛𝑡
𝑃 = 𝐶𝑎𝑝𝑎𝑐𝑖𝑑𝑎𝑑 𝑑𝑒 𝑝𝑟𝑜𝑑𝑢𝑐𝑐𝑖ó𝑛 (𝐴𝑛𝑢𝑎𝑙)
𝑆 = 𝐶𝑜𝑠𝑡𝑜 𝑑𝑒 𝑎𝑙𝑖𝑠𝑡𝑎𝑚𝑖𝑒𝑛𝑡𝑜 𝑝𝑎𝑟𝑎 𝑒𝑚𝑝𝑒𝑧𝑎𝑟 𝑎 𝑝𝑟𝑜𝑑𝑢𝑐𝑖𝑟

2𝐷𝑆
𝑄∗ = √
𝐷
𝐻 (1 − 𝑃 )

𝐷𝐻 𝐷
𝑛∗ = √ = ∗
2𝑆 𝑄

𝑅𝑂𝑃 = (𝐷 ∙ 𝐿)
𝐷
𝐷 𝑄 ∗ ∙ (1 − 𝑃 )
𝐶𝑇(𝑄 ∗ ) = ∗ ∙ 𝑆 + ∙ 𝐻 + 𝐶𝐷
𝑄 2
𝑄∗
𝑇𝑖𝑒𝑚𝑝𝑜 𝑐𝑜𝑟𝑟𝑖𝑑𝑎 𝑝𝑟𝑜𝑑𝑢𝑐𝑐𝑖ó𝑛 = 𝑎ñ𝑜𝑠
𝐷
𝐷
𝑇𝑎𝑠𝑎 𝑑𝑒 𝑢𝑡𝑖𝑙𝑖𝑧𝑎𝑐𝑖ó𝑛 = 𝑄 ∗ ∙ (1 − ) %
𝑃
Safety inventory and cycle service level

Measuring demand uncertainly

𝐷 = 𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑑𝑒𝑚𝑎𝑛𝑑 𝑝𝑒𝑟 𝑝𝑒𝑟𝑖𝑜𝑑

𝜎𝐷 = 𝑆𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑒𝑣𝑖𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 𝑑𝑒𝑚𝑎𝑛𝑑 𝑝𝑒𝑟 𝑝𝑒𝑟𝑖𝑜𝑑
𝐿 = 𝐿𝑒𝑎𝑑 𝑡𝑖𝑚𝑒
= 𝑡𝑖𝑚𝑒 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 𝑤ℎ𝑒𝑛 𝑎𝑛 𝑜𝑟𝑑𝑒𝑟 𝑖𝑠 𝑝𝑙𝑎𝑐𝑒𝑑 𝑎𝑛𝑑 𝑤ℎ𝑒𝑛 𝑖𝑡 𝑖𝑠 𝑟𝑒𝑐𝑖𝑣𝑒𝑑
𝑃 = 𝐷𝑒𝑚𝑎𝑛𝑑 𝑑𝑢𝑟𝑖𝑛𝑔 𝑘 𝑝𝑒𝑟𝑖𝑜𝑑𝑠 = 𝑘 ∙ 𝐷
Ω = 𝑠𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑒𝑣𝑖𝑎𝑡𝑜𝑛 𝑜𝑓 𝑑𝑒𝑚𝑎𝑛𝑑 𝑑𝑢𝑟𝑖𝑛𝑔 𝑘 𝑝𝑒𝑟𝑖𝑜𝑑𝑠 = 𝜎𝑅 ∙ √𝑘
𝜇 = 𝑀𝑒𝑎𝑛
𝜎 = 𝑆𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑒𝑣𝑖𝑎𝑡𝑖𝑜𝑛
𝜇
𝐶𝑜𝑟𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡 𝑜𝑓 𝑣𝑎𝑟𝑖𝑎𝑡𝑖𝑜𝑛 = 𝑐𝑣 =
𝜎
= 𝑠𝑖𝑧𝑒 𝑜𝑓 𝑢𝑛𝑐𝑒𝑟𝑡𝑎𝑖𝑛𝑡𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑣𝑒 𝑡𝑜 𝑑𝑒𝑚𝑎𝑛𝑑

Safety level and cycle service

𝐿 = 𝐿𝑒𝑎𝑑 𝑡𝑖𝑚𝑒 𝑓𝑜𝑟 𝑟𝑒𝑝𝑙𝑒𝑛𝑖𝑠ℎ𝑚𝑒𝑛𝑡

𝐷 = 𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑑𝑒𝑚𝑎𝑛𝑑 𝑝𝑒𝑟 𝑢𝑛𝑖𝑡 𝑡𝑖𝑚𝑒
𝜎𝐷 = 𝑆𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑒𝑣𝑖𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 𝑑𝑒𝑚𝑎𝑛𝑑 𝑝𝑒𝑟 𝑝𝑒𝑟𝑖𝑜𝑑
𝐷𝐿 = 𝑀𝑒𝑎𝑛 𝑑𝑒𝑚𝑎𝑛𝑑 𝑑𝑢𝑟𝑖𝑛𝑔 𝑙𝑒𝑎𝑑 𝑡𝑖𝑚𝑒
𝜎𝐿 = 𝑆𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑒𝑣𝑖𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 𝑑𝑒𝑚𝑎𝑛𝑑 𝑑𝑢𝑟𝑖𝑛𝑔 𝑙𝑒𝑎𝑑 𝑡𝑖𝑚𝑒
𝑅𝑂𝑃 = 𝑅𝑒𝑜𝑟𝑑𝑒𝑟 𝑝𝑜𝑖𝑛𝑡

𝐷𝐿 = 𝐷 ∙ 𝐿
𝜎𝐿 = √𝐿 ∙ 𝜎𝐷

𝒔𝒔 = 𝑺𝒂𝒇𝒆𝒕𝒚 𝒊𝒏𝒗𝒆𝒏𝒕𝒐𝒓𝒚

𝑠𝑠 = 𝑅𝑂𝑃 − 𝐷𝐿
𝑠𝑠 = 𝐹𝑠−1 (𝐶𝑆𝐿) ∙ 𝜎𝐿 = 𝑁𝑂𝑅𝑀𝑆𝐼𝑁𝑉(𝑆𝐿 𝑑𝑒𝑠𝑖𝑟𝑒𝑑) ∙ 𝜎𝐿
𝑄
𝐶𝑦𝑐𝑙𝑒 𝑖𝑛𝑣𝑒𝑛𝑡𝑜𝑟𝑦 =
2
𝑄
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑖𝑛𝑣𝑒𝑛𝑡𝑜𝑟𝑦 = + 𝑠𝑠
2
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑖𝑛𝑣𝑒𝑛𝑡𝑜𝑟𝑦
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑓𝑙𝑜𝑤 𝑡𝑖𝑚𝑒 =
𝑡ℎ𝑟𝑜𝑢𝑔ℎ𝑝𝑢𝑡 (𝐷)

𝑪𝑺𝑳 = 𝑪𝒚𝒄𝒍𝒆 𝒔𝒆𝒓𝒗𝒊𝒄𝒆 𝒍𝒆𝒗𝒆𝒍

𝜎𝐿 = √𝐿 ∙ 𝜎𝐷
𝐶𝑆𝐿 = 𝐹(𝑅𝑂𝑃, 𝐷𝐿 , 𝜎𝐿 ) = 𝐹(𝐷𝐿 + 𝑠𝑠, 𝐷𝐿 , 𝜎𝐿 ) = 𝑁𝑂𝑅𝑀𝐷𝐼𝑆𝑇(𝐷𝐿 + 𝑠𝑠, 𝐷𝐿 , 𝜎𝐿 , 1)
Fill rate

𝑓𝑟 = 𝐹𝑖𝑙𝑙 𝑟𝑎𝑡𝑒
𝐸𝑆𝐶 = 𝐸𝑥𝑝𝑒𝑐𝑡𝑒𝑑 𝑠ℎ𝑜𝑟𝑡𝑎𝑔𝑒 𝑝𝑒𝑟 𝑐𝑦𝑐𝑙𝑒 (𝑎𝑣𝑒𝑟𝑎𝑔𝑒 𝑑𝑒𝑚𝑎𝑛𝑑 𝑖𝑛 𝑒𝑥𝑐𝑒𝑠𝑠 𝑜𝑓 𝑟𝑒𝑜𝑟𝑑𝑒𝑟
𝑝𝑜𝑖𝑛𝑡 𝑖𝑛 𝑒𝑎𝑐ℎ 𝑟𝑒𝑝𝑙𝑒𝑛𝑖𝑠ℎ𝑚𝑒𝑛𝑡 𝑐𝑦𝑐𝑙𝑒)
𝑠𝑠 = 𝑆𝑎𝑓𝑒𝑡𝑦 𝑖𝑛𝑣𝑒𝑛𝑡𝑜𝑟𝑦
𝑄 = 𝑂𝑟𝑑𝑒𝑟 𝑞𝑢𝑎𝑛𝑡𝑖𝑡𝑦

𝐸𝑆𝐶 𝑄 − 𝐸𝑆𝐶
𝑓𝑟 = 1 − =
𝑄 𝑄
𝑠𝑠 𝑠𝑠
𝐸𝑆𝐶 = −𝑠𝑠 ∙ (1 − 𝐹𝑆 ( )) + 𝜎𝐿 ∙ 𝑓𝑆 ( )
𝜎𝐿 𝜎𝐿
𝑠𝑠 𝑠𝑠
𝐸𝑆𝐶 = −𝑠𝑠 ∙ (1 − 𝑁𝑂𝑅𝑀𝐷𝐼𝑆𝑇 ( , 0,1,1)) + 𝜎𝐿 ∙ 𝑁𝑂𝑅𝑀𝐷𝐼𝑆𝑇 ( , 0,1,0)
𝜎𝐿 𝜎𝐿

Impact of supply uncertainly

𝐷 = 𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑑𝑒𝑚𝑎𝑛𝑑 𝑝𝑒𝑟 𝑝𝑒𝑟𝑖𝑜𝑑

𝜎𝐷 = 𝑆𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑒𝑣𝑖𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 𝑑𝑒𝑚𝑎𝑛𝑑 𝑝𝑒𝑟 𝑝𝑒𝑟𝑖𝑜𝑑
𝐿 = 𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑙𝑒𝑎𝑑 𝑡𝑖𝑚𝑒
𝑆𝐿 = 𝑆𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑒𝑣𝑖𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 𝑙𝑒𝑎𝑑 𝑡𝑖𝑚𝑒

𝐷𝐿 = 𝐷 ∙ 𝐿
𝜎𝐿 = √𝐿 ∙ 𝜎𝐷2 + 𝐷2 ∙ 𝑆𝐿2
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑖𝑛𝑣𝑒𝑛𝑡𝑜𝑟𝑦
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑓𝑙𝑜𝑤 𝑡𝑖𝑚𝑒 =
𝑡ℎ𝑟𝑜𝑢𝑔ℎ𝑝𝑢𝑡 (𝐷)
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑖𝑛𝑣𝑒𝑛𝑡𝑜𝑟𝑦
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑓𝑙𝑜𝑤 𝑡𝑖𝑚𝑒 =
𝑡ℎ𝑟𝑜𝑢𝑔ℎ𝑝𝑢𝑡 (𝐷)
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑖𝑛𝑣𝑒𝑛𝑡𝑜𝑟𝑦
𝐴𝑣𝑒𝑟𝑎𝑔𝑒 𝑓𝑙𝑜𝑤 𝑡𝑖𝑚𝑒 =
𝑡ℎ𝑟𝑜𝑢𝑔ℎ𝑝𝑢𝑡 (𝐷)