Scientific Research

An Academic Publisher

Research of Enterprise Storage Ecosystem Based on Storage Theory and Nonlinear Discrete Optimization

**Author(s)**Leave a comment

*s*,

*S*) random storage strategy model, a Markov chain model, and a nonlinear discrete programming model, aiming at maximizing the profit per cycle of every branch and further maximizing the company’s total profit per cycle. Among them, the random storage strategy model establishes a security zone of inventory for every branch, that is, it can meet consumers’ demand without spending too much storage costs. The Markov chain model is used to get the probability of losing sales opportunities in every branch. The nonlinear discrete programming model takes into account the horizontal transferring among branches, which further maximizes the company’s overall profit expectations. The three models above can be used to formulate inventory strategies, assess risks, and provide advice for every branch in order to form a complete storage ecosystem and provide constructive suggestions for the company’s operations.

KEYWORDS

1. Introduction

With the continuous progress of society, the scale of some companies is gradually expanding. The inventory management capability of an enterprise is one of the major manifestations of its profitability. The improper management of a company’s inventory can cause its profits to decline. In severe cases, supply-sales chains can even break. For large-scale enterprises, the storage level of their branches and the coordination of inventory among their branches are a very important issue [1] [2] [3] [4] .

At present, researchers have drawn some research results on the formulation of corporate goods inventory management strategies. For example, Singh [5] presented a conceptual methodology for inventory issue, forming a framework for companies to deal with inventory issues. Phouratsamay [6] studied the lot-sizing problem that occurs in a supply chain composed of a supplier and a retailer and found the problem is NP-hard when the inventory bounds are set on the supplier level. Archetti [7] integrated the inventory management problem with the pickup and delivery vehicle routing problems, showing the integrated policy cost much less than a non-integrated policy. Kong Shuxia [8] proposed the (s, S) random storage strategy to study the store purchase plans. Zhu Laihui [9] also adopted the (s, S) random storage strategy for the study of storage planning, but he studied special inventory like aviation ammunition.

The innovation of this paper lies in the combination of the (s, S) random storage strategy model with the Markov chain and the nonlinear discrete programming model. It not only helps carry out the inventory plan of a single branch, but also studies the entire company’s inventory ecosystem. This provides a more constructive proposal for corporate decision makers.

2. Problem Analysis

1) For every branch’s storage plan, given that the demand for the product is random at each cycle, the assumption is that demand is subject to Poisson distribution. Storage costs and out-of-stock losses should be taken into account to achieve a balance of interests between the two. In addition, the lower limit and upper limit of inventory should be considered. Therefore, the (s, S) random storage strategy is adopted to establish the storage strategy of every branch.

2) For the evaluation of the stock-out risk of every branch, in order to determine the stock-out probability of each shop, a Markov chain model is proposed. The inventory quantity at the beginning of each cycle of every branch is taken as the state variable. The distribution of demand and the state transfer matrix can also be list out according to the established storage strategy. Then the probability vector in steady state can be obtained. Finally, the full probability formula can be used to determine the probability of out-of-stock for every branch, that is, the probability of losing sales opportunities.

3) For the construction of the company’s storage ecosystem, that is, the horizontal transfer plan among every branch, a discrete optimization model is established with the objective function of the total inventory cost and the out-of-stock loss cost after the entire store system is allowed to carry out horizontal transfer. The objective function is minimized by solving the optimal call-out and call-in amount of every branch. Finally, the best transfer plan can be obtained.

3. The Mathematical Model

3.1. The Single-Branch Storage Strategy

Since the sales volume of the product in the store is random, the inventory of the product is checked at the end of each cycle so that the order plan for the next cycle can be formulated in time. In order to decrease the storage cost, the store’s backlog of liquidity and the purchase at the end of the cycle should not be excessive, but it should not be too small, which will result in the shortage of goods in the next cycle and affect the turnover. In this case, the ordering strategy adopted in this paper is to formulate a lower bound s and an upper bound S. When the stock at the end of the period is not less than s, the order will not be placed; when the stock is less than s, the order will be placed, and the order quantity will make the next week’s inventory amount reach S. This strategy is called (s, S) random storage strategy [8] .

Poisson distribution was published by the French mathematician Siméon-Denis Poisson in 1838. It is suitable for describing the number of random events occurring within a unit of time. The Poisson distribution’s probability density function is:

