# Distribution Network Design for Fixed Lifetime Perishable Products: A Model and Solution Approach

Authors: Z. Firoozi; N. Ismail; Sh. Ariafar; S. H. Tang; M. K. A. M. Ariffin; A. Memariani
Journal: Journal of Applied Mathematics
 (2013)

---

## Abstract

Nowadays, many distribution networks deal with the distribution and storage of perishable products. However, distribution network design models are largely based on assumptions that do not consider time limitations for the storage of products within the network. This study develops a model for the design of a distribution network that considers the short lifetime of perishable products. The model simultaneously determines the network configuration and inventory control decisions of the network. Moreover, as the lifetime is strictly dependent on the storage conditions, the model develops a trade-off between enhancing storage conditions (higher inventory cost) to obtain a longer lifetime and selecting those storage conditions that lead to shorter lifetimes (less inventory cost). To solve the model, an efficient Lagrangian relaxation heuristic algorithm is developed. The model and algorithm are validated by sensitivity analysis on some key parameters. Results show that the algorithm finds optimal or near optimal solutions even for large-size cases.


---

## Body

## 1. Introduction

A considerable proportion of the products produced worldwide are perishable. For instance, 50% of sales in the US grocery industry are due to perishable products [1], and in the area of blood management, more than 92 million units of blood, which are perishable, are collected globally every year, according to the World Health Organization (WHO) [2]. Medicines, pharmaceutical products, and many industrial products are other varieties of perishable goods. Perishable products are only usable during their lifetime; when their lifetime is over, they must be discarded [3]. This lifetime must be considered when deciding on inventory control policies for perishable products [4–6]. High volume production and high sensitivity imply that, for perishable products, distribution network design (DND) is of great significance.DND is one of the most comprehensive decision problems in logistics and supply chain management [7–10]. Formerly, DND models only considered strategic decisions, including facility location, capacity planning, and transportation mode selection. Studies by Amiri [11] and Melkote and Daskin [12] can be cited as examples of this group. Other important decisions, such as routing and inventory control, either were not intended in the distribution network design or were considered after determination of the strategic decisions and not contemporaneously. The components of cost associated with these decisions are estimated to contribute about 10% to 25% of the sale [13]. Additionally, these decisions are highly interdependent [14, 15]. For instance, location decisions have a significant impact on the inventory and transportation cost [16], such that decreasing the number of warehouses in a network, reduces inventory cost but increases transportation costs [14]. Thus, traditional approaches that only consider strategic decisions or that optimize decisions separately could overlook potentially large cost savings and improved customer satisfaction [7]. Evidence for this hypothesis can be found in the study by Miranda and Garrido [17]. Their work concluded that a simultaneous approach to optimizing inventory and facility location decisions could lead to greater cost savings in comparison with a sequential approach that optimizes location decisions first and inventory decisions later. Therefore, a more comprehensive concept emerged, that is integrated distribution network design, which simultaneously optimizes a wider range of decisions, including: facility location, transportation, inventory control, routing, ordering, and production scheduling. Examples of the latter group are studies by Berman et al. [18] and Tsao et al. [19].Despite a large number of distribution networks that deal with the transportation and storage of perishable products [5, 6, 20, 21], many of the integrated network design models consider an infinite lifetime for commodities, which makes them unsuitable for perishable products [4, 22]. However, the cost and quality of final products are strictly related to the efficiency of network design [23]. Therefore, new research is required to incorporate inventory models of perishable products into integrated distribution network design models. Accordingly, the aim of this paper is to formulate and solve an integrated inventory location model for perishable commodities with fixed lifetimes. The effect of lifetime and some other key parameters on the objective function are investigated in this study.


## 2. Research Background

A typical distribution network consists of one or more suppliers, a set of retailers, and a set of distribution centers. The distribution centers act as stocking points in the network that order products from suppliers to fulfill the demands of retailers. The inventory of several retailers is aggregated into one distribution center. The objective of an integrated location-inventory model is to determine the optimal number and location of the distribution centers, the assignment of retailers to distribution centers, and the optimal inventory level of the distribution centers, such that total transportation, inventory, and fixed installation costs are minimized [24].One of the most cited integrated inventory location model is the location model with risk pooling (LMRP) developed by Daskin et al. [25]. This model incorporated inventory and safety stock decisions into the single product uncapacitated facility location problem (UFLP). The solution method was based on Lagrangian relaxation. Shen et al. [26] also solved the LMRP, but used a set partitioning approach. Both of these works assumed that the demands of retailers were deterministic and that the proportions of mean to the variance of demands for all retailers were identical. LMRP was then extended in different ways. A multiproduct version of LMRP was developed by Shen [27], solving the model using the Lagrangian relaxation. Shu et al. [28] solved a general case of LMRP in which the proportions of mean to the variance for retailers’ demands were not identical. Sourirajan et al. [29] and Sourirajan et al. [30] developed the LMRP by removing the assumption of identical lead times between supplier and distribution centers (DCs). Qi and Shen [31] studied the effects of uncertainty on network design decisions. Max Shen and Qi [16] estimated the total routing cost of the network and incorporated it into the LMRP. The problem was solved using Lagrangian relaxation. Gebennini et al. [32] developed a dynamic version of the problem that simultaneously determined the network configuration decisions, inventory control decisions, and production rate of a network. Jha et al. [33] studied the effect of transportation costs of a joint inventory location model using a modified adaptive differential evolution algorithm. Melo et al. [34] addressed the problem of redesigning a distribution network, a context that is rarely considered in the literature. Shavandi and Bozorgi [35] considered the demand as a fuzzy variable and formulated the problem using the credibility theory in order to locate distribution centers as well as to determine inventory levels in DCs. Several joint location the inventory problems with stochastic retailer demand were also studied by Atamtürk et al. [36].One of the disadvantages of LMRP is that this model does not consider capacity restrictions of distribution centers. Miranda and Garrido [17] presented an extension of LMRP by including capacity constraints of distribution centers into the objective function of the LMRP model. Ozsen et al. [14] and Miranda and Garrido [37] defined a new stochastic constraint based on inventory management policy. This constraint makes sure that the maximum inventory on hand in each DC does not exceed the DCs’ storage capacity. Inclusion of this stochastic capacity constraint provided the trade-off between the establishment of more warehouses (increase of fixed facility cost) versus more frequent ordering from the supplier (increase of the ordering cost) in distribution networks. Ozsen et al. [14] included stochastic DCs’ capacity restrictions into the LMRP. They assumed that the demands of retailers follow a Poisson distribution. The newly derived model was called the capacitated location model with risk pooling (CLMRP) and was solved using the Lagrangian relaxation. Both of the above mentioned papers assumed an economic order quantity (EOQ) and (Q,r) as the inventory policy for the distribution networks.Another body of the literature related to this research falls under the perishable inventory control theory. According to Goyal and Giri [38], one group of perishable inventories are those that have a fixed lifetime or a predetermined expiry date. Important examples of this group of commodities are human blood, medical drugs, and most processed food. Literature on fixed lifetime perishable inventory is rich, for example, the studies by [6, 22, 39, 40]. However, despite their valuable contributions, these papers did not incorporate perishable inventory control into integrated DND models. Similarly, among network design models, Daskin et al. [25], Shen et al. [26], and Shu et al. [28] stated that their studies were motivated by the work of a blood bank network, responsible for the production and distribution of one of the most perishable types of blood products. Nevertheless, the developed models in the mentioned studies did not consider the lifetime of this product.In this paper, the Lagrangian relaxation is selected as the solution method and thus, it is worth presenting a brief review of this method. The best motivation for using the Lagrangian relaxation for applied optimization was the work of Held and Karp [41] who successfully employed this method to solve the traveling salesman problem. Since then the Lagrangian relaxation has been using widely for discrete optimization problems as well as for facility location problems. In UFLP, for example, the common Lagrangian relaxation technique is to relax the assignment constraints. However, in CFLP (capacitated facility location problem) either of the assignment constraints or capacity constraints can be relaxed; see, for instance, [42, 43]. LMRP and CLMRP, which provide a basis for many distribution network design problems, are variants of UFLP and CFLP, respectively. These models can also be solved by relaxing the same constraints that are relaxed in their base model, or any other constraint depending on the mathematical model; see, for instance, [14, 17, 25].


