Revision as of 14:54, 13 November 2020 (view source) Rimni (talk | contribs) (→‎2.3 Robust counterpart problem reformulation) ← Older edit		Revision as of 14:55, 13 November 2020 (view source) Rimni (talk | contribs) (→‎2.3 Robust counterpart problem reformulation) Newer edit →
Line 357:		Line 357:
	{| style="text-align: left; margin:auto;width: 100%;"		{| style="text-align: left; margin:auto;width: 100%;"
	|-		|-
−	| style="text-align: center;" | <math>\frac{var(d_k)}{var(d_k)+{\left(\sum_{j\in J}x_{jk}-E(d_k)\right)}^2}\leq \epsilon ,qquad k=1,2,\cdots ,K</math>	+	| style="text-align: center;" | <math>\frac{var(d_k)}{var(d_k)+{\left(\sum_{j\in J}x_{jk}-E(d_k)\right)}^2}\leq \epsilon ,\qquad k=1,2,\cdots ,K</math>
	|}		|}
	| style="width: 5px;text-align: right;white-space: nowrap;" | (21)		| style="width: 5px;text-align: right;white-space: nowrap;" | (21)

---

Revision as of 14:55, 13 November 2020

Abstract

In the spare parts supply network, there are many uncertain factories, such as unpredictable demands and changeable lead times. The spare parts shortage caused by those uncertainties may lead to severe losses. To solve the uncertainty of supply network, a determined optimization model is developed and then reformulated as a robust counterpart. In the robust model, it is only necessary to know the moment information of the uncertain parameters rather than the true probability distribution. The solution obtained by the robust model can satisfy the constraints in the worst-case, that is, feasible for any probability distribution within the moment based ambiguity set. Two moment based robust models are studied in this work. The result of the experiment indicates that the robustness of the robust model is stronger than that of the determined model and chance constraint model, and the effect of safety tolerance on the robustness is revealed by sensitivity analysis. Finally, the second order moment model is verified to be superior to the first order moment model in spare parts supply network optimization.

Keywords: Spare parts supply network, uncertainty, moment based ambiguity set, chance constraint optimization, distributed robust optimization

1. Introduction

Spare parts supply network optimization is one of the hot issues of spare parts management. Many research works have been done on supply network optimization in certain circumstances. In recent years, many researchers took attention to uncertainty optimization. In the spare parts supply network, many factories such as demands, lead times, and risks are uncertain since the difficulty of data collection or complex dynamic scenarios. Although there are many advanced methods, such as reliability based [1] and data based methods [2], have been used to predict the demands or lead times, most of them are based on over-ideal assumptions and not accurate enough. In fact, in most cases, it almost cannot forecast the demand precisely at all.

To simplify the problems, many researchers assume that the demands are determined [3] or obeys specified known distribution, such as Normal distribution [4], Poisson distribution [5], Stuttering Poisson distribution [6], etc. There are also many works assumed the lead times are fixed [7] or obey known distributions [8]. These assumptions may be not effective sometimes and may cause out of stock or more serious consequences. To handle the uncertainty in the spare parts supply network, most conmen used methods are stochastic program [9], fuzzy optimization [10], and robust optimization [11]. However, in stochastic optimization, it is usually necessary to know the distribution of uncertain parameters in advance or very time-consuming by using Monte Carlo simulation. The fuzzy optimization cannot guarantee the feasibility in all time. Thus, the robust optimization was adopted in this paper because it doesn’t rely on the distribution of uncertain parameters and can guarantee the feasibility of the solution in the worst case.

This paper optimizes the supply network without thus assumption to avoid the serious losses caused by small probability events. The demands and lead times are uncertain with unknown distribution, the only things can we get from the historical data is certain known moments or known structural properties. A moment based ambiguity set was established to descript all the possible distribution, which must contain the real distribution of uncertain parameters. The robust model only needs to ensure the worst case in the ambiguity set is satisfied. The main contributions of this paper are as follows. First of all, the uncertain parameters can obey any distribution with known moments in this paper. Secondly, uncertain demand and lead time are considered at the same time. Thirdly, the robust counterparts are formulated based on inequality theory, which is easily understood than duality theory.

The remaining sections of this article are organized as follows. In Section 2, the determined model of spare parts supply network optimization is developed and then reformulated as its moment based robust counterpart. In section 3, the numerical experiment and sensitivity analysis are carried out. In section 4, the results of the robust model are compared with the determined model and chance constraint model, respectively. Finally, we summarize the paper in section 6.

2. Modeling

The classical three echelon spare parts supply network consists of supply centers, distribution centers and customers. The ordered spare parts are supported by supply centers and then distributed through the distribution centers to meet the spare parts demand of the customers. In the process of supplying, in order to save the costs, it is often unnecessary to open all of the alternative distribution centers. The research aims to decide which distribution center should be opening and also the number of spare parts flow among the nodes of the spare parts supply network.

Different from the traditional supply network, there are many uncertainty parameters in our spare parts supply network. Lead times and demands are the two most conmen considered uncertainty factories in the supply network. In terms of spare parts demands, the predicted values usually do not agree with the real data especially in some complex circumstances. Although, there are lots of state-of-the-art forecast methods are studied and used by researchers, there are still big gaps between the mathematic models and the real-world practice. Similarly, it’s also difficult to ensure the lead times of supply remain unchanged every time, even there may be some accidents that occur in transit. One of the general strategies to handle these uncertainties is assuming these uncertain parameters obey specified distribution. This assumption will not accurate because of the limitation of the historical data. So, in our supply network optimization model, the probability distribution of lead times and demands are even typically unknown. There are only some useful information can be obtained from the samples, such as certain known moments or known structural properties.