$p\left(X=k\right)=\frac{{\lambda}^{k}}{k!}{\text{e}}^{-\lambda},\text{\hspace{0.17em}}k=0,1,\cdots $ (1)

The parameter λ of the Poisson distribution is the average incidence of random events per unit time (or unit area).

Take Wuhan Zongguan Xihui Branch as an example, it is known that the purchase cost per batch is 100 yuan, the profit of each product is 700 yuan, and the storage fee for each item is 100 yuan. If there is an out-of-stock situation, the loss of each item will be 700 yuan. Set the demand for the product during a period as r, which can be regarded as a random variable, and meet the Poisson distribution of the parameter λ. Because the estimated average demand for the item in each sales cycle in Wuhan Zongguan Xihui Branch is 4.1, so the value of λ is set as 4.1.

Assuming that the end-of-cycle inventory is x, and the purchase volume is u, the inventory quantity at the beginning of the next cycle is $x+u$ , and the storage amount in a sales cycle is $x+u-r$.

Assuming the expectation of a total profit for a sales cycle is J. Due to the fact that:

Total profit = total sales of goods − incoming goods − storage fees.

So, when $u=0$ ,

$J=700r-L\left(x\right)$ (2)

where $L\left(x\right)$ is the expectation of cost of storing the product and the cost of missing goods in a sales cycle, and its expression is:

$L\left(x\right)=100{\displaystyle \underset{r=0}{\overset{x}{\sum}}\left(x-r\right)p\left(r\right)}+700{\displaystyle \underset{r=x}{\overset{\infty}{\sum}}\left(r-x\right)p\left(r\right)}$ (3)

where $p\left(r\right)$ is the density function of Poisson distribution of the parameter 4.1.

When $u>0$ ,

$J=700r-100-L\left(x+u\right)$ (4)

To sum up, the expression of one cycle of total profit is:

$J\left(u\right)=\{\begin{array}{l}2770-L\left(x+u\right),u>0\\ 2870-L\left(x\right),u=0\end{array}$ (5)

The method is provided in this paper for solving the lower and upper bounds of the ordering strategy (again using Wuhan Zongguan Xihui Branch as an example):

1) Solving the upper bound S

When $u>0$ , to maximize total profit, differentiate $J\left(u\right)$ :

$J\left(u+1\right)-J\left(u\right)=-100{\displaystyle \underset{r=0}{\overset{x+u}{\sum}}p\left(r\right)}+700{\displaystyle \underset{r=x+u+1}{\overset{\infty}{\sum}}p\left(r\right)}$ (6)

Due to $x+u=S$ , then:

$J\left(u+1\right)-J\left(u\right)=-100{\displaystyle \underset{r=0}{\overset{S}{\sum}}p\left(r\right)}+700{\displaystyle \underset{r=S+1}{\overset{\infty}{\sum}}p\left(r\right)}$ (7)

Let it be 0, then:

$\frac{{\displaystyle \underset{r=0}{\overset{S}{\sum}}p\left(r\right)}}{{\displaystyle \underset{r=S+1}{\overset{\infty}{\sum}}p\left(r\right)}}=7$ (8)

Due to $\underset{r=0}{\overset{\infty}{\sum}}p\left(r\right)}=1$ , so:

$\underset{r=0}{\overset{S}{\sum}}p\left(r\right)}=0.875$ (9)

Since r obeys the Poisson distribution with a parameter of 4.1 and p(r) is its density function, the Poisson distribution quintile of the above formula yields S = 6.

2) Solving the lower bound s

If the branch purchases the commodity, the total profit expression is:

${J}_{1}\left(x\right)=2770-L\left(S\right)$ (10)

where $S=6$ and x is the current inventory quantity. If the branch chooses not to purchase the commodity, the total profit expression is:

${J}_{2}\left(x\right)=2870-L\left(x\right)$ (11)

When ${J}_{1}\left(x\right)\ge {J}_{2}\left(x\right)$ , in order to achieve the maximum total profit, the branch should promptly report the number of orders. From the calculation by Mathematica, the result below is achieved:

$L\left(x\right)\ge 464.167$ (12)

Because $L\left(5\right)=448.718$ , $L\left(4\right)=661.271$ , so when $x\le 4$ , the branch should purchase the commodity.