## 3. Problem Definition and Modeling

This paper aims to design a three-level distribution network for perishable products consisting of one supplier, a set of retailers, and a set of distribution centers (DCs). The DCs order products from the supplier under an EOQ(Q,r) inventory policy and store them to meet the demands of retailers. The EOQ policy determines the order quantity that minimizes total ordering and working inventory costs. However, in (Q,r) policy, when the inventory level drops below the reorder point (r), an order of Q will be placed [44]. In order to approximate the EOQ (Q,r) policy, as discussed by [14, 26, 45], the order quantity must be determined initially under basic EOQ inventory policy, and then based on the order quantity, the reorder point (r) is calculated.This paper considers that the demands of retailers are independent and follow a normal distribution. Moreover, the retailers do not hold any inventory, and the inventory of retailers (working inventory and safety stock) is centralized in a number of DCs. This situation provides the system the opportunity of exploiting the advantages of risk pooling that eventually reduces the inventory costs.A model is developed to determine the configuration and inventory control decision of the network. This model is an extension of the location model with risk pooling (LMRP), which was developed by Daskin et al. [25]. In LMRP, the ordering cycle is calculated by the formula Q/D, where Q is the order quantity and D is the annual mean demand of the DCs. However, if products are perishable and their lifetime is less than the period of the ordering cycle, then this inventory policy is not appropriate. This is because, according to Figure 1, before all the products are demanded by the retailers, their lifetimes are over. To avoid this situation, the model should specify a condition on ordering cycle, such that it does not exceed the lifetime, as is shown in Figure 2.Figure 1
Inventory cycle and lifetime.Figure 2
Inventory cycle for a perishable product.An underlying issue that must be considered regarding perishable products is the dependency of their lifetimes on storage conditions. Ordinarily, any improvement in the storage conditions increases the inventory holding costs, but consequently a longer lifetime is achieved. Therefore, managers of a distribution network have to choose between increasing inventory costs (longer lifetime) and reducing the ordering cycle (shorter lifetime). The model that is developed in this study, in addition to determining the network configuration and inventory control decisions, helps managers calculate such a trade-off.The remainder of this section describes how the model is formulated. Notation used to model the problem is listed, at the end of the paper.


### 3.1. Objective Function

This problem is formulated as a nonlinear mixed integer mathematical model. The objective function minimizes the total annual costs, comprising the following: holding inventory and safety stock cost, ordering cost, transportation cost, and fixed installation cost of DCs. The components of the objective function is described in the following.


#### 3.1.1. Holding Cost

The total inventory maintained in the system consists of two components: working inventory and safety stock. The annual working inventory cost for each DC equals the average inventory on hand multiplied by the inventory cost. The safety stock cost is computed by multiplying the amount of safety stock by the inventory cost. If the demands of retailers are independent and follow a normal distribution, the safety stock ofDCi, that is, SSi, is achieved by the formulaZαltiVi. Symbol Vi represents the variance of DCi that equals the summation of the variances of the retailers’ demands that are assigned to that DC. To find Vi, it is considered at the moment that the assignment of retailers to DCs is known. Therefore, Vi=∑j(vjyij) and the inventory cost of DCi can be written as
(1)hiQi2+Zαhilti∑j(vjyij).
In (1), the first term represents the average working inventory holding, cost and the second term is the safety stock holding cost.


#### 3.1.2. Ordering Cost

Ordering cost ofDCi can be formulated as
(2)Oi∑j(djyij)Qi,
where ∑j(djyij)/Qi represents the number of orders placed by DCi per year.


#### 3.1.3. Transportation Cost

The transportation cost from the supplier toDCi and from there to the retailers is calculated by (3). In this formula, the first term is the fixed transportation cost that depends on the number of shipments (shipment size is assumed to be equal to Q), and the second term is the variable transportation cost that depends on the number of items shipped. Therefore,
(3)Ai∑j(djyij)Qi+T∑jdjyij(disij+tdc-su)∀i∈I.


#### 3.1.4. Fixed Setup Cost

The cost of establishingDCi is calculated by the following:
(4)Fixi∀i∈I,
where xi is a binary variable that is equal to 1 if DCi is established; otherwise, it is equal to 0.


#### 3.1.5. Effect of Lifetime on the Inventory Policy

If the products’ deterioration begins after they are released from the supplier, then upon delivery to the distribution centers, they will have lost part of their lifetime equivalent to the lead time. On the other hand, according to Figure3, the maximum time that a product remains in a DC is equal to the ordering cycle plus tss. The period tss is the required time to replace the safety stock by a new inventory.Figure 3
Profile of inventory level over time.Therefore we can write(5)QiDi+SSiDi≤pti-lti,
where the first term represents the order cycle and the second term represents tss. This inequality can be rewritten as follows:
(6)Qi≤(pt-lt)Di-SSi.
Substituting Di and SSi by their amounts into the above inequality, the following constraint for order quantity is achieved:
(7)Qi≤(pti-lti)∑j(djyij)-Zαlti∑j(vjyij)∀i∈I.