The proposed model focus on the problems that optimize the spare parts network with uncertain lead times and demands to meet the customers’ demands within the given hard time window and with the minimum total cost. The uncertainty makes the problem more complicated to be handled. Firstly, the determined model is developed, and then the corresponding robust counterpart problem will be reformulated. The objective function of the model is to minimize the total supply costs, and the constraints of the model include demand fill rate, lead time, captain limitation, flow equilibrium, and so on. The parameters and models are described as follows.

2.1 Parameter description

${\displaystyle I}$: the amount of supply centers, ${\displaystyle i=1,2,\cdots ,I}$;

${\displaystyle J}$: the amount of distribution centers, ${\displaystyle j=1,2,\cdots ,J}$;

${\displaystyle K}$: the amount of customers, ${\displaystyle k=1,2,\cdots ,K}$;

${\displaystyle T_{ij}^{}}$: the lead time between supply center ${\displaystyle i}$ and distribution center ${\displaystyle j}$ , which is uncertain;

${\displaystyle T_{jk}^{}}$: the lead time between distribution center ${\displaystyle j}$ and customer ${\displaystyle k}$, which is uncertain;

${\displaystyle T}$: the required maximum lead time.

${\displaystyle C_{ij}^{trans}}$: unit spare parts transportation costs between supply center ${\displaystyle i}$ and distribution center ${\displaystyle j}$;

${\displaystyle C_{jk}^{trans}}$: unit spare parts transportation costs between distribution center ${\displaystyle j}$ and customer ${\displaystyle k}$;

${\displaystyle C_{j}^{open}}$: fixed opening costs of distribution center ${\displaystyle j}$;

${\displaystyle C_{j}^{invent}}$: unit spare parts inventory cost of distribution center ${\displaystyle j}$;

${\displaystyle C_{k}^{invent}}$: unit spare parts inventory cost of customer ${\displaystyle k}$;

${\displaystyle C_{k}^{short}}$ : unit shortage loss of customer ${\displaystyle k}$;

${\displaystyle d_{k}}$: spare parts demand of customer, which is uncertain ${\displaystyle k}$ ;

${\displaystyle U_{j}}$: the maximum spare parts capacity of distribution center ${\displaystyle j}$ .

Decision variables:

${\displaystyle x_{ij}^{}}$ : the amount of spare parts supply from supply center ${\displaystyle i}$ to distribution center ${\displaystyle j}$;

${\displaystyle x_{jk}^{}}$: the amount of spare parts supply from distribution center ${\displaystyle j}$ to customer ${\displaystyle k}$;

${\displaystyle y_{j}^{}}$ : binary variable, used to label the opening of distribution center ${\displaystyle j}$. If distribution center ${\displaystyle j}$ is opening, ${\displaystyle y_{j}^{}=1}$, otherwise, ${\displaystyle y_{j}^{}=0}$.

2.2 Determined model

Firstly, the determined model is developed. In this model, all parameters seem as determined parameters. The objective function is minimizing the total supply costs, which consists of opening cost, transportation costs, inventory costs, and shortage loss. The objective function is formulated as follows:

${\displaystyle \min C=C^{open}+C^{trans}+C^{invent}+C^{short}}$

(1)

where ${\displaystyle C^{open}}$ represents the total opening costs, ${\displaystyle C^{trans}}$ the total transportation costs, ${\displaystyle C^{invent}}$ the total inventory costs, and ${\displaystyle C^{short}}$ the total shortage loss. Each costs are calculated as follows:

${\displaystyle C^{open}=\sum _{j\in J}C_{j}^{open}\cdot y_{j}}$

(2)

${\displaystyle C^{trans}=\sum _{i\in I}\sum _{j\in J}C_{ij}^{trans}\cdot x_{ij}+\sum _{j\in J}\sum _{k\in K}C_{jk}^{trans}\cdot x_{jk}}$

(3)

${\displaystyle C^{invent}=\sum _{j\in J}C_{j}^{invent}\cdot \left(\sum _{i\in I}x_{ij}-\sum _{k\in K}x_{jk}\right)+\sum _{k\in K}C_{k}^{invent}\Xi \cdot \left(\sum _{j\in J}x_{jk}-d_{k}\right)}$

(4)

${\displaystyle C^{short}=\sum _{k\in K}C_{k}^{short}\cdot \Xi \cdot \left(d_{k}-\sum _{j\in J}x_{jk}\right)}$

(5)

where ${\displaystyle \Xi \lbrace .\rbrace }$ represents ${\displaystyle max(0,.)}$ .

The following constraints should be satisfied:

s.t.

${\displaystyle \sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn\left(x_{ij}\right)+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn\left(x_{jk}\right)-T\leq 0}$

(6)

${\displaystyle \sum _{i\in I}x_{ij}-y_{j}\cdot U_{j}\leq 0,\qquad j=1,2,\cdots ,J}$

(7)

${\displaystyle \sum _{k\in K}x_{jk}-y_{j}\cdot U_{j}\leq 0,\qquad j=1,2,\cdots ,J}$