Therefore, for Wuhan Zongguan Xihui Branch, the following ordering strategy is established: At the end of each cycle, the inventories of commodity should be checked. When the inventories were less than or equal to 4, the number of orders should be reported in time and the stocks should be increased to 6.

Through the method above, the ordering strategy of the product in every branch within the 3^{rd} ring road in Wuhan can be carried out similarly. See Table 1 for details.

3.2. Risk Assessment Model Based on Markov Chain

Based on the strategy, in order to obtain the probability of losing sales opportunities at every branch, a stock-out probability calculation method based on the Markov chain [10] is used, as follows.

The inventory per cycle of the commodity is in a random state. It is only related to the amount of inventory in the previous cycle and there is no aftereffect in this state. That is, the inventory amount per cycle can be described by the Markov chain.

Take Wuhan Zongguan Xihui Branch as an example. The value of the inventory amount at the end of the commodity cycle may be 0, 1, 2, 3, 4, 5, 6, and the initial value of inventory amount of each cycle may be 5, 6. Set
${S}_{n}$ to be the initial inventory of the n^{th} cycle, then
${S}_{n}\in \left\{5,6\right\}$.

For the inventory condition of this product, the state transfer law is:

${S}_{n+1}=\{\begin{array}{l}{S}_{n}-r\left(n\right),r\left(n\right)<{S}_{n}-s\\ 6,r\left(n\right)\ge {S}_{n}-s\end{array}$ (13)

where
$r\left(n\right)$ is the demand for this product for the n^{th} cycle, which obeys the Poisson distribution with a parameter of 4.1, which is:

$p\left(r\left(n\right)=k\right)=\frac{{4.1}^{k}}{k!}{\text{e}}^{-4.1}$ (14)

Its distribution is shown in Table 2.

Table 1. The ordering strategy of every branch.

Table 2. Distribution of r(n).

Then the state transition matrix for the inventory of this commodity is calculated as:

$p=\left[\begin{array}{cc}{p}_{55}& {p}_{56}\\ {p}_{65}& {p}_{66}\end{array}\right]=\left[\begin{array}{cc}0.0166& 0.9834\\ 0.0679& 0.9321\end{array}\right]$ (15)

The state transition probability is ${a}_{i}\left(n\right)=p\left({S}_{n}=i\right),i=5,6$. Then:

$a\left(n\right)=\left[\begin{array}{l}{a}_{5}\left(n\right)\\ {a}_{6}\left(n\right)\end{array}\right]$ (16)

Due to $a\left(n+1\right)=a\left(n\right)\cdot p$ , so:

$\left[\begin{array}{l}{a}_{5}\left(n+1\right)\\ {a}_{6}\left(n+1\right)\end{array}\right]=\left[\begin{array}{l}{a}_{5}\left(n\right)\\ {a}_{6}\left(n\right)\end{array}\right]\left[\begin{array}{cc}0.0166& 0.9834\\ 0.0679& 0.9321\end{array}\right]$ (17)

Because $\exists N,{p}^{N}>0$ , so p is a regular chain. There exists a unique limit state probability vector w. When $n\to +\infty $ , the state probability $a\left(n\right)\to w$. w is the steady-state probability which satisfies $wp=w$.

When $n\to +\infty $ ,

${p}^{n}=\left[\begin{array}{cc}0.0646& 0.9354\\ 0.0646& 0.9354\end{array}\right]$ (18)

Then $w=\left[0.0646,0.9354\right]$. So when $n\to +\infty $ , the state probability $a\left(n\right)=\left[0.0646,0.9354\right]$.

Let the probability of losing sales opportunities in the n^{th} cycle be
$p\left(r\left(n\right)>{S}_{n}\right)$ , then:

$p\left(r\left(n\right)>{S}_{n}\right)={\displaystyle \underset{i=5}{\overset{6}{\sum}}p\left(r\left(n\right)>i|{S}_{n}=i\right)p\left({S}_{n}=i\right)}$ (19)

where $p\left({S}_{n}=i\right)={w}_{i}$. Then $p\left(r\left(n\right)>{S}_{n}\right)=12.85\%$.

Therefore, the probability of losing sales opportunities in the ordering strategy of Wuhan Zongguan Xihui Branch is 12.85%.

Through the method above, the probability of losing the sales opportunity in the ordering strategy of the product in every branch can be obtained respectively, as shown in Table 3.

3.3. Construction of the Company’s Storage Ecosystem

In order to obtain the optimal transfer plan, a nonlinear discrete programming model is established.

Let y_{i} be the stock amount of the i^{th} branch at a certain time, Q_{i} be the call-out amount or call-in amount of the i^{th} branch at the time of transfer, and Q_{i} should be taken as a positive value when called out, and it should be a negative value when called in.

Table 3. Probability of losing sales opportunity.

When the transfer is completed, the amount of inventory in every branch becomes ${y}_{i}-{Q}_{i}$ , and then the storage cost and the stock loss cost of every branch is:

$f\left({Q}_{i}\right)=100{\displaystyle \underset{r=0}{\overset{{y}_{i}-{Q}_{i}}{\sum}}\left({y}_{i}-{Q}_{i}-r\right)p\left(r\right)}+700{\displaystyle \underset{r={y}_{i}-{Q}_{i}+1}{\overset{\infty}{\sum}}\left(r-{y}_{i}+{Q}_{i}\right)p\left(r\right)}$ (20)

Since the way of transferring goods is from stocked branches to out-of-stock branches, the quantity of mobilized goods is balanced, that is, there exists the constraint $\underset{i=1}{\overset{8}{\sum}}{Q}_{i}}=0$. In addition, the objective function should also satisfy the limit of every branch’s inventory. So the model is obtained.