#### 3.1.6. Total Annual Cost

According to the components of cost described above, the total annual costs can be written as(8)min∑ihi(Qi2+Zαlti∑j(vjyij))aaaaa+∑i∑j(Oi+Ai)(djyij)Qi+∑iFixiaaaaa+∑i∑jT(disij+tdc-su)djyij
s.t. 										(9)∑iyij=1∀j∈J,(10)xi≥yij,∀i∈I,∀j∈J,(11)Qi≤(pti-lti)∑j(djyij)-Zαlti∑j(vjyij),∀i∈I,(12)xi,yij={1,0},∀i∈I,∀j∈J.
Constraint (9) ensures a single-sourcing strategy for retailers. Constraint (10) makes sure that retailers are not assigned to nonestablished DCs. Constraint set (11) avoids the products from remaining in each DC for longer than their lifetime, and constraint set (12) specifies that xi, yij are binary variables.


## 3.1. Objective Function

This problem is formulated as a nonlinear mixed integer mathematical model. The objective function minimizes the total annual costs, comprising the following: holding inventory and safety stock cost, ordering cost, transportation cost, and fixed installation cost of DCs. The components of the objective function is described in the following.


### 3.1.1. Holding Cost

The total inventory maintained in the system consists of two components: working inventory and safety stock. The annual working inventory cost for each DC equals the average inventory on hand multiplied by the inventory cost. The safety stock cost is computed by multiplying the amount of safety stock by the inventory cost. If the demands of retailers are independent and follow a normal distribution, the safety stock ofDCi, that is, SSi, is achieved by the formulaZαltiVi. Symbol Vi represents the variance of DCi that equals the summation of the variances of the retailers’ demands that are assigned to that DC. To find Vi, it is considered at the moment that the assignment of retailers to DCs is known. Therefore, Vi=∑j(vjyij) and the inventory cost of DCi can be written as
(1)hiQi2+Zαhilti∑j(vjyij).
In (1), the first term represents the average working inventory holding, cost and the second term is the safety stock holding cost.


### 3.1.2. Ordering Cost

Ordering cost ofDCi can be formulated as
(2)Oi∑j(djyij)Qi,
where ∑j(djyij)/Qi represents the number of orders placed by DCi per year.


### 3.1.3. Transportation Cost

The transportation cost from the supplier toDCi and from there to the retailers is calculated by (3). In this formula, the first term is the fixed transportation cost that depends on the number of shipments (shipment size is assumed to be equal to Q), and the second term is the variable transportation cost that depends on the number of items shipped. Therefore,
(3)Ai∑j(djyij)Qi+T∑jdjyij(disij+tdc-su)∀i∈I.


### 3.1.4. Fixed Setup Cost

The cost of establishingDCi is calculated by the following:
(4)Fixi∀i∈I,
where xi is a binary variable that is equal to 1 if DCi is established; otherwise, it is equal to 0.


### 3.1.5. Effect of Lifetime on the Inventory Policy

If the products’ deterioration begins after they are released from the supplier, then upon delivery to the distribution centers, they will have lost part of their lifetime equivalent to the lead time. On the other hand, according to Figure3, the maximum time that a product remains in a DC is equal to the ordering cycle plus tss. The period tss is the required time to replace the safety stock by a new inventory.Figure 3
Profile of inventory level over time.Therefore we can write(5)QiDi+SSiDi≤pti-lti,
where the first term represents the order cycle and the second term represents tss. This inequality can be rewritten as follows:
(6)Qi≤(pt-lt)Di-SSi.
Substituting Di and SSi by their amounts into the above inequality, the following constraint for order quantity is achieved:
(7)Qi≤(pti-lti)∑j(djyij)-Zαlti∑j(vjyij)∀i∈I.


### 3.1.6. Total Annual Cost

According to the components of cost described above, the total annual costs can be written as(8)min∑ihi(Qi2+Zαlti∑j(vjyij))aaaaa+∑i∑j(Oi+Ai)(djyij)Qi+∑iFixiaaaaa+∑i∑jT(disij+tdc-su)djyij
s.t. 										(9)∑iyij=1∀j∈J,(10)xi≥yij,∀i∈I,∀j∈J,(11)Qi≤(pti-lti)∑j(djyij)-Zαlti∑j(vjyij),∀i∈I,(12)xi,yij={1,0},∀i∈I,∀j∈J.
Constraint (9) ensures a single-sourcing strategy for retailers. Constraint (10) makes sure that retailers are not assigned to nonestablished DCs. Constraint set (11) avoids the products from remaining in each DC for longer than their lifetime, and constraint set (12) specifies that xi, yij are binary variables.


## 3.1.1. Holding Cost

The total inventory maintained in the system consists of two components: working inventory and safety stock. The annual working inventory cost for each DC equals the average inventory on hand multiplied by the inventory cost. The safety stock cost is computed by multiplying the amount of safety stock by the inventory cost. If the demands of retailers are independent and follow a normal distribution, the safety stock ofDCi, that is, SSi, is achieved by the formulaZαltiVi. Symbol Vi represents the variance of DCi that equals the summation of the variances of the retailers’ demands that are assigned to that DC. To find Vi, it is considered at the moment that the assignment of retailers to DCs is known. Therefore, Vi=∑j(vjyij) and the inventory cost of DCi can be written as
(1)hiQi2+Zαhilti∑j(vjyij).
In (1), the first term represents the average working inventory holding, cost and the second term is the safety stock holding cost.


## 3.1.2. Ordering Cost

Ordering cost ofDCi can be formulated as
(2)Oi∑j(djyij)Qi,
where ∑j(djyij)/Qi represents the number of orders placed by DCi per year.


## 3.1.3. Transportation Cost

The transportation cost from the supplier toDCi and from there to the retailers is calculated by (3). In this formula, the first term is the fixed transportation cost that depends on the number of shipments (shipment size is assumed to be equal to Q), and the second term is the variable transportation cost that depends on the number of items shipped. Therefore,
(3)Ai∑j(djyij)Qi+T∑jdjyij(disij+tdc-su)∀i∈I.


## 3.1.4. Fixed Setup Cost

The cost of establishingDCi is calculated by the following:
(4)Fixi∀i∈I,
where xi is a binary variable that is equal to 1 if DCi is established; otherwise, it is equal to 0.


## 3.1.5. Effect of Lifetime on the Inventory Policy