(8)

${\displaystyle d_{k}-\sum _{j\in J}x_{jk}\leq 0,\qquad k=1,2,\cdots ,K}$

(9)

${\displaystyle \sum _{k\in K}x_{jk}-\sum _{i\in I}x_{ij}\leq 0,\qquad j=1,2,\cdots ,J}$

(10)

${\displaystyle {\begin{array}{c}x_{ij}\in N^{+}\\x_{jk}\in N^{+}\\y_{j}=\left\{0,1\right\}\end{array}}}$

(11)

where, constraint (6) is a hard time window constraint, which specifies that the spare parts must arrive at the customers before the deadline. The constraints (7) and (8) state that the closed distribution centers should not participate in the supply of spare parts. They also specify that the input of spare parts should not exceed the maximum capacity of distribution centers. Constraint (9) specifies that the demands of spare parts of all the customers must be satisfied. Constraint (10) ensures that the output of spare parts should not exceed the spare parts flow into each distribution center. Constraint (11) states the character of decision variables.

2.3 Robust counterpart problem reformulation

In the determined supply optimization model, there will be two situations of spare parts shortage. One of them is the spare parts cannot arrive in time, and another is the amount of supplied spare parts cannot meet the demand of customers. Both the two kinds of shortage can lead to serious consequences. In the determined model, it is only necessary to find the feasible solutions that satisfy all the constraints of the model. However, in the uncertain model, it is hard to find feasible solutions because of the uncertainty of lead times and demands. We need to reformulate the mathematical model in the uncertain environment and find robust solutions to ensure that the demands of spare parts are satisfied in any case. This section reformulates the determined model as an uncertain model and derives a tractable and efficient deterministic robust counterpart for the uncertain model.

For most supply practices, the supply environment is complex and changeable, and the sample data is limited. It is usually difficult to get the true probability distribution of these parameters. What only can we do is that extract useful information from these limited samples and use the statistical features to modeling and analysis. Despite the unknown distribution of parameters, the moment, such as, mean, variance, covariances, etc., can be obtained easily. The known moment of the sample contains a lot of valuable information about the distribution, so we use a moment-based ambiguity sets describe the uncertain parameters. This ambiguity set consists of all possible probability distributions satisfied the moment condition, and deservedly contains the true distribution of our parameters. If we can find the robust solutions that satisfy the constraints in the worst-case, then the constraints with real distribution can also be met by the robust solutions.

This section focuses on the robust counterpart reformulation in the case of known first order moments and the case of known both the first order and the second order moments. The ambiguity set of these two cases are expressed as follows, respectively:

${\displaystyle D=\left\{f(\xi ):{\begin{array}{c}\displaystyle {\int }_{\xi \in R^{K}}f(\xi )d\xi =1\\E[\xi ]-{\mu }_{0}=0\end{array}}\right\}}$

(12)

${\displaystyle D=\left\{f(\xi ):{\begin{array}{c}\displaystyle {\int }_{\xi \in R^{K}}f(\xi )d\xi =1\\E[\xi ]-{\mu }_{0}=0\\var(\xi )=E[{\left(\xi -{\mu }_{0}\right)}^{2}]={\sigma }_{0}^{2}\end{array}}\right\}}$

(13)

where, Eqs. (12) is the ambiguity set with known first order moment, and Eqs. (13) is the ambiguity set with the known first and second order moment. The parameter ${\displaystyle {\mu }_{0}}$ and ${\displaystyle {\sigma }_{0}^{2}}$ represent the mean and variance obtained from historical data, ${\displaystyle D}$ denotes the support of the family of all probability distributions with known moment information and ${\displaystyle f(\xi )}$ is the probability density function (PDF) of the random variable ${\displaystyle \xi }$.

If the function objective consists uncertain parameters, it can be use the expectation of objective to reformulate, or transfer the objective function to constraints <span id='cite-_Ref38381847'</span>[12]. In our spare parts optimization model, the uncertain parameters just exist in constraints. In Eqs. (6) and (9), the lead time ${\displaystyle T_{ij}}$ and ${\displaystyle T_{jk}}$ and the spare parts demands ${\displaystyle d_{k}}$ are uncertainty with some unknown distribution. It can be formulate as chance constraints to ensure that the constraint must be satisfied under a probability which greater than the specified threshold.

The single chance constraint of Eqs. (6) is as follows:

${\displaystyle Pr(\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})-T\leq 0)\geq 1-\epsilon }$

(14)

The single chance constraint of Eqs. (9) is as follows:

${\displaystyle Pr(d_{k}-\sum _{j\in J}x_{jk}\leq 0)\geq 1-\epsilon ,\qquad k=1,2,\cdots ,K}$

(15)

where, ${\displaystyle \epsilon \in (0,1)}$ represents a specified safety tolerance or violation probability, and all constraints take the same ${\displaystyle \epsilon }$.

In terms of random variable ${\displaystyle \xi }$, if the probability density function ${\displaystyle \xi }$ is known, it is easy to solve the inequality ${\displaystyle Pr(\xi \leq b)\leq \alpha }$ by ${\displaystyle b\leq F_{\xi }^{-1}(\alpha )}$ [13]. However, in our spare parts network, the distribution of lead times and demands are unknown. Even the PDF of the lead times is known, it still be difficult and time-consuming to calculate the PDF of ${\displaystyle \sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+}$${\displaystyle \sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})}$. Therefore, further derivation of Eqs. (14) and Eqs. (15) is needed. We use the robust chance constraints to formulate inequality (14) and (15) as follows:

${\displaystyle {\underset {P\in D_{T}}{inf}}Pr(\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})-T\leq 0)\geq 1-\epsilon }$

(16)

${\displaystyle {\underset {P\in D_{d}}{inf}}Pr(d_{k}-\sum _{j\in J}x_{jk}\leq 0)\geq 1-\epsilon ,\qquad k=1,2,\cdots ,K}$

(17)

In the case of only the first order moments are known, for an arbitrary distributional random variable ${\displaystyle {\mbox{ }}{\mbox{ }}{\mbox{ }}\xi }$. According to the Markov's inequality, there is ${\displaystyle Pr\left\{\xi \geq k\right\}\leq {\frac {E(\xi )}{k}},\,X\geq 0,k\geq 0}$. Therefore, we can get the robust counterparts of Eqs. (16) and (17) as follows:

${\displaystyle E\left\{\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})\right\}\leq T\epsilon }$

(18)

${\displaystyle {\frac {E(d_{k})}{\sum _{j\in J}x_{jk}}}\leq \epsilon ,\qquad k=1,2,\cdots ,K}$

(19)

Proof. For inequality (16), there is:

${\displaystyle {\underset {P\in D_{T}}{inf}}Pr\left(\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})-T\leq 0\right)}$ ${\displaystyle ={\underset {P\in D_{T}}{inf}}\left\{1-Pr(\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})\geq T\right\}}$ ${\displaystyle \geq 1-{\frac {E\left\{\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})\right\}}{T}}\geq 1-\epsilon }$ ${\displaystyle \Rightarrow E\left\{\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})\right\}\leq T\epsilon }$

For inequality (17), there is:</span>

${\displaystyle {\underset {P\in D_{d}}{inf}}Pr(d_{k}-\sum _{j\in J}x_{jk}^{}\leq 0)=1-{\underset {P\in D_{d}}{sup}}Pr(d_{k}-\sum _{j\in J}x_{jk}\geq 0)}$ ${\displaystyle \geq 1-{\frac {E(d_{k})}{\sum _{j\in J}x_{jk}}}\geq 1-\epsilon }$ ${\displaystyle \Rightarrow {\frac {E(d_{k})}{\sum _{j\in J}x_{jk}}}\leq \epsilon }$

In the case of both the first and second order moments are known, for an arbitrary distributional random variable ${\displaystyle \xi }$. According to the Cantelli's inequality, there is, ${\displaystyle Pr\left\{\xi -\mu \geq k\right\}\leq {\frac {{\sigma }^{2}}{{\sigma }^{2}+k^{2}}},}$ ${\displaystyle k\geq 0}$. Therefore, we can get the robust counterparts of constraint (16) and (17) as follows:

File:Review 789578267838-image83.png

(20)

${\displaystyle {\frac {var(d_{k})}{var(d_{k})+{\left(\sum _{j\in J}x_{jk}-E(d_{k})\right)}^{2}}}\leq \epsilon ,\qquad k=1,2,\cdots ,K}$

(21)

edit

Proof. For inequality (16), there is:

${\displaystyle {\underset {P\in D_{T}}{inf}}Pr(\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})-T\leq 0}$ ${\displaystyle ={\underset {P\in D_{T}}{inf}}\left\{1-Pr(\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})\geq T\right\}}$ ${\displaystyle \geq 1-{\frac {var\left\{\sum _{i\in I}\sum _{j\in J}T_{ij}^{\cdot }sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})\right\}}{var\left\{\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})\right\}+{\left(E\left\{\sum _{i\in I}\sum _{j\in J}T_{ij}\cdot sgn(x_{ij})+\sum _{j\in J}\sum _{k\in K}T_{jk}\cdot sgn(x_{jk})\right\}-T\right)}^{2}}}\geq 1-\epsilon }$ ${\displaystyle {\mbox{ }}\Rightarrow }$ File:Review 789578267838-image83.png

For inequality (17), there is:

${\displaystyle {\mbox{ }}{\underset {P\in D_{d}}{inf}}Pr(d_{k}-\sum _{j\in J}x_{jk}^{}\leq 0{\mbox{ }})}$

${\displaystyle =1-{\underset {P\in D_{d}}{sup}}Pr(d_{k}-\sum _{j\in J}x_{jk}^{}\geq 0{\mbox{ }})}$

${\displaystyle \geq {\mbox{ }}1-{\frac {var(d_{k})}{var(d_{k})+{\left(\sum _{j\in J}x_{jk}^{}-E(d_{k})\right)}^{2}}}}$

${\displaystyle \geq }$

${\displaystyle 1-\epsilon }$

${\displaystyle {\mbox{ }}\Rightarrow }$

${\displaystyle {\mbox{ }}{\frac {var(d_{k})}{var(d_{k})+{\left(\sum _{j\in J}x_{jk}^{}-E(d_{k})\right)}^{2}}}\leq \epsilon }$

</span>

<span id='OLE_LINK220'<span id='OLE_LINK168'<span id='OLE_LINK169'In summary, the robust counterpart is derivated by replace the inequality (6) and (9) of the determined model by the inequality (18) and (19) or inequality (20) and (21).

