# Modeling and Optimization of the Multiobjective  Stochastic Joint Replenishment and Delivery Problem under Supply Chain Environment

Authors: Lin Wang; Hui Qu; Shan Liu; Cai-xia Dun
Journal: The Scientific World Journal
 (2013)

---

## Abstract

As a practical inventory and transportation problem, it is important to synthesize several objectives for the joint replenishment and delivery (JRD) decision. In this paper, a new multiobjective stochastic JRD (MSJRD) of the one-warehouse andn-retailer systems considering the balance of service level and total cost simultaneously is proposed. The goal of this problem is to decide the reasonable replenishment interval, safety stock factor, and traveling routing. Secondly, two approaches are designed to handle this complex multi-objective optimization problem. Linear programming (LP) approach converts the multi-objective to single objective, while a multi-objective evolution algorithm (MOEA) solves a multi-objective problem directly. Thirdly, three intelligent optimization algorithms, differential evolution algorithm (DE), hybrid DE (HDE), and genetic algorithm (GA), are utilized in LP-based and MOEA-based approaches. Results of the MSJRD with LP-based and MOEA-based approaches are compared by a contrastive numerical example. To analyses the nondominated solution of MOEA, a metric is also used to measure the distribution of the last generation solution. Results show that HDE outperforms DE and GA whenever LP or MOEA is adopted.


---

## Body

## 1. Introduction

The joint replenishment problem (JRP) is a practical inventory problem of a group of products that can be jointly ordered from a single supplier (Goyal [1]; Wang et al. [2]), which can help save the ordering costs and inventory holding costs. According to the characteristic of demand, the existing study of JRPs can be divided into two categories: (1) constant demand; (2) stochastic or dynamic demand. An extensive literature review is available in Khouja and Goyal [3] and Narayanan et al. [4]. Many scholars also discussed more realistic JRPs (J.-M. Chen and T.-H. Chen [5]; Axsäter et al. [6]; Hsu [7]; Abdul-Jalbar et al. [8]).Many companies have realized that a joint replenishment and delivery scheduling (JRD) policy can result in considerable cost savings. But the literature on the JRDs under supply chain environment is limited. A stochastic JRD of the one-warehouse,n-retailer system has been formulated (Qu et al. [9]). Wang et al. [10] studied the same JRD but reduced the decision variables using specific mathematical method and provided a new differential evolution algorithm. Sindhuchao et al. [11] studied the coordinated inventory and transportation decisions with the vehicle capacity limitation in an inbound commodity collection system. Chan et al. [12] addressed issues in scheduling of the multi-item, multibuyer, and single supplier system. Cha et al. [13] handled the JRD of the one-warehouse and n-retailer system in which the warehouse supplies items from the supplier and delivers them to retailers. Moon et al. [14] modified the model of [13] by utilizing a consolidated freight delivery policies. Wang et al. [2] extended the JRD model of Cha et al. [13] under fuzzy environment and used the widely used signed distance method to ranking fuzzy numbers. Wang et al. [15] studied the JRD with deterministic demand and fuzzy cost using the graded mean integration representation and centroid approaches to defuzzify the total costs. A common limitation in all the literature studies mentioned above is that they only consider a single objective.However, managers are usually faced with complex multiobjective optimization problems (MOPs) in reality. For the JRD policy, it is necessary to decrease the total cost while improving the service level. Although there are several papers that studied multiobjective inventory models (Roy and Maiti [16]; Rong et al. [17]; Islam [18]; Wee et al. [19]), no study on the multiobjective JRD can be found.For MOPs, direct comparison among the solutions is very difficult because of the different measurements between each contradicted target. In this study, total cost and service level are obviously two contradictory targets: reducing total cost may result in the decline of service level and vice verse. So we should coordinate two targets. Different from a single-objective optimization problem which has unique optimal solution, an MOP has a set of optimal solutions called Pareto optimal solutions. Due to the characteristics of MOPs, they are much more complex and the key is to find an effective method to obtain Pareto optimal solutions. Unfortunately, the classical JRPs and JRDs are already NP hard problems (Arkin et al. [20]), and the multiobjective makes the JRDs become much more difficult to handle.Many linear or nonlinear weighted methods (Rong et al. [17]; Islam [18]; Wee et al. [19]; Roy and Maiti [16]) were used to convert the multiobjective to a single one in the existing studies. These methods undoubtedly provide one easy way to deal with the multiobjective JRD model. However, these approaches do not solve the MOPs intrinsically, since the solutions for MOPs are multiple rather than one. On the other hand, multiobjective optimization methods based on Pareto-based MOEAs are widely used, such as multiobjective genetic algorithm (MOGA) (Aiello et al. [21]), nondominated sorting genetic algorithm (NSGA) (Lin [22]), and strength Pareto evolutionary algorithm (SPEA) (Zitzler and Thiele [23]; Sheng et al. [24]).In recent years, several MOEAs based on Pareto differential evolution (DE) were utilized to solve MOPs. Santana-Quintero and Coello [25] presented a DE-based multiobjective algorithm using a secondary population and the concept of ϵ-dominance. The performance of the proposed algorithm was also compared with NSGA-II and ϵ-MOEA. Qian et al. [26] proposed a memetic algorithm based on DE (MODEMA) for multiobjective job shop scheduling problems. Qian and li [27] proposed an adaptive DE (ADEA) and the results of five test functions showed that the ADEA was very efficient to find out the true Pareto front. However, the majority of the above studies focused on the effectiveness verification of the algorithms and always analyzed standard testing functions and ignored the practical applications of them in MOPs. Due to the existing unpredictable and uncertain factors of inventory management, it is difficult to convert shortage rate/quantity to shortage cost. Therefore, discussing shortage rate/quantity independently is meaningful.The aim of this study is to propose a new multiobjective stochastic JRD (MSJRD) model including two minimum objectives, that is, the total cost and shortage quantity. The main difference between this study and [10] is that two objectives are handled simultaneously. Moreover, effective approaches are provided to handle this MSJRD. Having the successful applications in engineering management, as well as the effectiveness of DE in solving MOPs and JRPs/JRDs (Wang et al. [28–30]), linear programming (LP) and MOEA-based approaches using DE are provided. Results of an example show that the proposed hybrid DE is more effective than the original DE and GA whatever LP or MOEA method is used.The rest of this paper is organized as follows. Section2 describes the proposed multiobjective stochastic JRD model. Section 3 introduces the hybrid DE. Section 4 presents two approaches to solve the MSJRD. Section 5 contains numerical examples and results. Section 6 discusses conclusions and provides future research directions.


## 2. Formulation of the Proposed MSJRD Model

Consider an enterprise has a center warehouse in a proper place and several suppliers in decentralized locations. The center warehouse jointly replenishes items from its suppliers according to the market demand or historical data. Then, the center warehouse will collect replenished items from suppliers. In this situation, the center warehouse can jointly determine the replenishment and distribution policy to obtain the optimal decision.Refering to the model of Qu et al. [9], the differences between the JRD policy and typical JRP can be concluded as follows: (a) the JRP supposes deterministic demand, while our model considers stochastic demand and allows for shortage; (b) the JRP just discusses the replenishment policy, while our model analyses not only replenishment but also transportation decision; (c) the JRP is a single objective model, while our model is a multiobjective model.For the MSJRD, reducing the related total cost as well as decreasing shortage quantity should be considered simultaneously. Therefore, the first target is to minimize total cost which consists of replenishment cost, inventory holding cost, and distribution cost. Minimizing the shortage quantity is the second target.


### 2.1. The First Target: Total Cost