If the products’ deterioration begins after they are released from the supplier, then upon delivery to the distribution centers, they will have lost part of their lifetime equivalent to the lead time. On the other hand, according to Figure3, the maximum time that a product remains in a DC is equal to the ordering cycle plus tss. The period tss is the required time to replace the safety stock by a new inventory.Figure 3
Profile of inventory level over time.Therefore we can write(5)QiDi+SSiDi≤pti-lti,
where the first term represents the order cycle and the second term represents tss. This inequality can be rewritten as follows:
(6)Qi≤(pt-lt)Di-SSi.
Substituting Di and SSi by their amounts into the above inequality, the following constraint for order quantity is achieved:
(7)Qi≤(pti-lti)∑j(djyij)-Zαlti∑j(vjyij)∀i∈I.


## 3.1.6. Total Annual Cost

According to the components of cost described above, the total annual costs can be written as(8)min∑ihi(Qi2+Zαlti∑j(vjyij))aaaaa+∑i∑j(Oi+Ai)(djyij)Qi+∑iFixiaaaaa+∑i∑jT(disij+tdc-su)djyij
s.t. 										(9)∑iyij=1∀j∈J,(10)xi≥yij,∀i∈I,∀j∈J,(11)Qi≤(pti-lti)∑j(djyij)-Zαlti∑j(vjyij),∀i∈I,(12)xi,yij={1,0},∀i∈I,∀j∈J.
Constraint (9) ensures a single-sourcing strategy for retailers. Constraint (10) makes sure that retailers are not assigned to nonestablished DCs. Constraint set (11) avoids the products from remaining in each DC for longer than their lifetime, and constraint set (12) specifies that xi, yij are binary variables.


## 4. Solution Method

To solve the model, a heuristic Lagrangian relaxation algorithm is developed. The Lagrangian relaxation is one of the most widely used techniques that have been applied successfully to solve distribution network design problems. In the Lagrangian relaxation, the constraints that introduce difficulty to the problem are removed and added to the objective function with a penalty term. The new problem provides a lower (upper) bound for the main minimization (maximization) problem [46]. Solution quality and high speed are two significant specifications of this method, as reported in studies by Daskin et al. [25], Miranda and Garrido [17], Shen [27], Miranda and Garrido [37], Sourirajan et al. [29], Max Shen and Qi [16], Snyder et al. [47], Qi and Shen [31], Miranda and Garrido [7], Ozsen et al. [14], Mak and Shen [48], and Park et al. [45]. In the following, the procedure of finding upper and lower bounds on the optimal value of the proposed model are described.


### 4.1. Lower Bound

As the objective function (8) subject to (9)–(12) is an extension of UFLP, to find a lower bound, the DC retailer assignment constraint (9) is relaxed. The new function is called a Lagrangian dual problem, as is shown by (13) subject to (14)–(16). Lagrangian dual problem provides a lower bound for the main objective function (8) subject to (9)–(12), as follows:
(13)maxγ≥0minx,y∑ihi(Qi2+Zαlti∑jvjyij)maxγ≥0minx,y+∑i∑j(Oi+Ai)djyijQi+∑iFiximaxγ≥0minx,y+∑i∑jT(disij+tdc-su)djyij+∑jπj(1-∑iyij)
s.t. 								(14)xi≥yij∀i∈I,∀j∈J,(15)Qi≤(pti-lti)∑j(djyij)-Zαlti∑j(vjyij)∀i∈I,(16)xi,yij={1,0}∀i∈I,∀j∈J.
To solve the objective function (13) subject to (14)–(16), it is considered at the moment that constraint set (15) is not active. Therefore, the order quantity Qi is calculated by the following formula:
(17)Qi=2(Oi+Ai)∑jdjyijhi.
By substituting Qi in formula (13) the following function is obtained:
(18)maxγ≥0minx,y∑iKi∑jdjyij+∑iKi′∑jvjyijmaxγ≥0minx,y+∑i∑j(wijdj-πj)yij+∑iFixi+∑jπj,
where
(19)Ki=2hi(Oi+Ai),Ki′=hiZαlti,wij=T∑j(tdc-su+disij).
Objective function (18) is then decomposed into subproblems for each DC candidate location, as follows:
(20)Si=minKi∑jdjyij+Ki′∑jvjyij∑jvjyij+∑j(wijdj-πj)yij+Fixi+∑jπj.
The KKT conditions for the problem are
(21)∂Li(y,π)∂yij=∑iKi∑jdjyij+∑iKi′∑jvjyij∂yij+∑i∑j(wijdj-πj)=0∀j∈J,(22)πj≥0,∀j∈J,(23)∑iyij-1=0,∀j∈J.
The first term in (21) is called the marginal inventory cost of retailerj, that is the difference in the inventory cost of DCi between assigning retailerj to DCi or not. Let the symbol mij represent the marginal inventory cost of retailerj. Then according to Si, mij can be written as in the following:
(24)mij=Ki(∑jdjyi,j-∑j-1dj-1yi,j-1)+Ki′(∑jvjyi,j-∑j-1vj-1yi,j-1).
To make this function independent from other retailers assigned to the same DCi, a lower bound of it is selected to work with, as follows:
(25)mij=Kilogdj+Ki′logvj.
So if retailerj is assigned to DCi, the individual benefit of it would be as follows:
(26)IB´ij=Kilogdj+Ki′logvj+wi,jdj-πj.
If IB´ij>0, then retailerj cannot be assigned to DCi, and therefore, yij=0 for all retailer. However, if IB´ij≤0, then retailerj will be assigned to DCi if it leads to a negative value for Si. Therefore, for each DC, initially a list of retailers having the necessary condition ofIB´ij≤0 is made. Then, set Gi is made as follow by arranging retailers in ascending order of theirIB´ij:
(27)Gi={j∈Js.t.IB´ij-1≤IB´ij,IB´j≤0}.
The first retailer from set Gi is assigned to DCi if it leads to a negative value for Si. Each of the following retailers is assigned one by one to DCi if the previous retailer (from set Gi) is assigned to DCi and if its assignment to DCi leads to a better (lower) value for Si. Retailers that are assigned to DCi are removed from set Gi and are added to set Gi´. If there is at least one retailer in Gi´, then xi is set to 1. For all retailers that belong to set Gi´, yij is set to 1.Moreover, the value of the Lagrangian multiplierπj in each iteration of the algorithm is updated using the subgradient optimization technique. The lower-bound calculation steps are presented in  Algorithm 1.Algorithm 1:Lower bound calculation.
p
=
1, π = Initial value for of Lagrangian multiplier, N = number of DCs,
M = number of retailers
Fori=1 to N
For j=1 to M
Calculate IB´ij (IB´ij = individual benefit of retailerj if assigned to DCi)
Make set Gi, so that Gi={j∈Js.t.IB´ij<0}
End
Arrange members of Gi in ascending order of IB´ij
Repeat the following steps for all members of Gi
Compute Si(p) as follow
Si(p) = Cost of DCi if the first p members of set Gi are assigned to DCi
Si(p)=Ki∑jdjyij+Ki′∑jvjyij+∑j(wijdj-πj)yij+Fixi+∑jπj,
Ki=2hi(Oi+Ai),Ki′=hiZαlti,wij=T∑j(tdc-su+disij)
If p=1
IfSi(1)<0
Assign the 1st member ofGi to DCi, (yij=1 and xi=1)
End
End
p=p+1;
If Si(p-1)<0 and Si(p)<0;
Assign thepth member of Gi to DCi, (yij=1)
End
End
End
Calculate current lower bound using the following formula
current lower bound=∑ihi((Qi/2)+Zαlti∑jvjyij)+∑i∑j(Oi+Ai)(djyij/Qi)+∑iFixi
+
∑
i
∑
j
T
(
dis
i
j
+
t
dc-su
)
d
j
y
i
j
+
∑
j
π
j
(
1
-
∑
i
y
i
j
)