3 Case Study

3.1 Case Description

<span id='OLE_LINK221'<span id='OLE_LINK186'<span id='OLE_LINK187'<span id='OLE_LINK192'In this case, the three echelon spare parts supply network consists of 2 supply centers, 5 distribution centers, and 4 customers. The spare parts are supported to meet the demands of customers. The first and second moments of the lead times and demands are counted from 50 samples. The relative data are shown in Table 1-4. The required maximum lead time is 300 hours, and the</span> safety tolerance ${\displaystyle \epsilon }$ is set from 0.1 to 0.9, respectively. The problems were solved by CPLEX and differential evolutionary algorithm.

3.2 Results and Sensitive Analysis

The optimal solutions of the robust optimization model with known first order moment (referred to as the first order moment model) and with known first and second moment (referred to as the second order moment model) are obtained, their corresponding objective functions and constraints are also calculated and shown in Table 5. In order to analyze the effect of safety tolerance ${\displaystyle \epsilon }$ on the robustness of the model, we take multiple values of ${\displaystyle \epsilon }$ in the first order moment model and the second order moment model, respectively. Constraint 1-20 in Table 5 is the value of the left side of the corresponding inequality constraints, that is, if the value is big than zero, the corresponding constraints are violated, otherwise, the constraint is satisfied. The following conclusion can be summed from the table.

(1) As the safety tolerance increases, the robustness of the model is gradually slack. In other words, the smaller the safety tolerance, the stricter the robustness of the constraints is. In the first order moment model, the feasible solution is obtained only when the tolerance is set as 0.9, and the constraint value is greater than zero in other cases (bold in the table), which indicates unfeasible. Comparing the value of these unfeasible solutions, it can be found that the increase of safety tolerance leads to a decrease of constraint violation degree

<span id='_Hlk38295451'	Distribution centers 1</span>	Distribution centers 2</span>	Distribution centers 3</span>	Distribution centers 4</span>	Distribution centers 5</span>
Opening costs</span>	1000</span>	1500</span>	2500</span>	1800</span>	2000</span>
<span id='OLE_LINK176'Inventory costs	12</span>	8</span>	5</span>	10</span>	10</span>
Inventory capacity</span>	50</span>	55</span>	80</span>	60</span>	65</span>

	customer1</span>	customer2</span>	customer3</span>	customer4</span>
Shortage loss</span>	100</span>	120</span>	80</span>	150</span>
Inventory costs</span>	10</span>	15</span>	13</span>	12</span>
Expectation of demands</span>	68</span>	61</span>	57</span>	88</span>
Variance of demands</span>	9</span>	11</span>	7</span>	8</span>

	Distribution centers 1</span>	Distribution centers 2</span>	Distribution centers 3</span>	Distribution centers 4</span>	Distribution centers 5</span>
Supply center1</span>	105</span>	104</span>	102</span>	104</span>	110</span>
Supply center2</span>	94</span>	108</span>	105</span>	98</span>	96</span>
Customer 1</span>	46</span>	42</span>	59</span>	54</span>	46</span>
Customer 2</span>	41</span>	67</span>	61</span>	67</span>	41</span>
Customer 3</span>	49</span>	53</span>	51</span>	49</span>	49</span>
Customer 4</span>	55</span>	49</span>	60</span>	51</span>	55</span>

<span id='_Hlk38295509'	Distribution centers 1</span>	Distribution centers 2</span>	Distribution centers 3</span>	Distribution centers 4</span>	Distribution centers 5</span>
Supply center1</span>	12/1.6</span>	11/2.5</span>	9/1.8</span>	11/1.1</span>	10/2.3</span>
Supply center2</span>	7/0.7</span>	15/1.3</span>	15/1.6</span>	7.5/1.8</span>	8/1.1</span>
Customer 1</span>	5/0.2</span>	5/0.3</span>	7/0.5</span>	3.7/1.2</span>	4/0.8</span>
Customer 2</span>	4/0.8</span>	5/1.1</span>	3/0.2</span>	4.5/0.6</span>	4/0.3</span>
Customer 3</span>	3.5/0.3</span>	2.5/0.3</span>	2.9/0.7</span>	1.5/0.4</span>	5/0.8</span>
Customer 4</span>	2.6/0.2</span>	4/0.4</span>	1.6/0.2</span>	2/0.5</span>	3.5/0.7</span>

<span id='OLE_LINK196'<span id='OLE_LINK197'<span id='OLE_LINK204'<span id='OLE_LINK205'<span id='OLE_LINK200'<span id='OLE_LINK201'<span id='OLE_LINK202'(2) The value of the objective function decreases gradually as the robustness of the model enhanced. This is because when the robustness is very strict, the solutions try to meet the constraints as much as possible for the price of at the expense of objective function. For example, in order to meet the demand constraint, decision makers have to increase the amount of supplied spare parts, which makes the transportation and inventory costs increase greatly. Therefore, it’s necessary to judge and weigh the smaller objective function and the higher robust constraints to find a balance point.

<span id='OLE_LINK206'(3) The robustness of the first order moment model is stronger than that of the second order moment model. However, the robustness of the first order moment model is too strict, and the feasible solutions may not be able to be found. That is because when using the Markov's inequality, the probability of constraints satisfied is reduced too small, and a lot of information is missed during this process. However, the second-order moment model is not as strict as the first-order moment model, because there is more distribution information in the second order moment. In the actual spare parts supply, if the robustness is emphasized too much, the feasibility of the solution cannot be guaranteed, and the cost of supply will be increased at the same time. It can see that, the result of second order moment model is better than the first order moment model.