The total cost includes inventory holding cost, replenishment cost, and distribution cost. Distribution cost involves the stopover cost at suppliers and cost related to distance. The infinite capacity of vehicle assumption makes the distribution problem a traveling salesman problem (TSP).Inventory cost can be given as(1)CH=∑i=1nhi[12DikiT+ziσi(L+kiT)].In (1), the first term is deterministic inventory and the second one is safety stock. The following replenishment cost is the same as the classical JRP:(2)CS=ST+∑i=1nsikiT=1T(S+∑i=1nsiki).Whenki are given, taking the least common multiple of ki we can get integer M. It means that the replenishment and distribution behavior will be repeated every M period. For example, if ki=(4,2,1,1), then M=4. That is to say, in period 1, all items should be replenished; in period 2, items 3 and 4 need to be replenished; in period 3, items 2, 3, and 4 should be replenished; in period 4, items 3 and 4 should be replenished. It is obvious that in period 5 the situation is the same as in period 1. The cycle period is M. Therefore, a limited horizon with M periods is used to calculate annual distribution cost.Jointly replenishment of items can take the advantage of scale economies not only in the replenishment but also in distribution process. Four items specifically should be replenished in period 1 and it is advisable for the center warehouse to traverse suppliers that supply these items at one time. The shortest path in each period is considered so distribution cost can be obtained by solving a travelling salesman problem (TSP). The distribution cost is(3)CT=∑j=1M(∑p=1PxpjFp+cd(j))MT,
where xpj={1,ifsupplierpisvisited0,otherwise.Therefore, the first target can be summarized as follows:(4)F1(T,ki,zi)=CH+CS+CT=∑i=1nhi[12DikiT+ziσi(L+kiT)]+1T(S+∑i=1nsiki)+∑j=1M(∑p=1PxpjFp+cd(j))MT.


### 2.2. The Second Target: Stock-Out Quantity

In this study, the demand is assumed to follow normal distribution at interval of unit time, which is widely used in the literature (see Qu et al. [9]; Eynan and Kropp [31, 32]). This assumption means, that given ki and T for item i, the demand will follow normal distribution over the interval of length L+kiT with the expectation E=Di(L+kiT), variance Var=σi2(L+kiT) and probability density function f(xi,L+kiT).With a periodic replenishment policy, stockout could occur any time during replenishment intervals as long as the real demand exceeds maximum inventory levelRi. The total annual stock-out quantity is
(5)F2(T,ki,zi)=∑i=1n(∫Ri∞(xi-Ri)f(xi,L+kiT)dxi)kiT=∑i=1nσikiTkiT+L∫zi∞(y-zi)f(y)dy=∑i=1nσikiTkiT+L×(∫zi∞yf(y)dy-zi∫zi∞f(y)dy)=∑i=1nσikiTkiT+L(f(zi)-zi[1-F(zi)]),
where Ri=Di(kiT+L)+ziσi(kiT+L).


### 2.3. The MSJRD Model

The whole multiobjective model can be written as(6)MinF1(T,ki,zi)=∑i=1nhi[12DikiT+ziσi(L+kiT)]MinF1(T,ki,zi)=+1T(S+g(ki)+∑i=1nsiki),MinF2(T,ki,zi)=∑i=1nσikiTkiT+LMinF2(T,ki,zi)=×(f(zi)-zi[1-F(zi)]),
where g(ki)=∑j=1M(∑p=1PxpjFp+cd(j))/M.The goal of this multiobjective model is to find out the optimalki, zi, and T to simultaneously minimize the total cost and stock-out quantity and thus to achieve Pareto solutions in which two objectives can be balanced. Two targets have different units of measurements and it is usually difficult to convert the shortage quantity to stock-out cost. In addition, they are often in conflict with each other, that is, decreasing shortage quantity may result in cost increasing.MOPs are much more complex but closer to reality. Several traditional mathematic methods are used for solving multiobjective models, such as linear programming, goal programming, and analytic hierarchy process. However, they are successful only in small scale problems. Mathematic methods are too complex and too time consuming to solve large scale problems. In the following, we provide two common approaches based on an HDE to deal with the proposed MSJRD. Then a numerical example and comparative study between the proposed LP and MOEA are presented.


## 2.1. The First Target: Total Cost

The total cost includes inventory holding cost, replenishment cost, and distribution cost. Distribution cost involves the stopover cost at suppliers and cost related to distance. The infinite capacity of vehicle assumption makes the distribution problem a traveling salesman problem (TSP).Inventory cost can be given as(1)CH=∑i=1nhi[12DikiT+ziσi(L+kiT)].In (1), the first term is deterministic inventory and the second one is safety stock. The following replenishment cost is the same as the classical JRP:(2)CS=ST+∑i=1nsikiT=1T(S+∑i=1nsiki).Whenki are given, taking the least common multiple of ki we can get integer M. It means that the replenishment and distribution behavior will be repeated every M period. For example, if ki=(4,2,1,1), then M=4. That is to say, in period 1, all items should be replenished; in period 2, items 3 and 4 need to be replenished; in period 3, items 2, 3, and 4 should be replenished; in period 4, items 3 and 4 should be replenished. It is obvious that in period 5 the situation is the same as in period 1. The cycle period is M. Therefore, a limited horizon with M periods is used to calculate annual distribution cost.Jointly replenishment of items can take the advantage of scale economies not only in the replenishment but also in distribution process. Four items specifically should be replenished in period 1 and it is advisable for the center warehouse to traverse suppliers that supply these items at one time. The shortest path in each period is considered so distribution cost can be obtained by solving a travelling salesman problem (TSP). The distribution cost is(3)CT=∑j=1M(∑p=1PxpjFp+cd(j))MT,
where xpj={1,ifsupplierpisvisited0,otherwise.Therefore, the first target can be summarized as follows:(4)F1(T,ki,zi)=CH+CS+CT=∑i=1nhi[12DikiT+ziσi(L+kiT)]+1T(S+∑i=1nsiki)+∑j=1M(∑p=1PxpjFp+cd(j))MT.


## 2.2. The Second Target: Stock-Out Quantity

In this study, the demand is assumed to follow normal distribution at interval of unit time, which is widely used in the literature (see Qu et al. [9]; Eynan and Kropp [31, 32]). This assumption means, that given ki and T for item i, the demand will follow normal distribution over the interval of length L+kiT with the expectation E=Di(L+kiT), variance Var=σi2(L+kiT) and probability density function f(xi,L+kiT).With a periodic replenishment policy, stockout could occur any time during replenishment intervals as long as the real demand exceeds maximum inventory levelRi. The total annual stock-out quantity is
(5)F2(T,ki,zi)=∑i=1n(∫Ri∞(xi-Ri)f(xi,L+kiT)dxi)kiT=∑i=1nσikiTkiT+L∫zi∞(y-zi)f(y)dy=∑i=1nσikiTkiT+L×(∫zi∞yf(y)dy-zi∫zi∞f(y)dy)=∑i=1nσikiTkiT+L(f(zi)-zi[1-F(zi)]),
where Ri=Di(kiT+L)+ziσi(kiT+L).


## 2.3. The MSJRD Model

The whole multiobjective model can be written as(6)MinF1(T,ki,zi)=∑i=1nhi[12DikiT+ziσi(L+kiT)]MinF1(T,ki,zi)=+1T(S+g(ki)+∑i=1nsiki),MinF2(T,ki,zi)=∑i=1nσikiTkiT+LMinF2(T,ki,zi)=×(f(zi)-zi[1-F(zi)]),
where g(ki)=∑j=1M(∑p=1PxpjFp+cd(j))/M.The goal of this multiobjective model is to find out the optimalki, zi, and T to simultaneously minimize the total cost and stock-out quantity and thus to achieve Pareto solutions in which two objectives can be balanced. Two targets have different units of measurements and it is usually difficult to convert the shortage quantity to stock-out cost. In addition, they are often in conflict with each other, that is, decreasing shortage quantity may result in cost increasing.MOPs are much more complex but closer to reality. Several traditional mathematic methods are used for solving multiobjective models, such as linear programming, goal programming, and analytic hierarchy process. However, they are successful only in small scale problems. Mathematic methods are too complex and too time consuming to solve large scale problems. In the following, we provide two common approaches based on an HDE to deal with the proposed MSJRD. Then a numerical example and comparative study between the proposed LP and MOEA are presented.


## 3. The Hybrid Differential Evolution Algorithm (HDE)

### 3.1. The Classical DE

DE has been described as an effective and robust method to optimize some well-known nonlinear, nondifferentiable, and nonconvex functions. Due to its easy implementation, quick convergence, and robustness, DE has turned to be one of the best evolutionary algorithms in a variety of fields (Wang et al. [33]; Cui et al. [34]). DE contains three operations: mutation, crossover, and selection.


#### 3.1.1. Mutation

The mutation operation creates a new vector by adding the weighted difference of two random vectors to a third one. For each target vectorxtG(t=1,2…NP), the mutated vector is created as follows:
(7)vtG+1=xr1G+F×(xr2G-xr3G).In (7), r1, r2, and r3, are three serial numbers of vectors, which are randomly generated with different values and none of them equals t. Three vectors xr1G, xr2G, and xr3G will be selected from the population for mutation operation when r1, r2, and r3 are confirmed, F is a scaling factor and G is the current number of iteration.


#### 3.1.2. Crossover

A trail vector is created by mixing the mutated vector with the target vector according to the following formula:(8)utjG+1={vtjG+1,ifrandm(j)≤CRorj=randn(t)xtjG,otherwise,
where j represents the jth dimension; randm(j) is randomly generated from 0 to 1; randn(t)∈[1,2,…,D] is a randomly selected integer to ensure the effect of mutated vector; CR is the crossover probability and it is very important for DE since the larger CR is, the more vtG+1contributes to utG+1.


#### 3.1.3. Selection

The selection operation is implemented by comparing the trial vector (obtained through mutation and crossover operations) with the corresponding target vector. For example, to minimize the function, the next generation is formed by(9)xtG+1={utG+1,iff(utG+1)<f(xtG),xtG,otherwise,
where the f(·) is the fitness function of DE.Here, an example is given to illustrate the three operations mentioned previously. For the current number of iterationG and target vector x1G, suppose that random generated numbers r1, r2, and  r3 are 23, 40, and NP respectively, and we obtain the following:(10)TargetvectorsxG:Vectorx1:65240.090⋯Vectorx23:54210.578⋯Vectorx40:51360.745⋯VectorxNP:42570.024.Mutation: ifF=0.6, the mutated vector v1G+1 can be obtained by (7) as follows:
(11)MutatedvectorsvG+1:Vectorv1:5.63.40.80.41.010⋯Crossover: ifCR=0.3, randn(t)=3 (here t=1), and vector randm=(0.1,0.4,0.5,0.2,0.6), the trial vector can be obtained by (8) as follows:
(12)TrialvectorsuG+1:Vectoru1:5.650.80.40.090⋯Selection: then targetx1 should be compared with u1. Since f(u1G+1)<f(x1G), vector u1 should be selected to the next generation as follows:
(13)NextgenerationxG+1:Vector1:5.650.80.40.090⋯


### 3.2. The Proposed Hybrid DE (HDE)

The typical DE is simple and easy to be implemented. However, it is likely to be premature too early. One-to-one competing is one of the main reasons. Therefore, improvements including dynamic parameter adjusting, different mutation and crossover strategies, or hybrid algorithms are necessary to be adopted.Similar to DE, a genetic algorithm (GA) contains crossover, mutation, and selection operations. The crossover operation of GA is quite complicated and its complexity may grow rapidly when the problem scale becomes larger. Fortunately, GA has several efficient selection operations such as roulette wheel selection, tournament selection, and truncation selection. In this study, an HDE that combines the advantages of DE and GA is proposed. The proposed HDE can simplify the evolutionary process, and it can overcome the limitation of one-to-one selection of DE and thus prevent premature convergence.Actually, several scholars also proposed hybrid DEs based on DE and GA (Hrstka and Kučerová [35]; He et al. [36]; Lin [37]), but their mixing modes are quite different from ours. In the proposed HDE, the mutation and crossover operations are the same as in DE while the selection operation is from truncation selection of GA. That is to say, it will be reserved instead of comparing with the target vector when a trial vector is generated. When all trail and target vectors are determined, top NP  vectors with better performance are selected to the next generation. The HDE-based procedure is shown in Figure 1.Figure 1
Flow chart of HDE.


## 3.1. The Classical DE

DE has been described as an effective and robust method to optimize some well-known nonlinear, nondifferentiable, and nonconvex functions. Due to its easy implementation, quick convergence, and robustness, DE has turned to be one of the best evolutionary algorithms in a variety of fields (Wang et al. [33]; Cui et al. [34]). DE contains three operations: mutation, crossover, and selection.


### 3.1.1. Mutation

The mutation operation creates a new vector by adding the weighted difference of two random vectors to a third one. For each target vectorxtG(t=1,2…NP), the mutated vector is created as follows:
(7)vtG+1=xr1G+F×(xr2G-xr3G).In (7), r1, r2, and r3, are three serial numbers of vectors, which are randomly generated with different values and none of them equals t. Three vectors xr1G, xr2G, and xr3G will be selected from the population for mutation operation when r1, r2, and r3 are confirmed, F is a scaling factor and G is the current number of iteration.


### 3.1.2. Crossover

A trail vector is created by mixing the mutated vector with the target vector according to the following formula:(8)utjG+1={vtjG+1,ifrandm(j)≤CRorj=randn(t)xtjG,otherwise,
where j represents the jth dimension; randm(j) is randomly generated from 0 to 1; randn(t)∈[1,2,…,D] is a randomly selected integer to ensure the effect of mutated vector; CR is the crossover probability and it is very important for DE since the larger CR is, the more vtG+1contributes to utG+1.


### 3.1.3. Selection

The selection operation is implemented by comparing the trial vector (obtained through mutation and crossover operations) with the corresponding target vector. For example, to minimize the function, the next generation is formed by(9)xtG+1={utG+1,iff(utG+1)<f(xtG),xtG,otherwise,
where the f(·) is the fitness function of DE.Here, an example is given to illustrate the three operations mentioned previously. For the current number of iterationG and target vector x1G, suppose that random generated numbers r1, r2, and  r3 are 23, 40, and NP respectively, and we obtain the following:(10)TargetvectorsxG:Vectorx1:65240.090⋯Vectorx23:54210.578⋯Vectorx40:51360.745⋯VectorxNP:42570.024.Mutation: ifF=0.6, the mutated vector v1G+1 can be obtained by (7) as follows:
(11)MutatedvectorsvG+1:Vectorv1:5.63.40.80.41.010⋯Crossover: ifCR=0.3, randn(t)=3 (here t=1), and vector randm=(0.1,0.4,0.5,0.2,0.6), the trial vector can be obtained by (8) as follows:
(12)TrialvectorsuG+1:Vectoru1:5.650.80.40.090⋯Selection: then targetx1 should be compared with u1. Since f(u1G+1)<f(x1G), vector u1 should be selected to the next generation as follows:
(13)NextgenerationxG+1:Vector1:5.650.80.40.090⋯


## 3.1.1. Mutation

The mutation operation creates a new vector by adding the weighted difference of two random vectors to a third one. For each target vectorxtG(t=1,2…NP), the mutated vector is created as follows:
(7)vtG+1=xr1G+F×(xr2G-xr3G).In (7), r1, r2, and r3, are three serial numbers of vectors, which are randomly generated with different values and none of them equals t. Three vectors xr1G, xr2G, and xr3G will be selected from the population for mutation operation when r1, r2, and r3 are confirmed, F is a scaling factor and G is the current number of iteration.


## 3.1.2. Crossover

A trail vector is created by mixing the mutated vector with the target vector according to the following formula:(8)utjG+1={vtjG+1,ifrandm(j)≤CRorj=randn(t)xtjG,otherwise,
where j represents the jth dimension; randm(j) is randomly generated from 0 to 1; randn(t)∈[1,2,…,D] is a randomly selected integer to ensure the effect of mutated vector; CR is the crossover probability and it is very important for DE since the larger CR is, the more vtG+1contributes to utG+1.


## 3.1.3. Selection

The selection operation is implemented by comparing the trial vector (obtained through mutation and crossover operations) with the corresponding target vector. For example, to minimize the function, the next generation is formed by(9)xtG+1={utG+1,iff(utG+1)<f(xtG),xtG,otherwise,
where the f(·) is the fitness function of DE.Here, an example is given to illustrate the three operations mentioned previously. For the current number of iterationG and target vector x1G, suppose that random generated numbers r1, r2, and  r3 are 23, 40, and NP respectively, and we obtain the following:(10)TargetvectorsxG:Vectorx1:65240.090⋯Vectorx23:54210.578⋯Vectorx40:51360.745⋯VectorxNP:42570.024.Mutation: ifF=0.6, the mutated vector v1G+1 can be obtained by (7) as follows:
(11)MutatedvectorsvG+1:Vectorv1:5.63.40.80.41.010⋯Crossover: ifCR=0.3, randn(t)=3 (here t=1), and vector randm=(0.1,0.4,0.5,0.2,0.6), the trial vector can be obtained by (8) as follows:
(12)TrialvectorsuG+1:Vectoru1:5.650.80.40.090⋯Selection: then targetx1 should be compared with u1. Since f(u1G+1)<f(x1G), vector u1 should be selected to the next generation as follows:
(13)NextgenerationxG+1:Vector1:5.650.80.40.090⋯


## 3.2. The Proposed Hybrid DE (HDE)

The typical DE is simple and easy to be implemented. However, it is likely to be premature too early. One-to-one competing is one of the main reasons. Therefore, improvements including dynamic parameter adjusting, different mutation and crossover strategies, or hybrid algorithms are necessary to be adopted.Similar to DE, a genetic algorithm (GA) contains crossover, mutation, and selection operations. The crossover operation of GA is quite complicated and its complexity may grow rapidly when the problem scale becomes larger. Fortunately, GA has several efficient selection operations such as roulette wheel selection, tournament selection, and truncation selection. In this study, an HDE that combines the advantages of DE and GA is proposed. The proposed HDE can simplify the evolutionary process, and it can overcome the limitation of one-to-one selection of DE and thus prevent premature convergence.Actually, several scholars also proposed hybrid DEs based on DE and GA (Hrstka and Kučerová [35]; He et al. [36]; Lin [37]), but their mixing modes are quite different from ours. In the proposed HDE, the mutation and crossover operations are the same as in DE while the selection operation is from truncation selection of GA. That is to say, it will be reserved instead of comparing with the target vector when a trial vector is generated. When all trail and target vectors are determined, top NP  vectors with better performance are selected to the next generation. The HDE-based procedure is shown in Figure 1.Figure 1
Flow chart of HDE.


## 4. Two Methods for Solving MSJRD

### 4.1. Linear Programming (LP) Approach for the MSJRD

This method is to summarize the weighted targets and thus converts the multiobjective model to a single one. Take into consideration that two targets have different measurements; it is necessary to standardize two targets beforehand.


#### 4.1.1. Model Analysis Using Linear Programming Approach

Suppose that the weights of two objectives arew1 and w2, and then the multiobjective problem can be described as
(14)Maxλ=w1u1+w2u2s.t.{u1=F1max(T,ki,zi)-F1(T,ki,zi)F1max(T,ki,zi)-F1min(T,ki,zi)u2=F2max(T,ki,zi)-F2(T,ki,zi)F2max(T,ki,zi)-F2min(T,ki,zi).w1+w2=1,F
1
max
(
T
,
k
i
,
z
i
),  F1min(T,ki,zi),  F2max(T,ki,zi), and F2min(T,ki,zi) are the tolerant maximum total cost, minimum total cost, maximum stock-out quantity, and minimum stock-out quantity, respectively, which can be given in advance by decision makers (Wee et al. [18]).Setw1′=w1/(F1max-F1min), w2′=w2/(F2max-F2min). Then, the objective function is changed to
(15)Maxλ=Fc-(w1′F1+w2′F2),
where Fc=w1F1max/(F1max-F1min)+w2F2max/(F2max-F2min) and
(16)Fw=w1′F1+w2′F2=w1′(∑i=1nhi[12DikiT+ziσi(L+kiT)]=w1′cc+1T[S+g(ki)+∑i=1nsiki])+w2′(∑i=1nσikiTkiT+L(f(zi)-zi[1-F(zi)])).Let∂Fw/∂zi=0, that is, w1′hiσikiT+L+w2′(σi/kiT)kiT+L((df(zi)/dzi)-[1-F(zi)]+zif(zi))=0.Note that for standard normal distribution,df(zi)/dzi=-zif(zi), so that
(17)1-F[zi(kiT)]=w1′hiw2′kiT.That is to say, whenki and T is known, the optimal value of zi must satisfy (17).Taking the second derivation ofTC(T,ki,zi) with respect to zi, we obtain ∂2TC(T,ki,zi)/∂zi2=(w2′σi/kiT)kiT+Lf(zi)>0, which means that the optimal zi is derived from (17) and zi*(kiT)=F-1(1-(w1′hi/w2′)kiT).Substitutingzi*(kiT) into (16), the optimal value of Fw for given ki and T is
(18)Fw=w1′(∑i=1nDihiki2T+1T[S+g(ki)+∑i=1nsiki])+w2′(∑i=1nσikiTkiT+Lf(zi*)).Finally, the linear programming model can be written as(19)Maxλ(T,ki)Max2003=Fc-w1′(∑i=1nDihiki2T+1T[S+g(ki)+∑i=1nsiki])-w2′(∑i=1nσikiTkiT+Lf(zi*))s.t.{Fc=w1F1maxF1max-F1min+w2F2maxF2max-F2min,w1′=w1F1max-F1min,w2′=w2F2max-F2min,w1+w2=1zi*(kiT)=F-1(1-w1′hiw2′kiT).The goal is to determine the bestki and T to maximize λ for the given w1 and w1.


#### 4.1.2. HDE-Based Procedures for MSJRD Using LP Approach

Whenki are determined, the optimal delivery cost can be calculated by solving a TSP. zi*(kiT) can be calculated by zi*(kiT)=F-1(1-(w1′hi/w2′)kiT) when ki and T are known. Change ki and T with the following steps until maximum λ is obtained.Step 1.
Initialization: set related parameters (CR, F, and NP) for HDE. Set the lower bound (kiLB) and the upper bound (kiUB) of ki respectively. Note that ki are integers so,   kiLB  is obviously 1. According to experience of [2, 10, 15], kiUB  is set sufficiently large to guarantee that the optimal solution does not escape. In this study, it can be set to 100.  T is randomly generated in the range of 0 and 1. Combining ki and T we get the tth individual xt=(ki,T). Create initial population randomly.Step 2.
For a givenw1, calculate the objective function. When xt is determined, zi*(kiT) can be derived accordingly. xt  and zi*(kiT) jointly determine λ.Step 3.
Differential operations: while stopping criterion is not met, implement mutation and crossover for each individual. After that, the number of population is two times the original one.Step 4.
Genetic operations: select the individuals according toλ. Those with larger λ will be chosen to the next generation. Then the number of population is the same as the original one.Step 5.
When the number of iteration reaches a predefined maximum number, output the optimal results; otherwise, repeat Steps2–4.


### 4.2. Multiobjective Evolution Algorithm (MOEA) Approach for the MSJRD

In this section, a brief introduction of MOP is given. Then, an HDE-based procedure to handle the MSJRD using noninferior and crowding distance is designed.


#### 4.2.1. Some Definitions of MOP

Definition 1 (multiobjective optimization problems (MOP)).
(20)
Min
F
(
x
)
=
f
1
(
x
)
,
f
2
(
x
)
,
…
,
f
k
(
x
)
Subject
to

:
g
i
(
x
)
≤
0
,
i
=
1,2
,
…
,
m
.
A general MOP consists ofn decision variables, k objective functions, and m constrains. In Definition 1, x refers to the decision space and gi(x) are constrains of MOP.Definition 2 (Pareto optimal solution).
The  optimal solution of MOP is often referred to as the Pareto optimal solution. Let vectora belong to x and suppose that x* is a subset of x. If there does not exist any vector in x* that is better than a, then a is called noninferior solution (or Pareto optimal solution) of x*. Moreover, if vector a is the noninferior solution of x, then vector a is the Pareto optimal of the MOP.


#### 4.2.2. HDE-Based Procedures for MSJRD Using MOEA Approach

There exist many difficulties when applying DE to solve an MOP compared with single objective problem. The main challenges for solving MOP are as follows: how to generate offspring and how to keep Pareto solutions uniformly distributed. The classical DE is not suitable for an MOP since many good solutions may be abandoned due to its one-to-one competing mechanism. This will also be confirmed by a numerical example.Therefore, we also use an HDE which uses truncation selection to choose next generation based on front rank and crowding distance adopted by Qian and li [27]. The steps of calculating crowding distance are presented in Algorithm 1.Algorithm 1:Steps of calculating crowding distance.
Step
1. For each xi∈I, initialize distance D(i)=0
Step
2. Calculate the crowding distance of xi
Step2.1. Sorting I for each objective m,I=sort(I,m)
D(I(1))=D(I(1))+[2(I(2)·m-I(1)·m)]2
D(II)=D(II)+[2(II·m-II-1·m)]2
Fori=2,…,|I|-1
D(I(i))=D(I(i))+[(I(i+1)·m-I(i-1)·m)]2
Step2.2. D(i)=sqrt(D(i))
where|I| is the number of individuals contained in I; I(i)·m is the objective value of individual i.In this algorithm, the low front rank corresponds to the high quality of a solution. As to the those individuals with the same front rank, the larger crowding distance means better distribution. Therefore, individuals with lower front rank and larger crowding distance are selected to the next generation.The first target can be divided into an inventory problem and a delivery problem. When allki are determined, the optimal delivery cost can be calculated by solving a TSP. In addition, for a stochastic JRP with normal distributed demand, when ki, zi, and T are known, the stochastic JRP can then be solved. With the same value of ki, zi, and T in the second target, we can obtain the corresponding value of the second target. Then change ki, zi, and T with the following steps until the termination condition is satisfied. The steps of HDE-based approach are described as follows.Step 1.
Initialization: set related parameters (CR, F, and NP) for the HDE. Set the lower bound and the upper bound ofki, respectively; that is, kiLB=1 and kijUB=100. zi is randomly generated in the range of 0 and 3, which can cover 99.7% of the demand. T is randomly generated in the range of 0 and 1. Combining ki, zi, and T we get the tth individual xt=(ki,zi,T). Create initial population randomly.Step 2.
Calculate the objective function, that is, the total cost and the total shortage quantity of all items.Step 3.
Calculate the Pareto front and crowding distance of each individual.Step 4.
Differential operations: while stopping criterion is not met, implement mutation and crossover for each individual. After that, the number of population is two times the original one.Step 5.
Genetic operations: select the individuals according to the front rank and crowding distance. Then the number of population is the same as the original one.Step 6.
When the number of iteration reaches a predefined maximum number, output the optimal results; otherwise, repeat Steps2–5.


## 4.1. Linear Programming (LP) Approach for the MSJRD

This method is to summarize the weighted targets and thus converts the multiobjective model to a single one. Take into consideration that two targets have different measurements; it is necessary to standardize two targets beforehand.


### 4.1.1. Model Analysis Using Linear Programming Approach

Suppose that the weights of two objectives arew1 and w2, and then the multiobjective problem can be described as
(14)Maxλ=w1u1+w2u2s.t.{u1=F1max(T,ki,zi)-F1(T,ki,zi)F1max(T,ki,zi)-F1min(T,ki,zi)u2=F2max(T,ki,zi)-F2(T,ki,zi)F2max(T,ki,zi)-F2min(T,ki,zi).w1+w2=1,F
1
max
(
T
,
k
i
,
z
i
),  F1min(T,ki,zi),  F2max(T,ki,zi), and F2min(T,ki,zi) are the tolerant maximum total cost, minimum total cost, maximum stock-out quantity, and minimum stock-out quantity, respectively, which can be given in advance by decision makers (Wee et al. [18]).Setw1′=w1/(F1max-F1min), w2′=w2/(F2max-F2min). Then, the objective function is changed to
(15)Maxλ=Fc-(w1′F1+w2′F2),
where Fc=w1F1max/(F1max-F1min)+w2F2max/(F2max-F2min) and
(16)Fw=w1′F1+w2′F2=w1′(∑i=1nhi[12DikiT+ziσi(L+kiT)]=w1′cc+1T[S+g(ki)+∑i=1nsiki])+w2′(∑i=1nσikiTkiT+L(f(zi)-zi[1-F(zi)])).Let∂Fw/∂zi=0, that is, w1′hiσikiT+L+w2′(σi/kiT)kiT+L((df(zi)/dzi)-[1-F(zi)]+zif(zi))=0.Note that for standard normal distribution,df(zi)/dzi=-zif(zi), so that
(17)1-F[zi(kiT)]=w1′hiw2′kiT.That is to say, whenki and T is known, the optimal value of zi must satisfy (17).Taking the second derivation ofTC(T,ki,zi) with respect to zi, we obtain ∂2TC(T,ki,zi)/∂zi2=(w2′σi/kiT)kiT+Lf(zi)>0, which means that the optimal zi is derived from (17) and zi*(kiT)=F-1(1-(w1′hi/w2′)kiT).Substitutingzi*(kiT) into (16), the optimal value of Fw for given ki and T is
(18)Fw=w1′(∑i=1nDihiki2T+1T[S+g(ki)+∑i=1nsiki])+w2′(∑i=1nσikiTkiT+Lf(zi*)).Finally, the linear programming model can be written as(19)Maxλ(T,ki)Max2003=Fc-w1′(∑i=1nDihiki2T+1T[S+g(ki)+∑i=1nsiki])-w2′(∑i=1nσikiTkiT+Lf(zi*))s.t.{Fc=w1F1maxF1max-F1min+w2F2maxF2max-F2min,w1′=w1F1max-F1min,w2′=w2F2max-F2min,w1+w2=1zi*(kiT)=F-1(1-w1′hiw2′kiT).The goal is to determine the bestki and T to maximize λ for the given w1 and w1.


### 4.1.2. HDE-Based Procedures for MSJRD Using LP Approach

Whenki are determined, the optimal delivery cost can be calculated by solving a TSP. zi*(kiT) can be calculated by zi*(kiT)=F-1(1-(w1′hi/w2′)kiT) when ki and T are known. Change ki and T with the following steps until maximum λ is obtained.Step 1.
Initialization: set related parameters (CR, F, and NP) for HDE. Set the lower bound (kiLB) and the upper bound (kiUB) of ki respectively. Note that ki are integers so,   kiLB  is obviously 1. According to experience of [2, 10, 15], kiUB  is set sufficiently large to guarantee that the optimal solution does not escape. In this study, it can be set to 100.  T is randomly generated in the range of 0 and 1. Combining ki and T we get the tth individual xt=(ki,T). Create initial population randomly.Step 2.
For a givenw1, calculate the objective function. When xt is determined, zi*(kiT) can be derived accordingly. xt  and zi*(kiT) jointly determine λ.Step 3.
Differential operations: while stopping criterion is not met, implement mutation and crossover for each individual. After that, the number of population is two times the original one.Step 4.
Genetic operations: select the individuals according toλ. Those with larger λ will be chosen to the next generation. Then the number of population is the same as the original one.Step 5.
When the number of iteration reaches a predefined maximum number, output the optimal results; otherwise, repeat Steps2–4.


## 4.1.1. Model Analysis Using Linear Programming Approach

Suppose that the weights of two objectives arew1 and w2, and then the multiobjective problem can be described as
(14)Maxλ=w1u1+w2u2s.t.{u1=F1max(T,ki,zi)-F1(T,ki,zi)F1max(T,ki,zi)-F1min(T,ki,zi)u2=F2max(T,ki,zi)-F2(T,ki,zi)F2max(T,ki,zi)-F2min(T,ki,zi).w1+w2=1,F
1
max
(
T
,
k
i
,
z
i
),  F1min(T,ki,zi),  F2max(T,ki,zi), and F2min(T,ki,zi) are the tolerant maximum total cost, minimum total cost, maximum stock-out quantity, and minimum stock-out quantity, respectively, which can be given in advance by decision makers (Wee et al. [18]).Setw1′=w1/(F1max-F1min), w2′=w2/(F2max-F2min). Then, the objective function is changed to
(15)Maxλ=Fc-(w1′F1+w2′F2),
where Fc=w1F1max/(F1max-F1min)+w2F2max/(F2max-F2min) and
(16)Fw=w1′F1+w2′F2=w1′(∑i=1nhi[12DikiT+ziσi(L+kiT)]=w1′cc+1T[S+g(ki)+∑i=1nsiki])+w2′(∑i=1nσikiTkiT+L(f(zi)-zi[1-F(zi)])).Let∂Fw/∂zi=0, that is, w1′hiσikiT+L+w2′(σi/kiT)kiT+L((df(zi)/dzi)-[1-F(zi)]+zif(zi))=0.Note that for standard normal distribution,df(zi)/dzi=-zif(zi), so that
(17)1-F[zi(kiT)]=w1′hiw2′kiT.That is to say, whenki and T is known, the optimal value of zi must satisfy (17).Taking the second derivation ofTC(T,ki,zi) with respect to zi, we obtain ∂2TC(T,ki,zi)/∂zi2=(w2′σi/kiT)kiT+Lf(zi)>0, which means that the optimal zi is derived from (17) and zi*(kiT)=F-1(1-(w1′hi/w2′)kiT).Substitutingzi*(kiT) into (16), the optimal value of Fw for given ki and T is
(18)Fw=w1′(∑i=1nDihiki2T+1T[S+g(ki)+∑i=1nsiki])+w2′(∑i=1nσikiTkiT+Lf(zi*)).Finally, the linear programming model can be written as(19)Maxλ(T,ki)Max2003=Fc-w1′(∑i=1nDihiki2T+1T[S+g(ki)+∑i=1nsiki])-w2′(∑i=1nσikiTkiT+Lf(zi*))s.t.{Fc=w1F1maxF1max-F1min+w2F2maxF2max-F2min,w1′=w1F1max-F1min,w2′=w2F2max-F2min,w1+w2=1zi*(kiT)=F-1(1-w1′hiw2′kiT).The goal is to determine the bestki and T to maximize λ for the given w1 and w1.


## 4.1.2. HDE-Based Procedures for MSJRD Using LP Approach

Whenki are determined, the optimal delivery cost can be calculated by solving a TSP. zi*(kiT) can be calculated by zi*(kiT)=F-1(1-(w1′hi/w2′)kiT) when ki and T are known. Change ki and T with the following steps until maximum λ is obtained.Step 1.
Initialization: set related parameters (CR, F, and NP) for HDE. Set the lower bound (kiLB) and the upper bound (kiUB) of ki respectively. Note that ki are integers so,   kiLB  is obviously 1. According to experience of [2, 10, 15], kiUB  is set sufficiently large to guarantee that the optimal solution does not escape. In this study, it can be set to 100.  T is randomly generated in the range of 0 and 1. Combining ki and T we get the tth individual xt=(ki,T). Create initial population randomly.Step 2.
For a givenw1, calculate the objective function. When xt is determined, zi*(kiT) can be derived accordingly. xt  and zi*(kiT) jointly determine λ.Step 3.
Differential operations: while stopping criterion is not met, implement mutation and crossover for each individual. After that, the number of population is two times the original one.Step 4.
Genetic operations: select the individuals according toλ. Those with larger λ will be chosen to the next generation. Then the number of population is the same as the original one.Step 5.
When the number of iteration reaches a predefined maximum number, output the optimal results; otherwise, repeat Steps2–4.


## 4.2. Multiobjective Evolution Algorithm (MOEA) Approach for the MSJRD

In this section, a brief introduction of MOP is given. Then, an HDE-based procedure to handle the MSJRD using noninferior and crowding distance is designed.


### 4.2.1. Some Definitions of MOP

Definition 1 (multiobjective optimization problems (MOP)).
(20)
Min
F
(
x
)
=
f
1
(
x
)
,
f
2
(
x
)
,
…
,
f
k
(
x
)
Subject
to

:
g
i
(
x
)
≤
0
,
i
=
1,2
,
…
,
m
.
A general MOP consists ofn decision variables, k objective functions, and m constrains. In Definition 1, x refers to the decision space and gi(x) are constrains of MOP.Definition 2 (Pareto optimal solution).
The  optimal solution of MOP is often referred to as the Pareto optimal solution. Let vectora belong to x and suppose that x* is a subset of x. If there does not exist any vector in x* that is better than a, then a is called noninferior solution (or Pareto optimal solution) of x*. Moreover, if vector a is the noninferior solution of x, then vector a is the Pareto optimal of the MOP.


### 4.2.2. HDE-Based Procedures for MSJRD Using MOEA Approach

There exist many difficulties when applying DE to solve an MOP compared with single objective problem. The main challenges for solving MOP are as follows: how to generate offspring and how to keep Pareto solutions uniformly distributed. The classical DE is not suitable for an MOP since many good solutions may be abandoned due to its one-to-one competing mechanism. This will also be confirmed by a numerical example.Therefore, we also use an HDE which uses truncation selection to choose next generation based on front rank and crowding distance adopted by Qian and li [27]. The steps of calculating crowding distance are presented in Algorithm 1.Algorithm 1:Steps of calculating crowding distance.
Step
1. For each xi∈I, initialize distance D(i)=0
Step
2. Calculate the crowding distance of xi
Step2.1. Sorting I for each objective m,I=sort(I,m)
D(I(1))=D(I(1))+[2(I(2)·m-I(1)·m)]2
D(II)=D(II)+[2(II·m-II-1·m)]2
Fori=2,…,|I|-1
D(I(i))=D(I(i))+[(I(i+1)·m-I(i-1)·m)]2
Step2.2. D(i)=sqrt(D(i))
where|I| is the number of individuals contained in I; I(i)·m is the objective value of individual i.In this algorithm, the low front rank corresponds to the high quality of a solution. As to the those individuals with the same front rank, the larger crowding distance means better distribution. Therefore, individuals with lower front rank and larger crowding distance are selected to the next generation.The first target can be divided into an inventory problem and a delivery problem. When allki are determined, the optimal delivery cost can be calculated by solving a TSP. In addition, for a stochastic JRP with normal distributed demand, when ki, zi, and T are known, the stochastic JRP can then be solved. With the same value of ki, zi, and T in the second target, we can obtain the corresponding value of the second target. Then change ki, zi, and T with the following steps until the termination condition is satisfied. The steps of HDE-based approach are described as follows.Step 1.
Initialization: set related parameters (CR, F, and NP) for the HDE. Set the lower bound and the upper bound ofki, respectively; that is, kiLB=1 and kijUB=100. zi is randomly generated in the range of 0 and 3, which can cover 99.7% of the demand. T is randomly generated in the range of 0 and 1. Combining ki, zi, and T we get the tth individual xt=(ki,zi,T). Create initial population randomly.Step 2.
Calculate the objective function, that is, the total cost and the total shortage quantity of all items.Step 3.
Calculate the Pareto front and crowding distance of each individual.Step 4.
Differential operations: while stopping criterion is not met, implement mutation and crossover for each individual. After that, the number of population is two times the original one.Step 5.
Genetic operations: select the individuals according to the front rank and crowding distance. Then the number of population is the same as the original one.Step 6.
When the number of iteration reaches a predefined maximum number, output the optimal results; otherwise, repeat Steps2–5.


## 4.2.1. Some Definitions of MOP

Definition 1 (multiobjective optimization problems (MOP)).
(20)
Min
F
(
x
)
=
f
1
(
x
)
,
f
2
(
x
)
,
…
,
f
k
(
x
)
Subject
to

:
g
i
(
x
)
≤
0
,
i
=
1,2
,
…
,
m
.
A general MOP consists ofn decision variables, k objective functions, and m constrains. In Definition 1, x refers to the decision space and gi(x) are constrains of MOP.Definition 2 (Pareto optimal solution).
The  optimal solution of MOP is often referred to as the Pareto optimal solution. Let vectora belong to x and suppose that x* is a subset of x. If there does not exist any vector in x* that is better than a, then a is called noninferior solution (or Pareto optimal solution) of x*. Moreover, if vector a is the noninferior solution of x, then vector a is the Pareto optimal of the MOP.


## 4.2.2. HDE-Based Procedures for MSJRD Using MOEA Approach

There exist many difficulties when applying DE to solve an MOP compared with single objective problem. The main challenges for solving MOP are as follows: how to generate offspring and how to keep Pareto solutions uniformly distributed. The classical DE is not suitable for an MOP since many good solutions may be abandoned due to its one-to-one competing mechanism. This will also be confirmed by a numerical example.Therefore, we also use an HDE which uses truncation selection to choose next generation based on front rank and crowding distance adopted by Qian and li [27]. The steps of calculating crowding distance are presented in Algorithm 1.Algorithm 1:Steps of calculating crowding distance.
Step
1. For each xi∈I, initialize distance D(i)=0
Step
2. Calculate the crowding distance of xi
Step2.1. Sorting I for each objective m,I=sort(I,m)
D(I(1))=D(I(1))+[2(I(2)·m-I(1)·m)]2
D(II)=D(II)+[2(II·m-II-1·m)]2
Fori=2,…,|I|-1
D(I(i))=D(I(i))+[(I(i+1)·m-I(i-1)·m)]2
Step2.2. D(i)=sqrt(D(i))
where|I| is the number of individuals contained in I; I(i)·m is the objective value of individual i.In this algorithm, the low front rank corresponds to the high quality of a solution. As to the those individuals with the same front rank, the larger crowding distance means better distribution. Therefore, individuals with lower front rank and larger crowding distance are selected to the next generation.The first target can be divided into an inventory problem and a delivery problem. When allki are determined, the optimal delivery cost can be calculated by solving a TSP. In addition, for a stochastic JRP with normal distributed demand, when ki, zi, and T are known, the stochastic JRP can then be solved. With the same value of ki, zi, and T in the second target, we can obtain the corresponding value of the second target. Then change ki, zi, and T with the following steps until the termination condition is satisfied. The steps of HDE-based approach are described as follows.Step 1.
Initialization: set related parameters (CR, F, and NP) for the HDE. Set the lower bound and the upper bound ofki, respectively; that is, kiLB=1 and kijUB=100. zi is randomly generated in the range of 0 and 3, which can cover 99.7% of the demand. T is randomly generated in the range of 0 and 1. Combining ki, zi, and T we get the tth individual xt=(ki,zi,T). Create initial population randomly.Step 2.
Calculate the objective function, that is, the total cost and the total shortage quantity of all items.Step 3.
Calculate the Pareto front and crowding distance of each individual.Step 4.
Differential operations: while stopping criterion is not met, implement mutation and crossover for each individual. After that, the number of population is two times the original one.Step 5.
Genetic operations: select the individuals according to the front rank and crowding distance. Then the number of population is the same as the original one.Step 6.
When the number of iteration reaches a predefined maximum number, output the optimal results; otherwise, repeat Steps2–5.


## 5. Contrastive Example and Results Analysis

### 5.1. Basic Data of Numerical Example

The data come from Qu et al. [9]. Table 1 describes the items to be replenished and the center warehouse correspondingly. Tables 2 and 3 are the related parameters of items and distances between suppliers and warehouse, respectively.Table 1
Supply relationship between items and suppliers.
Supplier 1
Supplier 2
Supplier 3
Item 1
1
0
0
Item 2
0
1
0
Item 3
0
0
1
Item 4
0
0
1
F
p
40
50
60Table 2
Parameters of items.
Item 1
Item 2
Item 3
Item 4
D (unit/year)
600
900
1200
1000
σ
2 (unit2/year)
800
600
700
500
L (year)
0.02
0.02
0.02
0.02
h ($/unit/year)
5.6
21
42
15
s ($/order)
25
14
20
30
π ($/unit)
28
35
40
30
The other two parameters are as follows:S=100 and c=0.5.Table 3
Distances between suppliers and warehouse.
Warehouse
Supplier 1
Supplier 2
Supplier 3
Warehouse
0
11
9
7
Supplier 1
11
0
5
8
Supplier 2
9
5
0
10
Supplier 3
7
8
10
0In the following, two approaches named LP and MOEA are compared. The comparison contains two aspects: the Pareto solutions and some specific solutions obtained by each method. In the meanwhile, three algorithms used in each method are compared with each other. Table4 reports related parameters of HDE, DE, and GA.Table 4
Parameters of the algorithms.
Parameter
Value
Algorithms
Number of population, NP
200
HDE, DE, and GA
Maximum number of iteration, GenM
300
HDE, DE, and GA
Mutation factor,F
0.6
HDE and DE
Crossover rate, CR
0.3
HDE and DE
Probability of mutation,Pm
0.1
GA
Probability of crossover,Pc
0.9
GAFor LP-based approach, we directly setF1max(T,ki,zi)=10500, F1min(T,ki,zi)=7500, F2max(T,ki,zi)=120, and F2min(T,ki,zi)=0 according to the advice of the decision makers. This approach is also widely used by other scholars (Wee et al. [18]).


### 5.2. Comparisons for LP-Based and MOEA-Based Solutions

In this section, the above numerical example is handled using LP and MOEA. For LP, the weight of each objective must be assigned firstly. In order to compare with MOEA, the objectives can be converted to single index by setting the total cost and total shortage quantity with the same weights for MOEA when the Pareto solutions are obtained. The best results for LP whenw1=0.56 are presented in Table 5. As to MOEA, the highest index after converting is shown in Table 6.Table 5
Results for LP with HDE, DE, and GA (w1=0.56).
HDE
DE
GA
k
2, 1, 1, 1
2, 1, 1, 1
2, 1, 1, 1
z
1.67, 1.35, 0.93, 1.53
1.67, 1.35, 0.93, 1.53
1.70, 1.38, 0.96, 1.56
T
0.0824
0.0824
0.0785
F
1
8468.21
8468.21
8487.52
F
2
17.44
17.44
16.91
λ
0.7553
0.7553
0.7536Table 6
Results for MOEA with HDE, DE, and GA (w1=0.56).
HDE
DE
GA
k
2,  1,  1,  1
3,  1,  1,  1
2,  1,  1,  1
z
1.59, 1.35, 0.96, 1.49
1.49, 1.64, 1.11, 1.67
1.55, 1.37, 0.99, 1.46
T
0.0721
0.0736
0.0721
F
1
8466.57
8587.38
8475.24
F
2
17.70
12.95
17.36
λ
0.7547
0.7495
0.7543Table5 shows that HDE and DE are better than GA for LP; Table 6 implies that HDE is better than GA and GA is better than DE for MOEA. In order to further verify the conclusion, we obtained for different w1, w1is set from 0.1 to 0.9 and the results are reported in Table 7.Table 7
Results for LP with HDE, DE, and GA (w1 varies).
w
1
HDE
DE
GA
F
1
F
2
λ
F
1
F
2
λ
F
1
F
2
λ
0.1
9253.01
1.02
0.9339
9256.99
1.01
0.9339
9252.98
1.02
0.9339
0.2
9031.90
2.55
0.8809
9040.17
2.48
0.8808
9117.39
2.40
0.8762
0.3
8867.45
4.74
0.8356
8867.69
4.76
0.8354
8873.75
4.67
0.8354
0.4
8718.56
7.96
0.7977
8716.80
8.06
0.7975
8760.01
7.59
0.7941
0.5
8567.08
12.96
0.7682
8574.14
12.77
0.7678
8591.70
12.51
0.7659
0.6
8396.13
21.43
0.7493
8400.40
21.34
0.7488
8409.68
20.93
0.7483
0.7
8176.59
38.11
0.7468
8183.03
37.86
0.7460
8172.24
38.64
0.7465
0.8
7890.98
72.37
0.7751
7892.54
72.87
0.7739
7894.30
72.40
0.7742
0.9
7674.80
123.83
0.8444
7674.80
123.83
0.8444
7656.65
130.97
0.8439Set the total cost and total shortage quantity with the same weightsw1 and w2, respectively, for MOEA. Then, solutions with the highest weighted objective from the obtained Pareto solutions are shown in Table 8.Table 8
Results for MOEA with HDE, DE, and GA (w1 varies).
w
1
HDE
DE
GA
F
1
F
2
λ
F
1
F
2
λ
F
1
F
2
λ
0.1
9253.73
1.03
0.9338
9285.77
0.89
0.9337
9225.35
1.17
0.9337
0.2
9046.73
2.42
0.8807
9017.73
2.72
0.8806
9031.13
2.59
0.8807
0.3
8886.03
4.48
0.8352
8878.41
4.77
0.8343
8848.34
5.17
0.8350
0.4
8720.04
8.02
0.7972
8768.47
7.00
0.7959
8739.46
7.55
0.7970
0.5
8545.97
13.94
0.7676
8587.38
12.95
0.7648
8617.66
11.16
0.7672
0.6
8423.72
20.00
0.7486
8587.38
12.95
0.7394
8359.45
23.93
0.7483
0.7
8207.26
35.76
0.7456
8348.16
32.22
0.7215
8229.71
33.76
0.7453
0.8
7913.56
69.71
0.7735
8348.16
32.22
0.7201
7892.98
73.03
0.7735
0.9
7685.28
121.57
0.8431
8348.16
32.22
0.7187
7711.52
117.17
0.8389Table7 shows that values of each target F1 and F2 change correspondently when w1 varies, which means that different settings of the weight will result in different decisions. Moreover, when the weight of the first objective (total cost) equals 0.1, the solution is the best. When the difference between w1 and w2 becomes smaller, the solutions become worse. Table 8 implies a similar conclusion for HDE, DE, and GA.From the comparisons for specific solutions, the following conclusion can be easily drawn: (1) HDE is better than DE or GA no matter whether LP or MOEA is adopted: HDE and DE are more suitable than GA when LP is used; HDE and GA are better than DE when MOEA is used. (2) Different weights for objectives will influence the solutions, for the conflicted objectives, and the assigned weights with large ratios (i.e.,w1:w2≥3:1) may result in better solutions.


### 5.3. Nondominated Solution Analysis of MOEA

For the MOP, there have several metrics to evaluate the quality of the nondominated solutions (Robič and Filipič [38]). However, the implementation of most metrics needs a prerequisite; that is, the true Pareto front must be known. In this study, it is impossible to find the true Pareto front because the MSJRD is a practical problem. So we adopt the metric (Spacing, SP) used by Esparcia-Alcázar et al. [39, 40] to measure the distribution of solutions on the Pareto front by evaluating the variance of neighboring solutions. The lower value of SP means that better nondominated solution is obtained.SP measures the relative distances between the members of Pareto front as(21)SP=∑i=1n(d--di)2(n-1),
where n is the number of the first nondominated solutions found. The distance di is given by
(22)di=minj(|f1i(x)-f1j(x)|+|f2i(x)-f2j(x)|),di=minj(|f1i(x)-f1j(x)|+ccc)i,j=1,...,n,
where fNk(·) is the fitness of point k on objective N and d- is the mean of all di. Table 9 shows the mean and variance of SP by 10 runs using MOEA.Table 9
Statistical analysis of SP by 10 runs.
Mean
Variance
HDE
8.75
1.93
DE
17.48
10.48
GA
12.15
3.96Table9 shows that the mean and variance of SP obtained by HDE is the lowest, and corresponding values obtained by DE are biggest. That is to say, HDE is better than DE and GA for the MOEA method. The conclusion is consistent with Section 5.2. At the same time, it verifies that the conversion using weights for the MSJRD is feasible.In order to have a better understanding of the solutions’ distribution of the last generation, the entire nondominated fronts found by HDE, DE, and GA are presented from Figure2 to Figure 4.Figure 2
Nondominated solutions of the final population obtained by HDE.Figures2, 3, and 4 show that HDE and GA are capable of obtaining Pareto solutions, while the effectiveness and distribution of solutions are much worse for DE. The main reason is the one-to-one competing of DE. When trial individual dominates target individual, the trial vector (otherwise the target vector) remains to the next generation. This mechanism is different from the selection operation of the HDE, where all the target and trial individuals are kept to be chosen according to the front rank and crowding distance. So, DE is not suitable for solving this MSJRD.Figure 3
Nondominated solutions of the final population obtained by DE.Figure 4
Nondominated solutions of the final population obtained by GA.


## 5.1. Basic Data of Numerical Example

The data come from Qu et al. [9]. Table 1 describes the items to be replenished and the center warehouse correspondingly. Tables 2 and 3 are the related parameters of items and distances between suppliers and warehouse, respectively.Table 1
Supply relationship between items and suppliers.
Supplier 1
Supplier 2
Supplier 3
Item 1
1
0
0
Item 2
0
1
0
Item 3
0
0
1
Item 4
0
0
1
F
p
40
50
60Table 2
Parameters of items.
Item 1
Item 2
Item 3
Item 4
D (unit/year)
600
900
1200
1000
σ
2 (unit2/year)
800
600
700
500
L (year)
0.02
0.02
0.02
0.02
h ($/unit/year)
5.6
21
42
15
s ($/order)
25
14
20
30
π ($/unit)
28
35
40
30
The other two parameters are as follows:S=100 and c=0.5.Table 3
Distances between suppliers and warehouse.
Warehouse
Supplier 1
Supplier 2
Supplier 3
Warehouse
0
11
9
7
Supplier 1
11
0
5
8
Supplier 2
9
5
0
10
Supplier 3
7
8
10
0In the following, two approaches named LP and MOEA are compared. The comparison contains two aspects: the Pareto solutions and some specific solutions obtained by each method. In the meanwhile, three algorithms used in each method are compared with each other. Table4 reports related parameters of HDE, DE, and GA.Table 4
Parameters of the algorithms.
Parameter
Value
Algorithms
Number of population, NP
200
HDE, DE, and GA
Maximum number of iteration, GenM
300
HDE, DE, and GA
Mutation factor,F
0.6
HDE and DE
Crossover rate, CR
0.3
HDE and DE
Probability of mutation,Pm
0.1
GA
Probability of crossover,Pc
0.9
GAFor LP-based approach, we directly setF1max(T,ki,zi)=10500, F1min(T,ki,zi)=7500, F2max(T,ki,zi)=120, and F2min(T,ki,zi)=0 according to the advice of the decision makers. This approach is also widely used by other scholars (Wee et al. [18]).


## 5.2. Comparisons for LP-Based and MOEA-Based Solutions

In this section, the above numerical example is handled using LP and MOEA. For LP, the weight of each objective must be assigned firstly. In order to compare with MOEA, the objectives can be converted to single index by setting the total cost and total shortage quantity with the same weights for MOEA when the Pareto solutions are obtained. The best results for LP whenw1=0.56 are presented in Table 5. As to MOEA, the highest index after converting is shown in Table 6.Table 5
Results for LP with HDE, DE, and GA (w1=0.56).
HDE
DE
GA
k
2, 1, 1, 1
2, 1, 1, 1
2, 1, 1, 1
z
1.67, 1.35, 0.93, 1.53
1.67, 1.35, 0.93, 1.53
1.70, 1.38, 0.96, 1.56
T
0.0824
0.0824
0.0785
F
1
8468.21
8468.21
8487.52
F
2
17.44
17.44
16.91
λ
0.7553
0.7553
0.7536Table 6
Results for MOEA with HDE, DE, and GA (w1=0.56).
HDE
DE
GA
k
2,  1,  1,  1
3,  1,  1,  1
2,  1,  1,  1
z
1.59, 1.35, 0.96, 1.49
1.49, 1.64, 1.11, 1.67
1.55, 1.37, 0.99, 1.46
T
0.0721
0.0736
0.0721
F
1
8466.57
8587.38
8475.24
F
2
17.70
12.95
17.36
λ
0.7547
0.7495
0.7543Table5 shows that HDE and DE are better than GA for LP; Table 6 implies that HDE is better than GA and GA is better than DE for MOEA. In order to further verify the conclusion, we obtained for different w1, w1is set from 0.1 to 0.9 and the results are reported in Table 7.Table 7
Results for LP with HDE, DE, and GA (w1 varies).
w
1
HDE
DE
GA
F
1
F
2
λ
F
1
F
2
λ
F
1
F
2
λ
0.1
9253.01
1.02
0.9339
9256.99
1.01
0.9339
9252.98
1.02
0.9339
0.2
9031.90
2.55
0.8809
9040.17
2.48
0.8808
9117.39
2.40
0.8762
0.3
8867.45
4.74
0.8356
8867.69
4.76
0.8354
8873.75
4.67
0.8354
0.4
8718.56
7.96
0.7977
8716.80
8.06
0.7975
8760.01
7.59
0.7941
0.5
8567.08
12.96
0.7682
8574.14
12.77
0.7678
8591.70
12.51
0.7659
0.6
8396.13
21.43
0.7493
8400.40
21.34
0.7488
8409.68
20.93
0.7483
0.7
8176.59
38.11
0.7468
8183.03
37.86
0.7460
8172.24
38.64
0.7465
0.8
7890.98
72.37
0.7751
7892.54
72.87
0.7739
7894.30
72.40
0.7742
0.9
7674.80
123.83
0.8444
7674.80
123.83
0.8444
7656.65
130.97
0.8439Set the total cost and total shortage quantity with the same weightsw1 and w2, respectively, for MOEA. Then, solutions with the highest weighted objective from the obtained Pareto solutions are shown in Table 8.Table 8
Results for MOEA with HDE, DE, and GA (w1 varies).
w
1
HDE
DE
GA
F
1
F
2
λ
F
1
F
2
λ
F
1
F
2
λ
0.1
9253.73
1.03
0.9338
9285.77
0.89
0.9337
9225.35
1.17
0.9337
0.2
9046.73
2.42
0.8807
9017.73
2.72
0.8806
9031.13
2.59
0.8807
0.3
8886.03
4.48
0.8352
8878.41
4.77
0.8343
8848.34
5.17
0.8350
0.4
8720.04
8.02
0.7972
8768.47
7.00
0.7959
8739.46
7.55
0.7970
0.5
8545.97
13.94
0.7676
8587.38
12.95
0.7648
8617.66
11.16
0.7672
0.6
8423.72
20.00
0.7486
8587.38
12.95
0.7394
8359.45
23.93
0.7483
0.7
8207.26
35.76
0.7456
8348.16
32.22
0.7215
8229.71
33.76
0.7453
0.8
7913.56
69.71
0.7735
8348.16
32.22
0.7201
7892.98
73.03
0.7735
0.9
7685.28
121.57
0.8431
8348.16
32.22
0.7187
7711.52
117.17
0.8389Table7 shows that values of each target F1 and F2 change correspondently when w1 varies, which means that different settings of the weight will result in different decisions. Moreover, when the weight of the first objective (total cost) equals 0.1, the solution is the best. When the difference between w1 and w2 becomes smaller, the solutions become worse. Table 8 implies a similar conclusion for HDE, DE, and GA.From the comparisons for specific solutions, the following conclusion can be easily drawn: (1) HDE is better than DE or GA no matter whether LP or MOEA is adopted: HDE and DE are more suitable than GA when LP is used; HDE and GA are better than DE when MOEA is used. (2) Different weights for objectives will influence the solutions, for the conflicted objectives, and the assigned weights with large ratios (i.e.,w1:w2≥3:1) may result in better solutions.


## 5.3. Nondominated Solution Analysis of MOEA

For the MOP, there have several metrics to evaluate the quality of the nondominated solutions (Robič and Filipič [38]). However, the implementation of most metrics needs a prerequisite; that is, the true Pareto front must be known. In this study, it is impossible to find the true Pareto front because the MSJRD is a practical problem. So we adopt the metric (Spacing, SP) used by Esparcia-Alcázar et al. [39, 40] to measure the distribution of solutions on the Pareto front by evaluating the variance of neighboring solutions. The lower value of SP means that better nondominated solution is obtained.SP measures the relative distances between the members of Pareto front as(21)SP=∑i=1n(d--di)2(n-1),
where n is the number of the first nondominated solutions found. The distance di is given by
(22)di=minj(|f1i(x)-f1j(x)|+|f2i(x)-f2j(x)|),di=minj(|f1i(x)-f1j(x)|+ccc)i,j=1,...,n,
where fNk(·) is the fitness of point k on objective N and d- is the mean of all di. Table 9 shows the mean and variance of SP by 10 runs using MOEA.Table 9
Statistical analysis of SP by 10 runs.
Mean
Variance
HDE
8.75
1.93
DE
17.48
10.48
GA
12.15
3.96Table9 shows that the mean and variance of SP obtained by HDE is the lowest, and corresponding values obtained by DE are biggest. That is to say, HDE is better than DE and GA for the MOEA method. The conclusion is consistent with Section 5.2. At the same time, it verifies that the conversion using weights for the MSJRD is feasible.In order to have a better understanding of the solutions’ distribution of the last generation, the entire nondominated fronts found by HDE, DE, and GA are presented from Figure2 to Figure 4.Figure 2
Nondominated solutions of the final population obtained by HDE.Figures2, 3, and 4 show that HDE and GA are capable of obtaining Pareto solutions, while the effectiveness and distribution of solutions are much worse for DE. The main reason is the one-to-one competing of DE. When trial individual dominates target individual, the trial vector (otherwise the target vector) remains to the next generation. This mechanism is different from the selection operation of the HDE, where all the target and trial individuals are kept to be chosen according to the front rank and crowding distance. So, DE is not suitable for solving this MSJRD.Figure 3
Nondominated solutions of the final population obtained by DE.Figure 4
Nondominated solutions of the final population obtained by GA.


## 6. Conclusions and Future Research

In this study, a new multiobjective JRD model with stochastic demand is proposed which takes into account the service level while making the replenishment and delivery decisions. Then, two approaches to solve this complex optimization problem are designed using an improved HDE. The main contributions are as follows.(1)
Considering the difficulty to estimate the shortage cost in reality, the shortage quantity is utilized as another standard to evaluate the rationality of decisions besides the total cost. To our best knowledge, this is the first time to propose a practical multiobjective stochastic JRD model.(2)
The MOEA is adopted to solve the proposed multiobjective JRD model. The results of the numerical example and Pareto solution analysis show the feasibility of the MOEA to handle the proposed MSJRD. It enriches the application field of the MOEA.(3)
The comparison of two approaches for the MSJRD verifies that LP and MOEA are suitable for solving this MSJRD problem. Furthermore, results show that the proposed HDE is more effective than DE and GA whatever LP or MOEA method is used. This illustrates that DE is likely to combine with other algorithms so as to provide a more effective way to solve complex problems.The future research on the multiobjective JRD problem should consider more realistic assumptions such as uncertain costs, freight consolidation, and budget constraint.



---

*Source: 916057-2013-10-31.xml*