### 4.2. Upper Bound

The solution that is found by the lower bound might be infeasible. Therefore, the upper bound modifies it to be a feasible solution for the main objective function. To achieve this, in the developed algorithm of this paper, at first, the lower bound solution is displayed in the form of a 0-1 matrix. The number of rows of this matrix is equal to the number of DCs, and the number of columns is equal to the number of retailers. If the array ofith row and jth column equals 1, it means that retailerj is assigned to DCi. The lower-bound solution described in Section 4.1 may need to be modified in two steps: the first step takes into account the single-sourcing constraint and the next step considers constraint (11) that is also referred to as Q constraint in this text. To do the first step, the retailers that are assigned to no DC are considered, and all the arrays of their corresponding columns are initially set to 1. Then, for each DC (row) the objective function is calculated. The DC that has the minimum objective function is selected and all of its arrays are set to be fixed. Then, if retailers of this DC are also assigned to other DCs, all other similar assignments are removed. This procedure is repeated until all retailers are allocated to only one DC. To do the second step, a DC that its Q constraint is violated is selected. Then its retailers are removed one by one until its Q constraint is satisfied. The first retailer that would be removed is the one that was assigned last to set Gi´in lower-bound calculation. The removed retailer is assigned to another DC that increases the total cost the least, considering feasibility conditions. The upper bound calculation steps and the Lagrangian relaxation algorithm are presented in Algorithms 2 and 3, respectively.Algorithm 2:Upper bound calculation.
Generating feasible solution from the lower bound solution
Phase 1 generating a solution that satisfy single sourcing constrain
i
min
=
0, N = number of DCs, M = number of retailers
Forj=1 to M
If∑i=0Nyij=0 (if a retailer exist that is assigned to no DC, allocate this retailer to all DCs)
yij=1∀i∈I={1,2,…,N};
End
Forj=1 to M
While there exists at least one retailer such that∑i=0Nyij>1 repeat the following steps
Fori=1 to N
CalculateCi as follow (Ci = Cost of DCi based on the current retailers assigned to it);
Ci=Ki∑jdjyij+Ki′∑jvjyij+∑jwijdjyij+Fixi
Ki=2hi(Oi+Ai),Ki′=hiZαlti,wij=T∑j(tdc-su+disij)
End
FindDCi with minimum Ci and let imin=i
Forj=1 to M
Ifyimin,j=1
For i=1 to N and i≠imin
Ifyij=1
yij=0;
End
End
End
End
End
End
Phase 2 generating a solution that satisfy Q constrain
While at least a DC exists with violatedQ constraint (constraint (11))
Select a DC with violatedQ constraint;
Letjmin = the last assigned retailer to DC (refer to set Gi´ in lower bound calculation);
Removeretailerjmin from the set of retailers allocated to DC;
Allocateretailerjmin to a DC that leads to minimum cost and its Q constraint would not be violated;
End
Calculate current upper bound using the following formula
current upper bound=∑ihi·((Qi/2)+Zαlti∑j(vjyij))+∑i∑j(Oi+Ai)((djyij)/Qi)+∑iFixi
+
∑
i
∑
j
T
(
dis
i
j
+
t
dc-su
)
d
j
y
i
j;Algorithm 3:Lagrangian relaxation heuristic algorithm.
Step size = 2, Best upper bound = 1055, best lower bound = −1055, Iteration number = 1, non-improving
iteration = 0,
While iteration number < max iteration number
Calculate lower bound;
Calculate upper bound;
If current upper bound < Best upper bound
Best upper bound = Current upper bound;
End
If current upper bound < Best lower bound
Best lower bound = −1055;
End
If Current lower bound > Best lower bound and Best lower bound < Best upper bound
Best lower bound = Current lower bound;
End
If number of consecutive non-improving iterations = 30
Halve step size;
End
Update Lagrangian multipliers for all retailers;
If min upper bound and best lower bound solutions are equal, or step size <10-7
Go to Final step;
End
Iteration number = iteration number + 1;
End
Final step: Return solution;
Compute optimality gap((UB-LB)/UB)*100%


### 4.3. Procedure of ComputingQ

To obtain the value of order quantityQi, as mentioned before, at first the derivative of the objective function with respect to Qi is calculated and is solved for Qi, as follows:
(28)Qi=2(Ai+Oi)Dihi∀i∈I.
If Qi violates constraint (11), then Qi will change to the maximum amount that constraint (11) forces it to be, as is written in the following:
(29)Qi=(pti-lti)∑j(djyij)-Zαlti∑j(vjyij).


## 4.1. Lower Bound