Model	First order moment model						Second order moment model</span>
Safety tolerance</span>	0.1</span>	0.3</span>	0.5</span>	0.7</span>	0.9</span>		0.1</span>	0.3</span>	0.5</span>	0.7</span>	0.9</span>
Costs</span>	42029</span>	41679</span>	41168</span>	40958</span>	39480</span>		42634</span>	41172</span>	41120</span>	39459</span>	39392</span>
Constraint 1</span>	130.3</span>	86.3</span>	23.3</span>	-30.2</span>	-199.8</span>		-1421.134</span>	-5796.052</span>	-10530.2</span>	-10105.74</span>	-13000.61</span>
2</span>	0</span>	0</span>	0</span>	0</span>	0</span>		0</span>	-3</span>	-2</span>	-6</span>	-5</span>
3</span>	0</span>	-1</span>	0</span>	0</span>	-4</span>		0</span>	-1</span>	0</span>	-2</span>	0</span>
4</span>	0</span>	0</span>	0</span>	0</span>	0</span>		-4</span>	-1</span>	-5</span>	0</span>	-1</span>
5</span>	0</span>	0</span>	0</span>	0</span>	0</span>		-1</span>	0</span>	0</span>	-2</span>	-2</span>
6</span>	-1</span>	-11</span>	0</span>	0</span>	0</span>		-3</span>	-4</span>	-2</span>	-6</span>	-6</span>
7</span>	-2</span>	-2</span>	-1</span>	0</span>	0</span>		0</span>	-5</span>	-9</span>	-7</span>	-6</span>
8</span>	-1</span>	-5</span>	-4</span>	-1</span>	-4</span>		-6</span>	-4</span>	0</span>	-2</span>	0</span>
9</span>	0</span>	-1</span>	-2</span>	-1</span>	0</span>		-4</span>	-2</span>	-5</span>	0</span>	-2</span>
10</span>	-2</span>	0</span>	0</span>	0</span>	0</span>		-8</span>	0</span>	-1</span>	-3</span>	-2</span>
11</span>	-7</span>	-11</span>	-1</span>	0</span>	0</span>		-7</span>	-5</span>	-6</span>	-6</span>	-6</span>
12</span>	59.2</span>	41.6</span>	26.5</span>	15.5</span>	-0.4</span>		-17.5</span>	-126</span>	-195.5</span>	-82</span>	-56.7</span>
13</span>	55.4</span>	44.5</span>	31</span>	16.2</span>	-0.2</span>		-2.2</span>	-3.1</span>	-7</span>	-3</span>	-2.5</span>
14</span>	51.8</span>	44.4</span>	26.5</span>	19.2</span>	-0.6</span>		-0.1</span>	-5.9</span>	-9</span>	-0.7</span>	-2.9</span>
15</span>	77.8</span>	56.2</span>	39</span>	7.5</span>	-0.2</span>		-12.4</span>	-30.7</span>	-8.5</span>	-98.4</span>	-128.8</span>
16</span>	-2</span>	-2</span>	-1</span>	0</span>	0</span>		0</span>	-2</span>	-7</span>	-1</span>	-1</span>
17</span>	-1</span>	-4</span>	-4</span>	-1</span>	0</span>		-6</span>	-3</span>	0</span>	0</span>	0</span>
18</span>	0</span>	-1</span>	-2</span>	-1</span>	0</span>		0</span>	-1</span>	0</span>	0</span>	-1</span>
19</span>	-2</span>	0</span>	0</span>	0</span>	0</span>		-7</span>	0</span>	-1</span>	-1</span>	0</span>
20</span>	-6</span>	0</span>	-1</span>	0</span>	0</span>		-4</span>	-1</span>	-4</span>	0</span>	0</span>

4 Robustness analysis</span>

To verify the robustness of the uncertain model, we compare the results of the robust model with the determined model and the opportunity constraint model, respectively. Robust model refers to the first or second order moment model. The determined model refers to the model with the expected value of the uncertain parameter, which is adopted by most decision makers. The chance constraint model refers to the model with the assumption that the distribution of uncertain parameters is known. Because the distribution is unknown, the Monte Carlo method is used to solve the chance constraint model.

<span id='OLE_LINK214'<span id='OLE_LINK215'4.1 Comparison with Determined Model

<span id='OLE_LINK43'In the determined model developed in section 2.3 of this paper, the expectation of lead times时and spare parts demands are adopted as the determined parameters. The comparison with the determined model is taken from two aspects. In the first aspect, the solutions of the first order moment model and the second order moment model (referred to as the robust solution) are brought into the deterministic model to test the feasibility of the robust solution in the determined model.

<span id='OLE_LINK216'Brought the robust solutions under different safety tolerances into the determined models, and the values of all constraints are calculated respectively. The constraint value indicates constraint violation, and if the constraint value is less than or equal to 0, it means that the constraint is satisfied. Figure 1-10 is the histograms of the constraints values in these ten different cases, respectively (two different order moment models with five safety tolerance). Taking Figure 1 as an example, Figure 1 shows the constraints values that bring the robust solutions of the first order moment model with a safety tolerance of 0.1 into the determined model. The horizontal axis represents the index of the constraint, and there are a total of 20 constraints in our case. The vertical axis is a constraint value, the yellow bars (labeled as robust model) are the constraint values of the robust model, and the blue bars (labeled as certain model) are the constraint values of determined the model.

