(→2.2 Determined model) |
|||
Line 197: | Line 197: | ||
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. | 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: | 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: | ||
− | + | {| class="formulaSCP" style="width: 100%; text-align: center;" | |
− | + | |- | |
− | {\int }_{\xi \in R^K}f(\xi )d\xi =1\\ | + | | |
+ | {| style="text-align: left; margin:auto;width: 100%;" | ||
+ | |- | ||
+ | | style="text-align: center;" | <math>D=\left\{f(\xi ):\begin{array}{c} | ||
+ | \displaystyle {\int }_{\xi \in R^K}f(\xi )d\xi =1\\ | ||
E[\xi ]-{\mu }_0=0 | E[\xi ]-{\mu }_0=0 | ||
− | \end{array}\right\}</math> (12) | + | \end{array}\right\}</math> |
+ | |} | ||
+ | | style="width: 5px;text-align: right;white-space: nowrap;" | (12) | ||
+ | |} | ||
− | + | {| class="formulaSCP" style="width: 100%; text-align: center;" | |
− | + | |- | |
− | {\int }_{\xi \in R^K}f(\xi )d\xi =1\\ | + | | |
+ | {| style="text-align: left; margin:auto;width: 100%;" | ||
+ | |- | ||
+ | | style="text-align: center;" | <math>D=\left\{f(\xi ):\begin{array}{c} | ||
+ | \displaystyle{\int }_{\xi \in R^K}f(\xi )d\xi =1\\ | ||
E[\xi ]-{\mu }_0=0\\ | E[\xi ]-{\mu }_0=0\\ | ||
var(\xi )=E[{\left(\xi -{\mu }_0\right)}^2]={\sigma }_0^2 | var(\xi )=E[{\left(\xi -{\mu }_0\right)}^2]={\sigma }_0^2 | ||
− | \end{array}\right\}</math> (13) | + | \end{array}\right\}</math> |
+ | | style="width: 5px;text-align: right;white-space: nowrap;" | (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 <math>{\mu }_0</math> and <math>{\sigma }_0^2</math> represent the mean and variance obtained from historical data, <math>D</math> denotes the support of the family of all probability distributions with known moment information and <math>f(\xi )</math> is the probability density function (PDF) of the random variable <math>\xi </math>. | |
− | + | 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>[[#_Ref38381847|[12]]]. In our spare parts optimization model, the uncertain parameters just exist in constraints. In Eqs. (6) and (9), the lead time <math>T_{ij}</math> and <math>T_{jk}</math> and the spare parts demands <math>d_k</math> 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: | |
− | + | {| class="formulaSCP" style="width: 100%; text-align: center;" | |
− | + | |- | |
+ | | | ||
+ | {| style="text-align: left; margin:auto;width: 100%;" | ||
+ | |- | ||
+ | | style="text-align: center;" | <math>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 </math> | ||
+ | | style="width: 5px;text-align: right;white-space: nowrap;" | (14) | ||
+ | |} | ||
− | + | The single chance constraint of Eqs. (9) is as follows: | |
− | + | {| class="formulaSCP" style="width: 100%; text-align: center;" | |
− | + | |- | |
+ | | | ||
+ | {| style="text-align: left; margin:auto;width: 100%;" | ||
+ | |- | ||
+ | | style="text-align: center;" | <math>Pr(d_k-\sum_{j\in J}x_{jk}\leq 0)\geq 1-\epsilon ,\qquad k=1,2,\cdots ,K</math> | ||
+ | | style="width: 5px;text-align: right;white-space: nowrap;" | (15) | ||
+ | |} | ||
− | + | where, <math>\epsilon \in (0,1)</math> represents a specified safety tolerance or violation probability, and all constraints take the same <math>\epsilon </math>. | |
− | + | In terms of random variable <math>\xi </math>, if the probability density function <math>\xi </math> is known, it is easy to solve the inequality <math>Pr(\xi \leq b)\leq \alpha </math> by <math>b\leq F_{\xi }^{-1}(\alpha )</math> <span id='cite-_Ref38381866'></span>[[#_Ref38381866|[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 <math>\sum_{i\in I}\sum_{j\in J}T_{ij}\cdot sgn(x_{ij})+</math><math>\sum_{j\in J}\sum_{k\in K}T_{jk}\cdot sgn(x_{jk})</math>. 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: | |
− | + | {| class="formulaSCP" style="width: 100%; text-align: center;" | |
− | + | |- | |
+ | | | ||
+ | {| style="text-align: left; margin:auto;width: 100%;" | ||
+ | |- | ||
+ | | style="text-align: center;" | <math>\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 </math> | ||
+ | | style="width: 5px;text-align: right;white-space: nowrap;" | (16) | ||
+ | |} | ||
− | + | {| class="formulaSCP" style="width: 100%; text-align: center;" | |
− | + | |- | |
+ | | | ||
+ | {| style="text-align: left; margin:auto;width: 100%;" | ||
+ | |- | ||
+ | | style="text-align: center;" | <math>\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</math> | ||
+ | | style="width: 5px;text-align: right;white-space: nowrap;" | (17) | ||
+ | |} | ||
− | + | In the case of only the first order moments are known, for an arbitrary distributional random variable <math>\mbox{ }\mbox{ }\mbox{ }\xi </math>. According to the Markov's inequality, there is <math>Pr\left\{\xi \geq k\right\}\leq \frac{E(\xi )}{k},\, X\geq 0,k\geq 0</math>. Therefore, we can get the robust counterparts of Eqs. (16) and (17) as follows: | |
− | + | {| class="formulaSCP" style="width: 100%; text-align: center;" | |
− | + | |- | |
+ | | | ||
+ | {| style="text-align: left; margin:auto;width: 100%;" | ||
+ | |- | ||
+ | | style="text-align: center;" | <math>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 </math> | ||
+ | | style="width: 5px;text-align: right;white-space: nowrap;" | (18) | ||
+ | |} | ||
− | + | {| class="formulaSCP" style="width: 100%; text-align: center;" | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
|- | |- | ||
− | | <math>\ | + | | |
− | | | + | {| style="text-align: left; margin:auto;width: 100%;" |
+ | |- | ||
+ | | style="text-align: center;" | <math>\frac{E(d_k)}{\sum_{j\in J}x_{jk}}\leq \epsilon ,\qquad k=1,2,\cdots ,K</math> | ||
+ | | style="width: 5px;text-align: right;white-space: nowrap;" | (19) | ||
|} | |} | ||
− | + | '''Proof.''' For inequality (16), there is: | |
− | {| | + | |
+ | {| class="formulaSCP" style="width: 100%; text-align: center;" | ||
|- | |- | ||
− | | <math>\ | + | | |
− | | <math>\ | + | {| style="text-align: left; margin:auto;width: 100%;" |
+ | |- | ||
+ | | style="text-align: center;" |<math>\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)</math> | ||
+ | |- | ||
+ | | <math>=\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\}</math> | ||
+ | |- | ||
+ | | <math>\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 </math> | ||
+ | |- | ||
+ | |<math>\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 </math> | ||
+ | |} | ||
|} | |} | ||
− | |||
− | |||
− | |||
For inequality (17), there is:</span> | For inequality (17), there is:</span> |
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
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.
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.
: the amount of supply centers, ;
: the amount of distribution centers, ;
: the amount of customers, ;
: the lead time between supply center and distribution center , which is uncertain;
: the lead time between distribution center and customer , which is uncertain;
: the required maximum lead time.
: unit spare parts transportation costs between supply center and distribution center ;
: unit spare parts transportation costs between distribution center and customer ;
: fixed opening costs of distribution center ;
: unit spare parts inventory cost of distribution center ;
: unit spare parts inventory cost of customer ;
: unit shortage loss of customer ;
: spare parts demand of customer, which is uncertain ;
: the maximum spare parts capacity of distribution center .
Decision variables:
: the amount of spare parts supply from supply center to distribution center ;
: the amount of spare parts supply from distribution center to customer ;
: binary variable, used to label the opening of distribution center . If distribution center is opening, , otherwise, .
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:
|
(1) |
where represents the total opening costs, the total transportation costs, the total inventory costs, and the total shortage loss. Each costs are calculated as follows:
|
(2) |
|
(3) |
|
(4) |
|
(5) |
where represents .
The following constraints should be satisfied:
s.t.
|
(6) |
|
(7) |
|
(8) |
|
(9) |
|
(10) |
|
(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.
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:
|
(12) |
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 and represent the mean and variance obtained from historical data, denotes the support of the family of all probability distributions with known moment information and is the probability density function (PDF) of the random variable . 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 and and the spare parts demands 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:
|
Published on 12/01/21
Accepted on 12/11/20
Submitted on 13/07/20
Volume 37, Issue 1, 2021
DOI: 10.23967/j.rimni.2020.11.002
Licence: CC BY-NC-SA license
Are you one of the authors of this document?