As the objective function (8) subject to (9)–(12) is an extension of UFLP, to find a lower bound, the DC retailer assignment constraint (9) is relaxed. The new function is called a Lagrangian dual problem, as is shown by (13) subject to (14)–(16). Lagrangian dual problem provides a lower bound for the main objective function (8) subject to (9)–(12), as follows:
(13)maxγ≥0minx,y∑ihi(Qi2+Zαlti∑jvjyij)maxγ≥0minx,y+∑i∑j(Oi+Ai)djyijQi+∑iFiximaxγ≥0minx,y+∑i∑jT(disij+tdc-su)djyij+∑jπj(1-∑iyij)
s.t. 								(14)xi≥yij∀i∈I,∀j∈J,(15)Qi≤(pti-lti)∑j(djyij)-Zαlti∑j(vjyij)∀i∈I,(16)xi,yij={1,0}∀i∈I,∀j∈J.
To solve the objective function (13) subject to (14)–(16), it is considered at the moment that constraint set (15) is not active. Therefore, the order quantity Qi is calculated by the following formula:
(17)Qi=2(Oi+Ai)∑jdjyijhi.
By substituting Qi in formula (13) the following function is obtained:
(18)maxγ≥0minx,y∑iKi∑jdjyij+∑iKi′∑jvjyijmaxγ≥0minx,y+∑i∑j(wijdj-πj)yij+∑iFixi+∑jπj,
where
(19)Ki=2hi(Oi+Ai),Ki′=hiZαlti,wij=T∑j(tdc-su+disij).
Objective function (18) is then decomposed into subproblems for each DC candidate location, as follows:
(20)Si=minKi∑jdjyij+Ki′∑jvjyij∑jvjyij+∑j(wijdj-πj)yij+Fixi+∑jπj.
The KKT conditions for the problem are
(21)∂Li(y,π)∂yij=∑iKi∑jdjyij+∑iKi′∑jvjyij∂yij+∑i∑j(wijdj-πj)=0∀j∈J,(22)πj≥0,∀j∈J,(23)∑iyij-1=0,∀j∈J.
The first term in (21) is called the marginal inventory cost of retailerj, that is the difference in the inventory cost of DCi between assigning retailerj to DCi or not. Let the symbol mij represent the marginal inventory cost of retailerj. Then according to Si, mij can be written as in the following:
(24)mij=Ki(∑jdjyi,j-∑j-1dj-1yi,j-1)+Ki′(∑jvjyi,j-∑j-1vj-1yi,j-1).
To make this function independent from other retailers assigned to the same DCi, a lower bound of it is selected to work with, as follows:
(25)mij=Kilogdj+Ki′logvj.
So if retailerj is assigned to DCi, the individual benefit of it would be as follows:
(26)IB´ij=Kilogdj+Ki′logvj+wi,jdj-πj.
If IB´ij>0, then retailerj cannot be assigned to DCi, and therefore, yij=0 for all retailer. However, if IB´ij≤0, then retailerj will be assigned to DCi if it leads to a negative value for Si. Therefore, for each DC, initially a list of retailers having the necessary condition ofIB´ij≤0 is made. Then, set Gi is made as follow by arranging retailers in ascending order of theirIB´ij:
(27)Gi={j∈Js.t.IB´ij-1≤IB´ij,IB´j≤0}.
The first retailer from set Gi is assigned to DCi if it leads to a negative value for Si. Each of the following retailers is assigned one by one to DCi if the previous retailer (from set Gi) is assigned to DCi and if its assignment to DCi leads to a better (lower) value for Si. Retailers that are assigned to DCi are removed from set Gi and are added to set Gi´. If there is at least one retailer in Gi´, then xi is set to 1. For all retailers that belong to set Gi´, yij is set to 1.Moreover, the value of the Lagrangian multiplierπj in each iteration of the algorithm is updated using the subgradient optimization technique. The lower-bound calculation steps are presented in  Algorithm 1.Algorithm 1:Lower bound calculation.
p
=
1, π = Initial value for of Lagrangian multiplier, N = number of DCs,
M = number of retailers
Fori=1 to N
For j=1 to M
Calculate IB´ij (IB´ij = individual benefit of retailerj if assigned to DCi)
Make set Gi, so that Gi={j∈Js.t.IB´ij<0}
End
Arrange members of Gi in ascending order of IB´ij
Repeat the following steps for all members of Gi
Compute Si(p) as follow
Si(p) = Cost of DCi if the first p members of set Gi are assigned to DCi
Si(p)=Ki∑jdjyij+Ki′∑jvjyij+∑j(wijdj-πj)yij+Fixi+∑jπj,
Ki=2hi(Oi+Ai),Ki′=hiZαlti,wij=T∑j(tdc-su+disij)
If p=1
IfSi(1)<0
Assign the 1st member ofGi to DCi, (yij=1 and xi=1)
End
End
p=p+1;
If Si(p-1)<0 and Si(p)<0;
Assign thepth member of Gi to DCi, (yij=1)
End
End
End
Calculate current lower bound using the following formula
current lower bound=∑ihi((Qi/2)+Zαlti∑jvjyij)+∑i∑j(Oi+Ai)(djyij/Qi)+∑iFixi
+
∑
i
∑
j
T
(
dis
i
j
+
t
dc-su
)
d
j
y
i
j
+
∑
j
π
j
(
1
-
∑
i
y
i
j
)


## 4.2. Upper Bound

The solution that is found by the lower bound might be infeasible. Therefore, the upper bound modifies it to be a feasible solution for the main objective function. To achieve this, in the developed algorithm of this paper, at first, the lower bound solution is displayed in the form of a 0-1 matrix. The number of rows of this matrix is equal to the number of DCs, and the number of columns is equal to the number of retailers. If the array ofith row and jth column equals 1, it means that retailerj is assigned to DCi. The lower-bound solution described in Section 4.1 may need to be modified in two steps: the first step takes into account the single-sourcing constraint and the next step considers constraint (11) that is also referred to as Q constraint in this text. To do the first step, the retailers that are assigned to no DC are considered, and all the arrays of their corresponding columns are initially set to 1. Then, for each DC (row) the objective function is calculated. The DC that has the minimum objective function is selected and all of its arrays are set to be fixed. Then, if retailers of this DC are also assigned to other DCs, all other similar assignments are removed. This procedure is repeated until all retailers are allocated to only one DC. To do the second step, a DC that its Q constraint is violated is selected. Then its retailers are removed one by one until its Q constraint is satisfied. The first retailer that would be removed is the one that was assigned last to set Gi´in lower-bound calculation. The removed retailer is assigned to another DC that increases the total cost the least, considering feasibility conditions. The upper bound calculation steps and the Lagrangian relaxation algorithm are presented in Algorithms 2 and 3, respectively.Algorithm 2:Upper bound calculation.
Generating feasible solution from the lower bound solution
Phase 1 generating a solution that satisfy single sourcing constrain
i
min
=
0, N = number of DCs, M = number of retailers
Forj=1 to M
If∑i=0Nyij=0 (if a retailer exist that is assigned to no DC, allocate this retailer to all DCs)
yij=1∀i∈I={1,2,…,N};
End
Forj=1 to M
While there exists at least one retailer such that∑i=0Nyij>1 repeat the following steps
Fori=1 to N
CalculateCi as follow (Ci = Cost of DCi based on the current retailers assigned to it);
Ci=Ki∑jdjyij+Ki′∑jvjyij+∑jwijdjyij+Fixi
Ki=2hi(Oi+Ai),Ki′=hiZαlti,wij=T∑j(tdc-su+disij)
End
FindDCi with minimum Ci and let imin=i
Forj=1 to M
Ifyimin,j=1
For i=1 to N and i≠imin
Ifyij=1
yij=0;
End
End
End
End
End
End
Phase 2 generating a solution that satisfy Q constrain
While at least a DC exists with violatedQ constraint (constraint (11))
Select a DC with violatedQ constraint;
Letjmin = the last assigned retailer to DC (refer to set Gi´ in lower bound calculation);
Removeretailerjmin from the set of retailers allocated to DC;
Allocateretailerjmin to a DC that leads to minimum cost and its Q constraint would not be violated;
End
Calculate current upper bound using the following formula
current upper bound=∑ihi·((Qi/2)+Zαlti∑j(vjyij))+∑i∑j(Oi+Ai)((djyij)/Qi)+∑iFixi
+
∑
i
∑
j
T
(
dis
i
j
+
t
dc-su
)
d
j
y
i
j;Algorithm 3:Lagrangian relaxation heuristic algorithm.
Step size = 2, Best upper bound = 1055, best lower bound = −1055, Iteration number = 1, non-improving
iteration = 0,
While iteration number < max iteration number
Calculate lower bound;
Calculate upper bound;
If current upper bound < Best upper bound
Best upper bound = Current upper bound;
End
If current upper bound < Best lower bound
Best lower bound = −1055;
End
If Current lower bound > Best lower bound and Best lower bound < Best upper bound
Best lower bound = Current lower bound;
End
If number of consecutive non-improving iterations = 30
Halve step size;
End
Update Lagrangian multipliers for all retailers;
If min upper bound and best lower bound solutions are equal, or step size <10-7
Go to Final step;
End
Iteration number = iteration number + 1;
End
Final step: Return solution;
Compute optimality gap((UB-LB)/UB)*100%