In Figure 1, the constraints 1,12,13,14 and 15 of the robust model are not satisfied. In the corresponding determination model, there are only two violated constraints, that is, constraint 13 and constraint 14. It can be seen that although the robust solution is still unfeasible in the deterministic model, it greatly reduces the constraints violate degree. It can be seen that the first order moment model has good robustness, and the same conclusion can be drawn from Figure 2-10.

<span id='OLE_LINK223'<span id='OLE_LINK24'<span id='OLE_LINK25'<span id='OLE_LINK1'<span id='OLE_LINK2'Comparing the results in Figure 1-5 (or figure 6-10), it can also be found that the constraint violations of both the determined model and the robust model decrease as the safety tolerance increases, which is consistent with conclusion (2) in section 5.2. Comparing the results of first order moment model with those in second order moment model, we can find that the robust solution of the second-order moment model makes the constraint violations in determined model much smaller than the robust solution of the first-order moment model. This conclusion is consistent with conclusion (3) in section 5.2.

<span id='OLE_LINK76' <span id='OLE_LINK111'

<span id='OLE_LINK272'<span id='OLE_LINK273'<span id='OLE_LINK224'In the second aspect, take the feasible solutions obtained from the determined model into robust models to test the feasibility of the determined solutions in the robust model, and the results are shown in Figure 11. It can be seen from the figure that all the determined solutions are infeasible in the robust model. The results indicate that the solutions of the determined model can only guarantee the feasibility in a specific case, but not in the models with uncertain distribution parameters. Generally, the constraints violation degree in the second order moment model is significantly smaller than that in the first order moment model, which indicates that the first order moment is stricter than the second order moment model. With the increase of safety tolerance, the constraint violation degree decreases gradually, which indicates that the smaller the safety tolerance, the more strict of the robustness of the model is.

<span id='OLE_LINK242'<span id='OLE_LINK243'<span id='OLE_LINK249'<span id='OLE_LINK258'4.2 Comparison with Chance Constraint Model

In this section, the feasibility of robust solutions in the chance constraint model is verified. Take the robust solutions of first order moment model and second order moment model into the chance constraint model to test the feasibility. Since the uncertain parameters only exist in the constraints (6) and (9) of the spare parts supply model, only these two inequality constraints need to be tested. The corresponding opportunity constraint models are:

Since unknown the probability distribution of lead times and demands, it cannot be solved by probability density function. Even if the distribution of uncertain parameters is known, the solution of the joint probability density function in formula (23) is very time-consuming. So the Monte Carlo method is used to verify the feasibility of the solution <span id='cite-_Ref38381890'[14]. Because the first order moment robust optimization model is not feasible, only the second order moment optimization model is compared and analyzed.

50 samples of uncertain parameters are selected, take the robust solution of the second-order moment model into these samples, and calculate the times ${\displaystyle N_{T}{}'}$ and ${\displaystyle N_{d}{}'}$ that inequality (22) and (23) are satisfied.

<span id='OLE_LINK120'<span id='OLE_LINK121'<span id='OLE_LINK122'<span id='OLE_LINK132'<span id='OLE_LINK66'<span id='OLE_LINK67'<span id='OLE_LINK135'<span id='OLE_LINK68'where, ${\displaystyle \Delta (.)=1}$ , if ${\displaystyle .}$ is satisfied. else if, ${\displaystyle \Delta (.)=0}$ . Then, ${\displaystyle N_{T}{}'/N}$ and ${\displaystyle N_{d}{}'/N}$ are used to represent the value of ${\displaystyle Pr(\sum _{i\in I}\sum _{j\in J}T_{ij}^{}\cdot sgn(x_{ij}^{})+}$${\displaystyle \sum _{j\in J}\sum _{k\in K}T_{jk}^{}\cdot sgn(x_{jk}^{})\leq T{\mbox{ }}{\mbox{ }})}$ and ${\displaystyle {\mbox{ }}Pr(d_{k}-\sum _{j\in J}x_{jk}^{}\leq 0{\mbox{ }}){\mbox{ }}{\mbox{ }}}$ . If ${\displaystyle N_{T}{}'/N}$ or ${\displaystyle N_{d}{}'/N}$ were greater than or equal to ${\displaystyle 1-\epsilon }$ , the constraint (22) and (23) are satisfied.

The constraint satisfactions of the chance constraint model are shown in table 6. It can be seen that the constraints (22) and (23) are satisfied in all scenarios. As the safety tolerance decrease, the value of ${\displaystyle N_{T}{}'/N}$ and ${\displaystyle N_{d}{}'/N}$ are larger. This is because when the safety tolerance is small, the robust model is more strict, and the robustness of the robust solution is stronger, which lead to the greater the probability that the constraint is satisfied in chance constraint model.