$\begin{array}{l}\mathrm{min}\text{}F\left(Q\right)={\displaystyle \underset{i=1}{\overset{n}{\sum}}\left\{100{\displaystyle \underset{r=0}{\overset{{y}_{i}-{Q}_{i}}{\sum}}\left({y}_{i}-{Q}_{i}-r\right)p\left(r\right)}+700{\displaystyle \underset{r={y}_{i}-{Q}_{i}+1}{\overset{\infty}{\sum}}\left(r-{y}_{i}+{Q}_{i}\right)p\left(r\right)}\right\}}\\ \text{s}\text{.t}\text{.}\text{\hspace{0.17em}}\{\begin{array}{l}{\displaystyle \underset{i=1}{\overset{n}{\sum}}{Q}_{i}=0}\\ 0\le {y}_{i}-{Q}_{i}\le {S}_{i}\end{array}\\ j=1,2,\cdots ,n\end{array}$ (21)

This is a nonlinear programming problem with general constraints. Since the second derivative of $F\left(Q\right)$ exists and is greater than 0, it is obvious that the objective function is a continuously differentiable convex function, and the constraint condition is linear. Therefore, this problem is also a convex programming which has an optimal set $\left\{{Q}_{i}^{\ast}|i=1,2,\cdots ,8\right\}$ which satisfies the constraints.

If the constraints are not considered, the optimal solution of the objective function $F\left(Q\right)$ can be obtained by differentiation: [11] .

Let the first-order difference of $F\left(Q\right)$ to ${Q}_{i}$ be 0

$\Rightarrow P\left(\frac{{y}_{i}-{\lambda}_{i}-{Q}_{i}^{*}}{{\lambda}_{i}}\right)=1-\frac{100}{700+100}P\left(1\right)$ (22)

It can be seen from the above formula that the value of the optimal solution ${Q}_{i}$ that does not consider the constraints is related to λ, and ${Q}_{i}$ may take a positive value or a negative value. If the values of ${Q}_{i}$ are all greater than 0, it means that there is no shortage of goods in every branch, then no branch needs to transfer the goods; otherwise, it means that every branch is out of stock and needs to replenish inventory from the manufacturer. Since the focus of this paper is the horizontal transfer strategy among branches, the premise is that the phenomenon of sufficient inventory and out-of-stock exists at the same time. Therefore, for the value of ${Q}_{i}$ , the situation is not considered that the inventory of every branch is greater than or equal to 0 or all cases are less than or equal to 0. It is assumed that these two conditions coexist.

In order to obtain the optimal value of ${Q}_{i}$ , Lagrange multipliers $\alpha ,\beta ,\gamma $ are introduced: [11]

$l\left({Q}_{i},\alpha ,\beta ,\gamma \right)=F\left(Q\right)+{\alpha}^{*}{\displaystyle \underset{i=1}{\overset{n}{\sum}}{Q}_{i}+{\displaystyle \underset{i=1}{\overset{n}{\sum}}{\gamma}_{i}^{*}\left({Q}_{i}-{y}_{i}\right)}}+{\displaystyle \underset{i=1}{\overset{n}{\sum}}{\beta}_{i}^{*}\left({y}_{i}-{Q}_{i}-{S}_{i}\right)}$ (23)

Differentiate l:

First-order difference of l to ${Q}_{i}$

$=700{\displaystyle \underset{r={y}_{i}-{Q}_{i}+1}{\overset{\infty}{\sum}}p\left(r\right)-100{\displaystyle \underset{r=0}{\overset{{y}_{i}-{Q}_{i}}{\sum}}p\left(r\right)}}+{\alpha}^{*}+{\gamma}_{i}^{*}-{\beta}_{i}^{*}$ (24)

Then the equation set below is obtained:

$\{\begin{array}{l}700{\displaystyle \underset{r={y}_{i}-{Q}_{i}+1}{\overset{\infty}{\sum}}p\left(r\right)}-100{\displaystyle \underset{r=0}{\overset{{y}_{i}-{Q}_{i}}{\sum}}p\left(r\right)}+{\alpha}^{*}+{\gamma}_{i}^{*}-{\beta}_{i}^{*}\hfill \\ {\gamma}_{i}^{*}\left({Q}_{i}-{y}_{i}\right)=0\hfill \\ {\beta}_{i}^{*}\left({y}_{i}-{Q}_{i}-{S}_{i}\right)=0\hfill \\ \begin{array}{l}{\displaystyle \underset{i=1}{\overset{n}{\sum}}{Q}_{i}=0}\\ {Q}_{i}-{y}_{i}\le 0\\ {y}_{i}-{Q}_{i}-{S}_{i}\le 0\\ {\lambda}^{*},{\gamma}_{i}^{*},{\beta}_{i}^{*}\ge 0\\ i=1,2,\cdots ,8\end{array}\hfill \end{array}$ (25)

Obviously, the value of ${\gamma}_{i}^{\ast}$ and ${\beta}_{i}^{\ast}$ can only be 0. Simplify the equation set above:

$\{\begin{array}{l}P\left(\frac{{y}_{i}-{\lambda}_{i}-{Q}_{i}}{{\lambda}_{i}}\right)=1-\frac{100}{700+100}P\left(1\right)+\frac{{\alpha}^{*}}{700+100},\text{\hspace{0.17em}}i=1,2,\cdots ,8\\ {\displaystyle \underset{i=1}{\overset{n}{\sum}}{Q}_{i}}=0\end{array}$ (26)

Solve the set $\left\{{Q}_{i}^{\ast}|i=1,2,\cdots ,8\right\}$ through MATLAB. Round ${Q}_{i}^{\ast}$ with the constraints that ${Q}_{i}-{y}_{i}\le 0;{y}_{i}-{Q}_{i}-{S}_{i}\le 0$ so that the optimal value of ${Q}_{i}$ for every branch can be determined, as is shown in Table 4.

Substitute ${Q}_{i}^{\ast}$ into $F\left(Q\right)$ , then $F\left({Q}^{\ast}\right)=2018.27$.

Take three branches as an example, the transfer relationship among the branches is shown in Figure 1.

As is shown in Figure 1, for the case of the 3 branches, the transfer relations are divided into two layers: the first layer is the manufacturer supplying to the

Figure 1. Transfer relations.

Table 4. Optimal value of ${Q}_{i}^{\ast}$ for every branch.

branches, and the second layer is the three branches transferring mutually according to the inventory situation.

Based on the principle of proximity, with the map as a reference, the desired transfer plan is obtained:

The excess stock of Wuhan Zongguan Xihui Branch and Hanyang Zhongjiacun Branch should be transferred to Hanyang Branch; the excess inventory of Wuhan Xudong Street Branch should be transferred to Nanhu City Plaza Branch; the excess inventory of Lingjiao Lake Wanda Branch should be transferred to Wuhan Aoshan Branch.

The expected number of shipments is 4 and the expected commodity transfer cost is 400 yuan. Therefore, in the case of considering the transfer of goods among branches, the total cost is 2418.27 yuan.

If the transfer of goods among branches is banned, the expected total cost is:

$\underset{i=1}{\overset{8}{\sum}}\left[100{\displaystyle \underset{r=0}{\overset{{S}_{i}}{\sum}}\left({S}_{i}-r\right)p\left(r\right)}+700{\displaystyle \underset{r={S}_{i}+1}{\overset{\infty}{\sum}}\left(r-{S}_{i}\right)p\left(r\right)}\right]}=2696.92$ (27)

Therefore, the construction of transfer system helps increase the company’s expectation of profits per cycle by 278.65 yuan.

4. Model Assessment and Verification

4.1. Model Test of Single-Branch Storage Strategy

The upper limit of every branch’s inventory is 1 to 2 more than the estimated average demand. The lower bound of every branch inventory happens to be the rounding estimated average demand. Combining the result of risk assessment, every branch’s purchasing strategy can suppress the probability of out-of-stock to be about 10%, and the probability of losing sales opportunities is small. Therefore, the storage strategy formulated in this paper is realistic and effective.

Figure 2. Simulation of stock-out probability for Wuhan Zongguan Xihui Branch.

4.2. Model Test of Risk Assessment Model

For every branch’s stock-out probability, MATLAB is adopted to carry out the simulation. The simulation result shows that the stock-out probability is converging. Take Wuhan Zongguan Xihui Branch as an example, the stock-out probability of Wuhan Zongguan Xihui Branch is 12.85%. MATLAB is adopted to generate a sample from Poisson distribution with sample size n, and calculate the stock-out probability for n in the range of 1 to 2000. The stock-out probability figure is shown in Figure 2.

From the figure above, when n is large enough, the stock-out probability converges to about 12.85%. Therefore, the stock-out probability obtained from the Markov chain model is reasonable.

5. Conclusions and Suggestions

For Wal-Mart’s products of this kind, the expected number of transfer among the branches per cycle is 4 times, and the expectation of profit increase is 278.65 yuan, that is, profits increase by about 10%. The increase in profit is in line with the facts and the number of transfers is within a reasonable range. Therefore, the model is reasonable and feasible, and the model results have practical significance.

A new model for the storage problem of enterprises is proposed in this paper. It comprehensively uses (s, S) random storage strategy, Markov chain and nonlinear discrete programming model to develop a complete storage system for the enterprise. From the model results above, it can be known that the whole system designed for the company performs well. The storage system has a good performance of extrapolation and is worthy of promotion. It can bring considerable benefits to more companies.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

*Applied Mathematics*,

**9**, 738-748. doi: 10.4236/am.2018.96051.

[1] | Suo, M.Q. (2013) Study on Regional Resource Optimization Method Based on Storage Theory. North China Electric Power University, Beijing. |

[2] | Luo, W.T. (2012) Mathematical Model of Product Sales Storage Problem. China Business, 6, 102-103. |

[3] | Gao, Y.F. (2008) The (s, S) Probability Model for Random Storage Problems. Market Modernization, 33, 35. |

[4] | Zhang, L. (2010) Research on Product Storage Optimization and System Implementation. Jilin University, Changchun. |

[5] |
Singh, D. and Verma, A. (2018) Inventory Management in Supply Chain. Materials Today: Proceedings, 5, 3867-3872. https://doi.org/10.1016/j.matpr.2017.11.641 |

[6] |
Phoutatsamay, S.-L., Kedad-Sidhoum, S. and Pascual, F. (2018) Two-Level Lot-Sizing with Inventory Bounds. Discrete Optimization.
https://doi.org/10.1016/j.disopt.2018.05.001 |

[7] |
Archetti, C., Christiansen, M. and Grazia Speranza, M. (2018) Inventory Routing with Pickups and Deliveries. European Journal of Operational Research, 268, 314-324. https://doi.org/10.1016/j.ejor.2018.01.010 |

[8] | Kong, S.X. and Han, Z.Y. (2007) A Random Storage Strategy for Ordering Problems. Market Modernization, 32, 34. |

[9] | Zhu, L.H., Cao, W. and Zhang, Y. (2012) Aviation Ammunition Random Storage Strategy Model. Journal of Sichuan Armament, 33, 24-25. |

[10] | Xu, Y. (2014) Research on Network Discrete System Filtering and Control Based on Markov Chain. Zhejiang University, Hangzhou. |

[11] | Yang, J., Tang, Y.L. and Lin, B. (2006) Horizontal Replenishment Optimization Model of Distribution System under Random Demand. China Storage and Transportation, 5, 98-99. |

Copyright © 2020 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.