## 4.3. Procedure of ComputingQ

To obtain the value of order quantityQi, as mentioned before, at first the derivative of the objective function with respect to Qi is calculated and is solved for Qi, as follows:
(28)Qi=2(Ai+Oi)Dihi∀i∈I.
If Qi violates constraint (11), then Qi will change to the maximum amount that constraint (11) forces it to be, as is written in the following:
(29)Qi=(pti-lti)∑j(djyij)-Zαlti∑j(vjyij).


## 5. Computational Results and Discussion

The computational results are divided into three parts. The first part is to validate the model and heuristic algorithm. The second part is to investigate the performance of the algorithm, and the last part provides some examples to demonstrate the main application of the model. For the first and second parts, the model and algorithm are tested on 15-node and 49-node data sets derived from [49]. For the last part, along with 15-node and 49-node data sets, 88-node data set is also considered. Each node in each data set represents a retailer. A number of retailers must be selected to serve as distribution centers. In this study, the means and variances of retailers’ demands are selected to be the same as the demand parameters of [49]. Distances between retailers are calculated using the great circle distance formula, based on the longitude and latitude of retailers’ locations. Fixed installation costs are set to the fixed installation costs, as considered by [49], but multiplied by 10. Variable transportation costs are set to 50 units of cost. Lead time is set to 1 day, and the sum of fixed ordering and transportation costs is set to 100 units of cost. As this paper is motivated by a platelet blood distribution network, inventory holding costs are derived from the work of [50], which studied the inventory control of blood platelets. The parameters of Lagrangian relaxation method are presented in Table 1.Table 1
Parameter of the Lagrangian relaxation.
Maximum number of iterations
1500
Number of nonimproving iterations before halving step size
30
Initial value of step size
2
Minimum value of step size
10
-
7
Initial value of the Lagrangian multiplier
10(d-+f-)
Maximum optimality gap((UB-LB)/UB)*100%
0.1%In Table1, d-,f- are the average demands of the retailers and the average fixed installation costs of the DCs, respectively. The problem is written in C++, and the results are obtained on a T2350, 1.86 GHZ with 1 GB RAM.


### 5.1. Model and Algorithm Validation

The model and heuristic algorithm are validated using sensitivity analysis. The sensitivity analysis is performed on key parameters, including variances of demands, inventory cost, fixed facility installation costs, and lifetimes of commodities. The value of the lifetime varies between 3 and 9 days and the other parameters are varies between 30% and −30% of their actual value.Figures4 and 5 show changes in the objective function in terms of the lifetime for the 15-node and 49-node data sets, respectively. Each point in this curve is the average of 73 (= 343) instances that are made by changing the variances of demand, inventory holding costs, and fixed installation costs at seven levels of ±30%, ±20%, ±10%, and 0%.Figure 4
Sensitivity of objective function to changes in the lifetime for 15-node data set.Figure 5
Sensitivity of objective function to changes in the lifetime for 49-node data set.As is expected, the value of the objective function decreases as the lifetime gets longer. The numbers written above the curves in Figures4 and 5 and also Figures 6–11 display the average optimality gaps. The Optimality gap represents the maximum gap between the optimal solution and the solutions found by the Lagrangian relaxation algorithm. The optimality gap is computed as follows:
(30)Optimalitygap=(Upperbound-lowerbound)Upperbound×100.
Figures 6 and 7 display the variation of the objective function versus changes in inventory holding costs for the 15- and 49-node data sets, respectively. Both curves are ascending, but it is not very clear, especially when they are compared with changes of the objective function versus the lifetime. Figures 8 and 9 also show the variation of the objective function, but against changes in variance of demand. Despite variance changes within a wide range, a very slight increase is observed in the value of the objective function. The most influential parameter on the objective function is the fixed installation cost, as shown by Figures 10 and 11. If these curves had been presented on a graph with the same scale as the previous graphs, only a small part of the curve could be displayed. Therefore, the scales of the vertical axes of these two graphs are different. Figures 10 and 11 show that significant changes occur in the objective function when the fixed costs change.Figure 6
Sensitivity of objective function to changes in inventory cost for 15-node date set.Figure 7
Sensitivity of objective function to changes in inventory cost for 49-node date set.Figure 8
Sensitivity of objective function to changes in variances of demands for 15-node data set.Figure 9
Sensitivity of objective function to changes in variances of demands for 49-node data set.Figure 10
Sensitivity of objective function to changes in fixed installation cost for 15-node data sets.Figure 11
Sensitivity of objective function to changes in fixed installation cost for 49-node data sets.


### 5.2. Performance of the Algorithm

To show the performance of the algorithm in terms of CPU time, number of iterations required to solve each problem, and the optimality gap, the averages of these values are computed and presented in Table2. Each number in Table 2 is the average of corresponding values obtained by running the algorithm for 9604 (=343×7×4) times in Section 5.1, where 4 is the number of input parameters which are selected for sensitivity analysis and 7 is the number of times each parameter has been changed.Table 2
Algorithm performance.
Data set
Average CPU time (second)
Average number of iterations
Average optimality gap
15-node
0.027
11
0
49-node
0.8
98
0.07%Table2 shows that the average optimality gaps are small enough to say that the algorithm finds optimal or near optimal solutions. Moreover, the average CPU time and the average number of iterations that the algorithm needs to find the solution imply that the algorithm is fast.