${\displaystyle \epsilon }$	0.1	0.3	0.5	0.7	0.9</span>
${\displaystyle N_{T}{}'/N}$ </span>	0.9692</span>	0.8997</span>	0.7938</span>	0.7288</span>	0.6992</span>
${\displaystyle N_{d}{}'/N}$ , ${\displaystyle k=1}$ </span>	0.9269</span>	0.8194</span>	0.8187</span>	0.7938</span>	0.7994</span>
${\displaystyle N_{d}{}'/N}$ , ${\displaystyle k=2}$ </span>	0.9524</span>	0.8219</span>	0.8170</span>	0.7922</span>	0.7223</span>
${\displaystyle N_{d}{}'/N}$ , ${\displaystyle k=3}$ </span>	0.9461</span>	0.9403</span>	0.9396</span>	0.8959</span>	0.8843</span>
${\displaystyle N_{d}{}'/N}$ , ${\displaystyle k=4}$ </span>	0.9289</span>	0.8351</span>	0.7378</span>	0.7298</span>	0.6537</span>

5 Conclusion

<span id='OLE_LINK226'<span id='OLE_LINK227'<span id='OLE_LINK74'<span id='OLE_LINK75'<span id='OLE_LINK71'In this paper, the spare parts network optimization with uncertainty lead times and demands is studied. The determined supply model and its robust counterpart are developed, respectively. In the uncertainty model, the probability of the uncertainties are unknown, we focus on the reformulation of this model with the known first and second order moment. The robust solutions of uncertain models are obtained and the sensitivity analysis with different safety tolerance is curry out. Then the robustness is compared between the robust model and determined model and chance constraint model. The main contributions of this paper are as follows. Firstly, the ambiguity set is used to handle the uncertain probability distributions, and the robust counterpart of the supply model is reformulated to make the model tractable and computable. Secondly, the robust solutions that ensure the feasibility in the worst-case are obtained. These solutions ensure that the uncertain constraints are satisfied under any probability distribution within the moment based ambiguity set. The results of the case study show that the robustness of these solutions are stronger than those in the determined model and chance constraint model. Finally, we verified that the second order moment model is superior to the first moment order model because the second order moment model can make a balance in robustness and flexibility.

Reference

<span id='_Ref38381732'[1] Eaves, A H C，Kingsman, B G. (2004). Forecasting for the ordering and stock-holding of spare parts. Journal of the Operational Research Society 55(4):431-437

<span id='_Ref38381747'[2] Mao, H. L., Gao, J. W., Chen, X. J., & Gao, J. D. (2014). Demand Prediction of the Rarely Used Spare Parts Based on the BP Neural Network. Applied Mechanics and Materials, 1513–1519.

<span id='_Ref38381756'[3] Sadeghi, J., Sadeghi, S., & Niaki, S. T. A. (2014). A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: An NSGA-II with tuned parameters. Computers & Operations Research, 41, 53–64.

<span id='_Ref38381761'[4] Qiu Zhiping, Ni Zao.(2004). Probabilistic interval approach for determining the demand of aviation spares. Acta Aeronautica Et Astronautica Sinica, 30(5), 861-866.

<span id='_Ref38381766'[5] Axsäter, S. (1993). Optimization of order-up-to-s policies in two-echelon inventory systems with periodic review. Naval Research Logistics, 40(2), 245–253. </span>

<span id='_Ref38381799'[6] Kouki, C. , Babai, M. Z. , Jemai, Z. , & Minner, S. . (2018). Solution procedures for lost sales base-stock inventory systems with compound poisson demand. International Journal of Production Economics, S0925527318300513.

<span id='_Ref38381806'[7] Al-Rifai, M. H., & Rossetti, M. D. (2007). An efficient heuristic optimization algorithm for a two-echelon (R, Q) inventory system. International Journal of Production Economics, 109(1-2), 195–213.

<span id='_Ref38381812'[8] Hnaien, F., Delorme, X., & Dolgui, A. (2010). Multi-objective optimization for inventory control in two-level assembly systems under uncertainty of lead times. Computers & Operations Research, 37(11), 1835–1843.

<span id='_Ref38381823'<span id='_Ref527702845'[9] Gicquel, C. , & Cheng, J. . (2018). A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand. Annals of Operations Research, 264(1-2), 123-155.

<span id='_Ref38381827'[10] M. Talaei, M. B. Farhang, M. S.Pishvaee, et.al. “A robust fuzzy optimization model for carbon-efficient closed-loop supply chain network design problem: a numerical illustration in electronics industry,” Journal of Cleaner Production, vol. 113, pp. 662–673, 2016.

<span id='_Ref38381835'[11] Shang, C., You, F. . (2018). Distributionally robust optimization for planning and scheduling under uncertainty. Computers & Chemical Engineering, 110(FEB.2), 53-68.

<span id='_Ref38381847'[12] Gicquel, C., & Cheng, J. (2017). A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand. Annals of Operations Research, 264(1-2), 123–155</span>

<span id='_Ref38381866'[13] Shi, Y. , Boudouh, T. , & Grunder, O. . (2017). A Fuzzy Chance-constraint Programming Model for a Home Health Care Routing Problem with Fuzzy Demand. International Conference on Operations Research & Enterprise Systems.

<span id='_Ref38381890'[14] Rubinstein, R. Y, & Kroese, D. P.(1983). Simulation and the Monte Carlo Method.by Reuven Y. Rubinstein. Journal of the American Statistical Association, 78(382):511-512.

---

• Corresponding author. Tel.: +86 18795428481; E-mail: xwzj0003@gmail.com