### 5.3. Application of the Algorithm

The main application of the model of this paper is to provide a trade-off between selecting longer lifetime (increasing inventory cost) and reducing the ordering cycle (shorter lifetime). If the product to be distributed is blood platelets, according to [50], three alternatives for storage conditions exist. These alternatives are shown in Table 3. For instance, alternative 1 represents a storage condition in which the product remains safe for up to four days, and the inventory holding cost is 0.2995 units of cost.Table 3
Lifetime and inventory holding cost of blood platelet driven from [50].
Parameters
Alternative 1
Alternative 2
Alternative 3
Lifetime
4
5
6
Inventory cost
0.2995
0.4947
0.6928The model is solved for the 15-node, 49-node, and 88-node data sets taken from [49], and the results are displayed in Table 4. The last column of the table demonstrates the alternative that is selected in terms of the objective function. For example, for the 15-node data set, alternative 3 is the best despite its highest inventory cost. However, for the 88-node case, the lowest inventory cost alternative is optimal.Table 4
Value of objective function corresponding to different alternatives.
Data set
Alternative 1
Alternative 2
Alternative 3
Best alternative
15-node
1779198
1776691
1775583
3
49-node
14257158
14209680
14226085
2
88-node
52124780
52149816
52215864
1


## 5.1. Model and Algorithm Validation

The model and heuristic algorithm are validated using sensitivity analysis. The sensitivity analysis is performed on key parameters, including variances of demands, inventory cost, fixed facility installation costs, and lifetimes of commodities. The value of the lifetime varies between 3 and 9 days and the other parameters are varies between 30% and −30% of their actual value.Figures4 and 5 show changes in the objective function in terms of the lifetime for the 15-node and 49-node data sets, respectively. Each point in this curve is the average of 73 (= 343) instances that are made by changing the variances of demand, inventory holding costs, and fixed installation costs at seven levels of ±30%, ±20%, ±10%, and 0%.Figure 4
Sensitivity of objective function to changes in the lifetime for 15-node data set.Figure 5
Sensitivity of objective function to changes in the lifetime for 49-node data set.As is expected, the value of the objective function decreases as the lifetime gets longer. The numbers written above the curves in Figures4 and 5 and also Figures 6–11 display the average optimality gaps. The Optimality gap represents the maximum gap between the optimal solution and the solutions found by the Lagrangian relaxation algorithm. The optimality gap is computed as follows:
(30)Optimalitygap=(Upperbound-lowerbound)Upperbound×100.
Figures 6 and 7 display the variation of the objective function versus changes in inventory holding costs for the 15- and 49-node data sets, respectively. Both curves are ascending, but it is not very clear, especially when they are compared with changes of the objective function versus the lifetime. Figures 8 and 9 also show the variation of the objective function, but against changes in variance of demand. Despite variance changes within a wide range, a very slight increase is observed in the value of the objective function. The most influential parameter on the objective function is the fixed installation cost, as shown by Figures 10 and 11. If these curves had been presented on a graph with the same scale as the previous graphs, only a small part of the curve could be displayed. Therefore, the scales of the vertical axes of these two graphs are different. Figures 10 and 11 show that significant changes occur in the objective function when the fixed costs change.Figure 6
Sensitivity of objective function to changes in inventory cost for 15-node date set.Figure 7
Sensitivity of objective function to changes in inventory cost for 49-node date set.Figure 8
Sensitivity of objective function to changes in variances of demands for 15-node data set.Figure 9
Sensitivity of objective function to changes in variances of demands for 49-node data set.Figure 10
Sensitivity of objective function to changes in fixed installation cost for 15-node data sets.Figure 11
Sensitivity of objective function to changes in fixed installation cost for 49-node data sets.


## 5.2. Performance of the Algorithm

To show the performance of the algorithm in terms of CPU time, number of iterations required to solve each problem, and the optimality gap, the averages of these values are computed and presented in Table2. Each number in Table 2 is the average of corresponding values obtained by running the algorithm for 9604 (=343×7×4) times in Section 5.1, where 4 is the number of input parameters which are selected for sensitivity analysis and 7 is the number of times each parameter has been changed.Table 2
Algorithm performance.
Data set
Average CPU time (second)
Average number of iterations
Average optimality gap
15-node
0.027
11
0
49-node
0.8
98
0.07%Table2 shows that the average optimality gaps are small enough to say that the algorithm finds optimal or near optimal solutions. Moreover, the average CPU time and the average number of iterations that the algorithm needs to find the solution imply that the algorithm is fast.


## 5.3. Application of the Algorithm

The main application of the model of this paper is to provide a trade-off between selecting longer lifetime (increasing inventory cost) and reducing the ordering cycle (shorter lifetime). If the product to be distributed is blood platelets, according to [50], three alternatives for storage conditions exist. These alternatives are shown in Table 3. For instance, alternative 1 represents a storage condition in which the product remains safe for up to four days, and the inventory holding cost is 0.2995 units of cost.Table 3
Lifetime and inventory holding cost of blood platelet driven from [50].
Parameters
Alternative 1
Alternative 2
Alternative 3
Lifetime
4
5
6
Inventory cost
0.2995
0.4947
0.6928The model is solved for the 15-node, 49-node, and 88-node data sets taken from [49], and the results are displayed in Table 4. The last column of the table demonstrates the alternative that is selected in terms of the objective function. For example, for the 15-node data set, alternative 3 is the best despite its highest inventory cost. However, for the 88-node case, the lowest inventory cost alternative is optimal.Table 4
Value of objective function corresponding to different alternatives.
Data set
Alternative 1
Alternative 2
Alternative 3
Best alternative
15-node
1779198
1776691
1775583
3
49-node
14257158
14209680
14226085
2
88-node
52124780
52149816
52215864
1


## 6. Conclusion

Perishable products comprise a large proportion of products that are transferred daily from suppliers to the customers. However, studies on the distribution network design of perishable products are rare. This study extended the LMRP by considering the lifetime of the product that is being distributed. The developed model determines the optimal configuration and the inventory control decisions of the network. In addition, the model develops a trade-off between enhancing storage conditions, interpreted as higher inventory costs but longer lifetime, and accepting less inventory costs but having a product with a shorter lifetime. Sensitivity analysis on key parameters is performed to validate the model and solution method. For future research, it is suggested to incorporate into the DND model an inventory control policy of those perishable products whose value declines with time.



---

*Source: 891409-2013-04-29.xml*