Академический Документы
Профессиональный Документы
Культура Документы
Access to this document was granted through an Emerald subscription provided by emerald-srm:401304 []
For Authors
If you would like to write for this, or any other Emerald publication, then please use our Emerald for Authors service
information about how to choose which publication to write for and submission guidelines are available for all. Please
visit www.emeraldinsight.com/authors for more information.
About Emerald www.emeraldinsight.com
Emerald is a global publisher linking research and practice to the benefit of society. The company manages a portfolio of
more than 290 journals and over 2,350 books and book series volumes, as well as providing an extensive range of online
products and additional customer resources and services.
Emerald is both COUNTER 4 and TRANSFER compliant. The organization is a partner of the Committee on Publication
Ethics (COPE) and also works with Portico and the LOCKSS initiative for digital archive preservation.
optimization
Abstract
Design:
This paper designs and optimizes an integrated inventory model in a four-echelon supply chain that
contains a supplier, a producer, a wholesaler and multiple retailers. All Four levels agree with each other
to make an integrated inventory system. Products in this model have a multi-stage production process and
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
1
1. Introduction and research literature
Today’s business environment is characterized as a highly competitive, dynamic and volatile market
(Kumar Sharma et al., 2014). The marketplace is presently characterized by heightened global
competition often against a backdrop of an excess of supply over demand (Christopher et al., 2006). The
intensification of global competition and the demand for better customer services have considerably
increased the need for supply chain integration between companies. Integration is defined as “the extent
to which all activities within an organization, and the activities of its suppliers, customers, and other
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
supply chain members, are integrated together” (Narasimhan et al., 1998). Supply chain integration1 aims
to coordinate processes along the supply chain2 that is considered as an important determinant to
maintain a competitive advantage over competitors (Christopher et al., 2006). The basis of integration can
and a fundamental shift away from the individual management of functional processes toward
management of an integrated chain of processes (Vickery et al., 2003; Kahn, 1998). Gimenez et al. (2005)
and Stevens (1989) stated that external integration is an extension of the internal integration. The
integration of levels with multi or single stage products in SCs with the aim of design and optimization of
an integrated inventory system in order to minimize the inventory cost of the chain is one of the most
critical optimization problems in SCI. Among extensive researches conducted in the last issue, the
Ekambaram et al. (2003) developed a relationally reinforced SCI model in their paper to supplement the
basic transactional contractual links and to release the latent energies needed for elevation of construction
industries in many countries. Yao et al. (2004) considered an integrated supply chain model in which one
vendor supplies items to multiple buyers. They explored the optimality structure of this integrated model
and asserted that the optimal cost curve was piece-wise convex. Van Donk et al. (2005) developed a
framework to investigate which level and scope of integration can be achieved in a supply chain
1
SCI
2
SC
2
dominated by shared resources, if the type and amount of uncertainty vary for different buyers. SooWook
(2006) examined the causal linkages among SCM practice, competition capability, the level of SCI, and
firm performance. He found that, in small firms, an efficient SCI might play a more critical role for a
sustainable performance improvement, while, in large firms it might have a more significant effect on
performance improvement. Gilbert et al. (2006) introduced a generalized order policy and derived optimal
production smoothing parameters for that order policy. Their research resulting techniques produced an
order policy that uses inventory or backlog to absorb the random variation in demand, but has immediate
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
response to variation in the forecast level of demand. Klein (2007) examined e-Business SCM
relationships between service providers and clients, focusing on the performance impacts of the level of
customization implemented by clients using vendor provided e-Business solutions and the subsequent real
Edward (2008) studied the problem of setting transfer prices in a vertically ISC in which the divisions
shared technology and transaction costs. He developed a cooperative game that provided transfer prices
for the intermediate products in the SC. Cheng Hsiao (2008) investigated the integrated stochastic
inventory problem for a two-stage supply chain consisting of a single retailer and a single supplier. Jaber
et al. (2008) investigated the coordination of order quantities amongst the players in a three level supply
chain. Their model achieves coordination amongst the members in a supply chain, assuming a common
cycle time for all non-identical buyers. They developed a mathematical model to investigate whether the
cost at a level decreases as the result of coordination or not. Van Dam et al. (2009) demonstrated that
different modeling paradigms and tools were used to successfully create a model of an oil refinery SC.
Three models presented in this paper have different characteristics so that they were represented in a
different quadrant of the modeling space. Ayoub et al. (2009) proposed an optimization model and
solution approach for designing and evaluating integrated systems of bio-energy production supply
Anderson et al. (2010) investigated the equilibrium behavior of competing supply chains, in which similar
products were sold in the same market and competed on price. Arora et al. (2010) proposed a quaternary
3
policy system towards integrated logistics and inventory aspect of the SC. A system of multi retailers and
distributors, with a unique policy that each distributor follows, was analyzed. Mohammadi Bidhandi et al.
(2011) were developed an integrated model in the design of multi-commodity, single-period SC network
problems under uncertainty. In this model, the operational costs, the customer demand, and the capacity
of the facilities were stochastic parameters with a known joint distribution. Junfang et al. (2011) studied
an integrated inventory model in an SC which is involved procurement, production and delivery activities.
The model was studied in an environment where products experience a continuous price decrease and the
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
planning was performed in an infinite time horizon. Laı´nez et al. (2012) described the enlarged scope
presently attributed to SCM, which departed from classical approaches focused on operations to a more
integrated conception. Matsui (2012) examined the economic role of transfer pricing for a vertically ISC
when a risk-averse production-division manager faced uncertainty on the outcomes from research and
development3 investment. Kedar Joshi et al. (2012) provided a paper to demonstrate a newly developed
integrated multi-criteria decision method4 with two-sided preferences or selection scenario in build-to-
order supply chains to explore the future applications like supplier parks.
Sarkar et al. (2013) published a paper which dealt with an integrated vendor–buyer SC model. Two
models were constructed based on the probability distribution of the lead time demand. The aim of their
model was to reduce the total system cost by considering the setup cost reduction of the vendor. Elimam
et al. (2013) formulated an ISC as a project network5 with activities covering: sending and receiving
orders, processing these orders as well as sending and receiving of shipments and their precedence. Das et
al. (2013) developed an integrated production inventory model of supplier and retailer in which a delay in
payment was offered by the supplier to the retailer for a constant deteriorating item and shortage was not
allowed. Khan et al. (2014) provided a simple but integrated mathematical model for determining an
optimal vendor–buyer inventory policy by accounting for quality inspection errors at the buyer’s end and
learning in production at the vendor’s end. The objective was to minimize the joint annual cost incurred in
3
R&D
4
MCDM
5
PN
4
the SC .Diabat et al. (2014) developed a nonlinear mixed integer program that minimized the cost of a
stochastic two-echelon SC. The results of their paper indicated a significant increase in costs proportional
to the size of the SC. Dong-Ping et al. (2014) formulated the integrated inventory management policy for
raw material procurement and production control by using the stochastic dynamic programming
approach. Alfalla-Luque et al. (2015) examined the relationship between employee commitment and SCI
dimensions to explain several performance measures, such as flexibility, delivery, quality, inventory, and
customer satisfaction. Their paper focused on the interrelationships between the different dimensions of
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
SCI. Khalifehzadeh et al. (2015) aimed at designing a four-echelon supply chain structure, including
multiple suppliers, multiple producers, multiple distributors, and multiple customers. Mohd Saleh et al.
(2015) proposed a framework to investigate the influence of supply chain relational capital on the
execution of SCI by adopting relational capital theory. Zhao et al. (2016) considered an integrated
multi-stage supply chain over an infinite time horizon. Lemmens et al. (2016) reviewed the literature on
model-based supply chain network design in order to identify the applicability of these models to the key
issues of the design of a vaccine supply chain. Diabat et al. (2016) developed a capacitated multi-echelon
joint location-inventory model, according to which a single product is distributed from a manufacturer to
retailers through a set of warehouses, the locations of which were determined by the model. They
developed a genetic algorithm6 based heuristic to solve the problem and the GA was validated on small
size problems. Najmi et al. (2016) addressed a model for an advanced hydrocarbon biofuel supply chain
integrated with existing petroleum refineries. This model simultaneously optimized the supply chain
design and found the equilibrium quantity of feed stocks, crude oil and final products in the integrated
supply chain. Samaranayake et al. (2016) provided a paper that its purpose was to develop a conceptual
framework of integrated supply chain model that could be used to measure, evaluate and monitor
6
GA
5
In this paper, an integrated inventory system in four-echelon supply chain is modeled under stochastic
condition. Products order quantity has a normal distribution with a known mean and variance. In other
words, to make the model more applicable to real-world supply chains, multiple stochastic constraints on
production time capacity, space and setup costs, lot sizes, number of orders, total procurement and
production costs are considered. It is noted, products in this chain are multi-stage. The aims are to
determine the agreed optimum lot size and the agreed optimum period length for each product to
minimize total cost of integrated inventory system in the chain. As the mathematical formulation of the
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
problem becomes nonlinear with a large size, the Interior Point algorithm as an effective algorithm helps
us find the optimum solution in the recent large-scale nonlinear problem. The remainder of this paper
organized as follows:
The problem along with its assumptions is described in section 2. Mathematical formulation of this model is
provided in section 3. Section 4 is devoted to the Interior Point algorithm. Numerical examples are solved in
section 5 to demonstrate the applicability of the proposed algorithm along with assessing the performance of
the solution method. Finally, a sensitivity analysis and the conclusion are given in sections 6 and 7,
respectively.
The four-echelon supply chain under stochastic condition involves several multi-stage products with the order
quantities following normal distributions with known means and variances in each level. Thus, the lot sizes,
production time capacity, total procurement and production costs, space and setup costs and number of
orders, all are assumed stochastic. The goal is to minimize the total cost of the integrated inventory model in
supply chain while the stochastic constraints are fulfilled. The following assumptions are used for
1. There are items for each product on supplier level and there are "n" products in each level of
6
2. Order quantity of product i in each level has a normal distribution with a known mean μ and a
3. The demand rate for products in levels is known, deterministic and dependent.
5. The products in different levels of the chain share unique period length and lot size.
6. Products in producer level have a multi-stage production process and each product is made up from
" "Items.
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
7. Holding costs of the products or items per unit per time unit vary among different levels of the chain.
9. The total procurement cost of the products or items in each level is constrained with a probability
10. Number of orders for products or items in each level is limited with a probability greater than a
certain value.
11. The space cost required for the products or items in each level is limited to a probability greater than
a specified value.
12. The total number of products ordered by levels is limited to a probability greater than a certain value.
13. Maximum production time capacity for producing the products is constrained by a probability
14. Maximum setup cost for producing the products is limited to a probability greater than a specified
value.
3. Mathematical formulation
3.1. Notations
Parameters
: The mean of the order quantity of product or item i in the supplier level
σ
: The variance of the order quantity of product or item i in the supplier level
7
: The probability of violating each of the stochastic constraints related to the supplier
: Fixed ordering cost related to items of ith product for supplier
ℎ
: Holding cost of jth item from ith product for supplier
: Demand rate of ith product of supplier
: Maximum number of stockpile for supplier’s products
: The cost per unit of space for ith supplier’s product
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
: Maximum space cost for supplier
: Supply cost per unit of product i that supplied by supplier
: Maximum supply cost for supplier
: Maximum number of orders for supplier
: The probability of violating each of the stochastic constraints related to the producer
: Fixed ordering cost per order of jth item from ith product of producer
8
: Production cost per unit of product i for producer
: Setup cost per unit of ith product in stage “s”
: Production time capacity per unit of ith product in stage “s”
: The expense per unit of production time capacity for unit of ith product in stage “s”
: Maximum production time capacity for producing the products in producer level
: The probability of violating each of the stochastic constraints related to the wholesaler
!: Number of retailers
"# : The mean of the order quantity of product i in the kth retailer level
σ "# : The variance of the order quantity of product i in the kth retailer level
9
"# : The probability of violating each of the stochastic constraints related to the kth retailer
∝"# : The critical point of the standard normal value for "#
"# : Fixed ordering cost per order of ith product of kth retailer
"# : The cost per unit of space for ith product of kth retailer
: Number of optimum stockpile of ith product for supplier
$
: The optimum period length of ith product for supplier
$ "# : The optimum period length of ith product for kth retailer
%: Number of products
10
s: Number of stages for producing the products which can be varied from one product to another
$
: Total inventory cost of supplier
The supplier at the first level of the four-echelon ISC provides the required items to produce the products
at the producer level. The total inventory cost of the supplier, including the ordering and holding costs, is
4 4 0
1
$
= ) * + ) *)(ℎ
& )3
$
(
− 1) 3 (1)
$
2
12 12 12
The total inventory cost of the producer, including the ordering cost in the first term, holding cost of
produced products in the second term, holding cost of items in the third term, setup cost in the fourth term
and production time capacity costs for producing the products in the fifth term is regarded as Eq. (2):
+ (∑012 )
4 4
1
$ = ) + ) ℎ $ 7 − 18
$ 2
12 12
4 0 4
1
+ ) *)(ℎ & )3 $ 7 − 18 + ) 9)7
8: $
2
12 12 12
12
+ ) 9)7
8: $ (2)
12
12
11
The wholesaler at the third level buys the produced products from the producer and sells them to multiple
retailers. The total inventory cost of the wholesaler, including the ordering and the holding costs are
4 4
1
$ = ) * + ) ℎ $ ( − 1)3 (3)
$ 2
12 12
In Eq. (3), the first term is the ordering cost and the second term is the holding cost of the wholesaler.
Note that the ordering and the holding cost depends on the number of stockpiles for wholesaler's products.
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
Retailers at the fourth level buy the products from the wholesaler and sell them to customers. The total
inventory cost of the the retailers, including the ordering and the holding cost are determined using Eq.
(4).
< 4
"# ℎ "#
$" = ) ) + $ (4)
$ "# 2 "# "#
#12 12
The stochastic constraints of this model have been stated in Section 2, where the problem was defined and
the assumptions were stated. Mentioned stochastic constraints are regarded as Eqs (5) to (21).
4
>()
?
≤
) ≥
(5)
12
>() ? ≤ ) ≥ (6)
12
>() ? ≤ ) ≥ (7)
12
4
>() ≤
) ≥
(9)
?
12
4
>() ≤ ) ≥ (10)
?
12
12
4
>() ≤ ) ≥ (11)
?
12
4
"#
>() ≤ "# ) ≥ "# EF G = 1, 2, … , ! (12)
? "#
12
>()
?
≤
) ≥
(13)
12
>() ? ≤ ) ≥ (14)
12
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
>() ? ≤ ) ≥ (15)
12
>() ?
≤
) ≥
(17)
12
>() ? ≤ ) ≥ (18)
12
>() ? ≤ ) ≥ (19)
12
>() 9)7
8: ? ≤ ) ≥ (20)
12
12
>() 9)7
8: ? ≤ ) ≥ (21)
12
12
Stochastic constraints (5) to (8) guarantee procurement and production cost limitation for supplier,
producer, wholesaler and retailers, respectively. Stochastic constraints (9) to (12) guarantee number of
orders limitation for supplier, producer, wholesaler and retailers, respectively. Stochastic constraints (13)
to (16) guarantee space costs limitation for supplier, producer, wholesaler and retailers, respectively.
13
Stochastic constraints (17) to (19) guarantee limitation of number of stockpile for supplier, producer and
wholesaler, respectively. Stochastic constraints (20) and (21) guarantee limitation of production time
capacity and setup cost for producing the products in producer level, respectively.
As stated earlier, four levels of mentioned chain interacted and agreed with each other on having the same
period length and the same number of stockpile for each product in order to provide an integrated
inventory system to optimize total cost of supply chain inventory. Based on this cooperation and
= = = and, $
= $ =$ =$
=$ "# = $
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
Accordingly, by replacing λ and T parameters in Eqs (1) to (21), the mathematical formulation of the
problem becomes:
OP% $' = ) $
+ $ + $ + $"
+ (∑012 )
4 4 0 4
1
= ) * Q + ) *)(ℎ
& )3
$ ( − 1) 3 + )
$ 2 $
12 12 12 12
4 4 0
1 1
+ ) ℎ $ ( − 1) + ) *)(ℎ & )3 $ ( − 1)
2 2
12 12 12
4
4
+ ) 9)7
8: $ + ) 9)7
8: $
12
12 12
12
4 4 < 4
1 "# ℎ "#
+ )* + ) ℎ $ ( − 1)3 + ) ) + $ (22)
$ 2 $ 2 "#
12 12 #12 12
Subject to:
4 4 4
)
$
≤ ∝
. S) T
+ )
.
(23)
12 12 12
4 4 4
) $ ≤ ∝ . S) T + ) . (24)
12 12 12
14
4 4 4
) $ ≤ ∝ . S) T + ) . (25)
12 12 12
4 4 4
12 12 12
4 4 4
1
1
) ≤ ∝
. S) + ) . (27)
$ T
12 12 12
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
4 4 4
1 1
) ≤ ∝ . S) + ) . (28)
$ T
12 12 12
4 4 4
1
1
) ≤ ∝ . S) +) . (29)
$ T
12 12 12
4 4 4
1 "# 1
) ≤ ∝"# . S) +) . EF G = 1, 2, … , ! (30)
$ T "# "# "#
12 12 12
4 4 4
)
$
≤ ∝
. S) T
+ )
.
. (31)
12 12 12
4 4 4
) $ ≤ ∝ . S) T + ) . . (32)
12 12 12
4 4 4
) $ ≤ ∝ . S) T + ) . . (33)
12 12 12
4 4 4
12 12 12
15
4 4 4
) $
≤ ∝
. S) T
+ )
. (35)
12 12 12
4 4 4
) $ ≤ ∝ . S) T + ) . (36)
12 12 12
4 4 4
) $ ≤ ∝ . S) T + ) . (37)
12 12 12
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
4
4
4
) 9)7
8: $ ≤ ∝ . S) ) T .
+ ) ) .
(38)
12
12 12
12 12
12
4
4
4
) 9)7
8: $ ≤ ∝ . S) ) T .
+ ) ) .
(39)
12
12 12
12 12
12
Note in equations (22) to (39) that Z∝ , Z∝U , Z∝V and Z∝WX are the upper α-percentile of the standard
normal distribution. The formulas given in (22) to (39) are based on the stochastic nonlinear-
programming model.
The interior point methods in mathematical programming have been the largest and the most dramatic
area of research in optimization since the development of the simplex method (Freund et al., 1996).
They belong to a certain class of algorithms to solve a wide range of linear and nonlinear convex
optimization problems. The modern era of the interior point methods dates back to 1984, when
Karmarkar proposed his algorithm for linear programming (Potra et al., 2000). His idea was to approach
the optimal solution from the strict interior of the feasible region. Interior-point methods have
permanently changed the landscape of mathematical programming theory, practice and computation.
Pasandideh et al. (2015) compared the performance of this method in solving nonlinear problems with
16
the one of an exact method titled sequential quadratic programming7, which is another efficient method
to solve nonlinear programming problems (Pasandideh et al., 2015). Moreover, Gharaei et al. (2015)
confirmed the satisfactory performance of this method to solve nonlinear optimization problems
(Gharaei et al., 2015). It is noted, efficient algorithms have superlinear convergence and superlinearly
convergent algorithms need only a couple of iterations (Potra, 2003). So, the Interior Point algorithm is
used for optimizing the recent convex nonlinear model of this paper. A typical nonlinear programming
Minimize F(x)
Subject to g (x) = 0
hl ≤ h( x) ≤ hu
(40)
xl ≤ x ≤ xu
The first problem to solve is to transform the inequality constraints in Eq. (40) to some equality
Minimize F(x)
Subject to g (x) = 0
h( x ) + s h = hu
s h + s sh = hu − hl
(41)
x + s x = xu
x − xl ≥ 0, s h , s sh , s x ≥ 0
The next step is to treat non-negativity conditions in Eq. (41) by appending the logarithmic barrier
functions to the objective function. The primal resulting barrier problem is as follows:
n n m m
Minimize Fµ = F ( x) = µ∑ ln ( x − x ) − µ ∑ ln(sx )i − µ ∑ ln(sh ) j − µ ∑ ln(ssh ) j
l i
i =1 i =l j =l j =l
Subject to g(x) =0
7
SQP
17
h( x) + sh = hu
sh + ssh = hu − hl (42)
x + s x = xu
Where, µ as the barrier parameter is a positive number. The Lagrangian function to solve Eq. (42) is:
Where y, yh , ysh , and yx are Lagrangian multipliers. Then, the first order optimality conditions are:
∇ sx Lµ = y x − µ .S x−1e = 0
∇ y Lµ = − g ( x) = 0 (44)
∇ yh Lµ = h( x) + sh − hu = 0
∇ yx Lµ = x + s x − xu = 0
∇ ysh Lµ = sh + ssh − hu + hl = 0
( X − X l ).Z .e = µ .e
Where:
18
e = [1,...,1] X = diag( x1 ,...., xn ), sh = diag(sh1 ,...,shn ),.
T
− z −1 ( x − x1 ) 0 0 0 0 0 0 −I 0
0 S h−1 (Ysh + Yh ) 0 0 0 I I 0 0
0 0 S x−1Yh 0 I 0 0 0 0
0 0 0 S sh−1Ysh 0 I 0 0 0
0 0 I 0 0 0 0 I 0
0 I 0 I 0 0 0 0 0
0 I 0 0 0 0 0 − ∇h 0
−I 0 0 0 I 0 − ∇hT H − ∇g T
− ∇g
0 0 0 0 0 0 0 0
∆ z − µ .Z −1e + ( X − X l ).e
∆
sh µ .S h e − (Ysh + Yh ).e
−1
∆ sx µ .S x−1 − Yx e
∆ ssh µ . S −1
sh
− Y sh
e
* ∆ yx = − x − S x + xu (45)
∆ ysh − S h − S sh + ( hu − hl )
∆ yh − h ( x ) − S + h
h u
∆x − ∇ x Lµ
∆
y g ( x)
Where:
19
The vector [ ∆ z , ∆ sh , ∆ sx , ∆ ssh , ∆ yx , ∆ ysh , ∆ yh , ∆ x ¸ ∆ y ] is search direction.
Along the search direction, a step size α is chosen to preserve the non-negativity conditions. The new
xk = x + α P ∆ x , yk = y + α D ∆ y
S x = S x + α P ∆ sx , y x = y x + α D ∆ yx
k k
(46)
S h = S h + α P ∆ sh , y h = y h + α D ∆ yh
k k
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
S sh = S sh + α P ∆ ssh , y sh = y sh + α D ∆ ysh
k k
Where:
α P
is step length in primal and α D
is step length in dual problem which are chosen according to a merit
function or a filter method to keep the slacks and Lagrange multipliers positive. It is noted that one step of
the Interior Point algorithm is as below that was extended in Eq. (46).
k k k k
( x , S x , S h , S sh ) → ( x , S x , S h , S sh ).
For Dual problem:
k k k k
( y , y x , y h , y sh ) → ( y , y x , y h , y sh ).
k k k k
The interior point method generates a sequence { x , S x , Sh , S sh } for a sequence of positive barrier
The iteration procedure is terminated as the relative complementary gap. The mismatches of the first
gup
≤ ε1 , (47)
1 + Dual _ Obj
20
l arg est _ mismatch _ of _ KKT ≤ ε 2 , (48)
Where:
gap = ( yh + y sh )T sh + ysh S sh + y xT S x + z T ( x _ xl ),
T
(49)
In short, the steps involved in the Interior Point method are as follows:
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
1. Initialization: Choose a proper starting point such that the non-negativity conditions are satisfied
5. Convergence test: If the solution meets the convergence criterion, the optimal solution is found,
Numerical examples are solved in the next section to demonstrate the applicability of the provided model
5. Numerical examples
In the examples presented here, there are 1 supplier, 1 producer, 1 wholesaler and 2 retailers. There are 2
products in this chain which product 1 in the producer level has a three-stage production process and
product 2 has a two-stage production process. Also, each product consists of two items which
consumption rate of 1 and 2 items in 1 product ( u[ parameter) are 2, 3 respectively. The consumption
st st st
st nd nd nd
rate of 1 item in 2 product is 1 and consumption rate of 2 item in 2 product is 2. As was stated
earlier, the order quantity of products in the numerical example follows a normal distribution with a
known mean and variance, where Z∝ , Z∝U , Z∝V and Z∝WX are assumed as 3.09 for stochastic constraints
21
The general data and parameters of supplier, producer, wholesaler and retailers in two numerical
examples are summarized in Tables (1)-(4), respectively. The starting point of solution method in two
The SAS programming code developed to solve the first example is given in Appendix A, as a
representative to all SAS programming codes written to solve all problems. Table (5) shows the optimum
solution, number of iterations to achieve the optimum solution, infeasibility and optimality error obtained
from the objective function in numerical examples which are solved by the Interior Point algorithm.
In Table (5), λ2 and λ are number of agreed optimum stockpile of products 1, 2 for supplier, producer
and wholesaler. Also, T2 and T are optimum agreed period length for products 1 and 2 in objective
function. The number of steps taken by the Interior Point method to achieve the optimal solution is given
in the column entitled as "number of iterations". As the computation is carried out in a finite-precision
environment, rounding errors prevent the algorithm from obtaining a solution satisfying the preceding
condition exactly (shown in infeasibility column). Instead, we terminate the algorithms at some small
threshold values which can be measured in an absolute or relative sense. The seventh column refers to the
"optimality error".
6. Sensitivity Analysis
A sensitivity analysis on change rate of the integrated objective function based on the change rate of the
agreed optimum stockpiles for products (Parameter “ ”) is performed in this section only for Example
#1 with the initial data shown in Tables (1)-(5). It involves increasing or decreasing parameter “ ” at
±10, ±20, ±30, ±40 and ±50 percents, Table (6) represents the results. Moreover, Figure 1 shows
change rate of the objective function with respect to the change rate of the agreed optimum stockpiles for
22
products. It can be seen from Figure 1, increasing the rate of the parameter “] ” (greater than 1), leads to
increase in the objective function with less steep and decreasing the rate of the parameter “] ” (less than
7. Conclusions
We modeled and optimized an integrated inventory system in a four-echelon SC with “n” multi-stage
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
products and stochastic constraints. The main goal is to optimize the number of agreed optimum stockpile
and period length for products between chain levels. Accordingly, the Interior Point method for solving
nonlinear and large model is utilized to optimize the research integrated objective function. The results of
the implementation of the proposed method for research large-scale numerical examples indicate low
iterations, 60 & 66 repeat to achieve the optimal solution in numerical examples 1 and 2, respectively that
shows the superlinear convergence rate of the proposed method. The optimality error of the Interior Point
method is close to zero, 7.3031058E-7 & 5.9291894E-7 in numerical examples 1 and 2, respectively, that
demonestrates high accuracy and excellent quality of Interior Point solutions. Also, Infeasibility for
examples 1 and 2 is 5.746719E-13 & 2.44509E-13 which current values are close to zero. This means that
proposed solutions from Interior Point for this research optimization problem does satisfy all stochastic
constraints. In other words, it refers to inequality stochastic constraints of research optimization problem
which are satisfied as strict inequality by the Interior Point solution process. A sensitivity analysis is
performed on the change rate of the integrated objective function versus change rate of the agreed
optimum stockpiles for products based on proposed algorithm. Sensitivity analysis revealed that
increasing the rate of the parameter “]^ ” (greater than 1) in chain levels leads to the change rate of
objective function become negative with less steep. In return, decreasing the rate of mentioned parameter
(less than 1) leads to change rate of objective function become positive with more steep compared to the
previous status. In other words, it is better to chain levels that in case of selection between low or high
stockpile compared to optimum amount, they agree with each other on the delivery of low lot size.
Because, in case of low lot size selection, the inventory cost of integrated supply chain will be lower than
23
before. However, the change rate of objective function in both cases compared with each other has less
significant changes, but mentioned less changes leads to significant changes of the objective function
value. We found that the same increase/decrease rate in “λ ” parameter leads to the same change rates of
the objective function with little differences. In general, it must be stated that there is a direct relationship
with a strong correlation between the change rate of parameter “] ” and the change rate of the integrated
inventory function. For future research, we are going to develop this model in the case of shortage and
discount is allowed as integer variables in the model. So, the future developed model is in the form of
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
Mixed Integer Nonlinear Programming8. We will provide and compare developed novel methods such as
Generalized Benders Decomposition9 and Extended Cutting Plane10 solution methods for solving the
8
MINLP
9
GBD
10
ECP
24
References
Alfalla-Luque, R., Marin-Garcia, J.A., Medina-Lopez, C. (2015) An analysis of the direct and mediated
effects of employee commitment and supply chain integration on organizational performance. Int. J.
Production Economics, 162, 242-257.
Anderson, E.J., Bao, Y. (2010) Price competition with integrated and decentralized supply chains.
European Journal of Operational Research, 200, 227-234.
Arora, V., Chan, F.T.S., Tiwari, M.K. (2010) An integrated approach for logistic and vendor managed
inventory in supply chain. Expert Systems with Applications, 37, 39-44.
Ayoub, N., Elmoshi, E., Seki, H., Naka, Y. (2009) Evolutionary algorithms approach for integrated bio-
energy supply chains optimization. Energy Conversion and Management, 50, 2944-2955.
Cheng Hsiao, Y. (2008) Integrated logistic and inventory model for a two-stage supply chain controlled
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
by the reorder and shipping points with sharing information. Int. J. Production Economics, 115, 229-235.
Christopher, M., Peck, H., Towill, D. (2006) A Taxonomy for selecting global supply chain strategies.
International Journal of Logistics Management, 17, 277-287.
Das, B.C., Das, B., Mondal, S.K. (2013) Integrated supply chain model for a deteriorating item with
procurement cost dependent credit period. Computers & Industrial Engineering, 64, 788-796.
Diabat, A., Al-Salem, M. (2014) An integrated supply chain problem with environmental considerations.
Int. J. Production Economics, 164, 330-338.
Diabat, A., Deskoores, R. (2016) A hybrid genetic algorithm based heuristic for an integrated supply
chain problem. Journal of Manufacturing Systems, 38, 172-180.
Dong-Ping, S., Jing-Xin, D., Jingjing, X. (2014) Integrated inventory management and supplier base
reduction in a supply chain with multiple uncertainties. European Journal of Operational Research, 232,
522-536.
Edward, C.R. (2008) A game-theoretic approach to transfer pricing in a vertically integrated supply chain.
Int. J. Production Economics, 115, 542-552.
Ekambaram, P., Mohan, K., Motiar, R., Thomas, N.G. (2003) Curing congenital construction industry
disorders through relationally integrated supply chains. Building and Environment, 38, 571-582.
Elimam, A.A., Dodin, B. (2013) Project scheduling in optimizing integrated supply chain operations.
European Journal of Operational Research, 224, 530-541.
Freund, R.M., Mizuno, S. (1996) Interior point methods: Current status and future directions. Optima, 51,
1-9.
Gharaei, A., Naderi, B., Mohammadi, M. (2015) Optimization of rewards in single machine scheduling in
the rewards-driven systems. Management Science Letters, 5, 629-638.
Gilbert, K.C., Chatpattananan, V. (2006) An ARIMA supply chain model with a generalized ordering
policy. Journal of Modelling in Management, 1, 33-51.
Gimenez, C., Ventura, E. (2005) Logistics-production, logistics-marketing and external integration: their
impact on performance. International Journal of Operations & Production Management, 25, 20-38.
Jaber, M.Y., Goyal, S.K. (2008) Coordinating a three-level supply chain with multiple suppliers, a vendor
and multiple buyers. International Journal of Production Economics, 116, 95-103.
Junfang, Y., Deniz, M., Bhaba, R.S. (2011) An integrated multi-stage supply chain inventory model under
an infinite planning horizon and continuous price decrease. Computers & Industrial Engineering, 61, 118-
130.
Kahn, K.A. (1998) Marketing’s integration with other departments. Journal of Business Research, 42, 53-
62.
25
Kedar Joshi, K.N., Sushil Kumar, S. (2012) Two-sided supplier-manufacturer selection in BTO supply
chain. Journal of Modelling in Management, 7, 257-273.
Khalifehzadeh, S., Seifbarghy, M., Naderi, B. (2015) A four-echelon supply chain network design
with shortage: Mathematical modeling and solution methods. Journal of Manufacturing Systems, 35, 164-
175.
Khan, M., Y. Jaber, M., Ahmad, A.R. (2014) An integrated supply chain model with errors
in quality inspection and learning in production. Omega, 42, 16-24.
Klein, R. (2007) Customization and real time information access in integrated e-Business supply chain
relationships. Journal of Operations Management, 25, 1366-1381.
Kumar Sharma, S., Bhat, A. (2014) Modelling supply chain agility enablers using ISM. Journal of
Modelling in Management, 9, 200-214.
Laı´nez, J.M., Puigjaner, L. (2012) Prospective and perspective review in integrated supply chain
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
modeling for the chemical process industry. Current Opinion in Chemical Engineering, 1, 430-445.
Lemmens, S., Decouttere, C., Vandaele, N., Bernuzzi, M. (2016) A review of integrated supply chain
network design models: Key issues for vaccine supply chains. Chemical Engineering Research and
Design, 109, 366-384.
Matsui, K. (2012) Cost-based transfer pricing under R&D risk aversion in an integrated supply chain. Int.
J. Production Economics, 139, 69-79.
Mohammadi Bidhandi, H., Mohd Yusuff, R. (2011) Integrated supply chain planning under uncertainty
using an improved stochastic approach. Applied Mathematical Modeling, 35, 2618-2630.
Mohd Saleh, Z., Mohd Roslin, R. (2015) Supply Chain Integration Strategy: A Conceptual Model of
Supply Chain Relational Capital Enabler in the Malaysian Food Processing Industry. Procedia-Social and
Behavioral Sciences, 172, 585-590.
Najmi, A., Shakouri, H., Nazari, S. (2016) An integrated supply chain: A large scale complementarity
model for the biofuel markets. Biomass and Bioenergy, 86, 88-104.
Narasimhan, R., Jayaram, J. (1998) Causal linkage in supply chain: An exploratory study of North
American manufacturing firms. Decision Sciences, 29, 579-605.
Pasandideh, S. H., Akhavan Niaki, S. T., Gharaei, A. (2015) Optimization of a multiproduct economic
production quantity problem with stochastic constraints using sequential quadratic programming.
Knowledge-Based Systems, 84, 98-107.
Potra, F. A. (2003) Interior Point Methods. Department of Mathematics and Statistics, University of
Maryland, Baltimore County, USA.
Potra, F.A., Wright, S.J. (2000) Interior-point methods. Journal of Computational and Applied
Mathematics, 124, 281-302.
Samaranayake, P., Laosirihongthong, T. (2016) Configuration of supply chain integration and delivery
performance: Unitary structure model and fuzzy approach. Journal of Modelling in Management, 11, 43-
74.
Sarkar, B., Majumder, A. (2013) Integrated vendor–buyer supply chain model with vendor’s setup
cost reduction. Applied Mathematics and Computation, 224, 362-371.
Soo Wook, K. (2006) Effects of supply chain management practices, integration and competition
capability on performance. Supply Chain Management: An International Journal, 11, 241-248.
Stevens, G. (1989) Integrating the supply chain. International Journal of Physical Distribution and
Materials Management, 19, 3-8.
Van Dam, K.H., Adhitya, A., Srinivasan, R., Lukszo, Z. (2009) Critical evaluation of paradigms for
modeling integrated supply chains. Computers and Chemical Engineering, 33, 1711-1726.
26
Van Donk, D.P., Van Der Vaart, T. (2005) A case of shared resources, uncertainty and supply chain
integration in the process industry. International Journal of Production Economics, 96, 97-108.
Vickery, S., Jayaram, J., Droge, C., Calantome, R. (2003) The effects of an integrative supply chain
strategy on customer service and financial performance: an analysis of direct versus indirect relationship.
Journal of Operations Management, 21, 523-525.
Yao, M.J., Chiou, C.C. (2004) On a replenishment coordination model in an integrated supply chain with
one vendor and multiple buyers. European Journal of Operational Research, 159, 406-419.
Zhao, S.T., Wu, K., Yuan, X.M. (2016) Optimal integer-ratio inventory coordination policy for an
integrated multi-stage supply chain. Applied Mathematical Modelling, 40, 3876-3894.
Appendix A: The SAS programming code to solve the first numerical example
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
proc optmodel;
var L {1..2} >= 0;
var T {1..2} >= 0;
minimize obj =
77/(L[1]^3*T[1])+89/(L[2]^3*T[2])+1277*T[1]*(L[1]-1)*L[1]^2+
1505*T[2]*(L[2]-
1)*L[2]^2+148/(L[1]^2*T[1])+166/(L[2]^2*T[2])+2324*T[1]*(L[1]-
1)*L[1]+3559*T[2]*(L[2]-1)*L[2]+104960*T[1]+87329.5*T[2]+63/(L[1]*T[1])+
78/(L[2]*T[2])+891*T[1]*(L[1]-1)+1074*T[2]*(L[2]-1)+110/T[1]+98/T[2];
con cons1:
672*T[1]+1290*T[2]<= 274.44;
con cons2:
858*T[1]+1560*T[2]<= 363.60;
con cons3:
1057*T[1]+2148*T[2]<= 654.90;
con cons4:
2546*T[1]+4891*T[2]<= 3651.69;
con cons5:
2090*T[1]+5775*T[2]<= 3405.65;
con cons6:
(1/T[1])+(1/T[2])<= 391.89;
con cons7:
(1/T[1])+(1/T[2])<= 285.76;
con cons8:
(1/T[1])+(1/T[2])<= 246.83;
con cons9:
(1/T[1])+(1/T[2])<= 96.38;
con cons10:
(1/T[1])+(1/T[2])<= 148.89;
con cons11:
45.36*T[1]+43*T[2]<= 12.79;
con cons12:
35.39*T[1]+46.8*T[2]<= 12.63;
con cons13:
27.74*T[1]+39.38*T[2]<= 11.75;
con cons14:
10.55*T[1]+11.68*T[2]<= 10.67;
con cons15:
27
6.19*T[1]+10.50*T[2]<= 6.71;
con cons16:
168*L[1]*T[1]+215*L[2]*T[2]<=
3.09*((9*L[1]^2+4*L[2]^2)^.5)+21*L[1]+23*L[2];
con cons17:
143*L[1]*T[1]+195*L[2]*T[2]<=
3.09*((4*L[1]^2+16*L[2]^2)^.5)+19*L[1]+18*L[2];
con cons18:
137*L[1]*T[1]+179*L[2]*T[2]<=
3.09*((9*L[1]^2+9*L[2]^2)^.5)+24*L[1]+20*L[2];
con cons19:
19877*T[1]+12675*T[2]<= 4987.17;
con cons20:
5577*T[1]+3705*T[2]<= 1419.51;
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
/* starting point */
L[1] = 2;
L[2] = 2;
T[1] = .10;
T[2] = .10;
28
Table 1. General data and parameters of supplier in two numerical examples
Level Parameters Example 1 Example 2
ܣଵ௦ 77 68
ܣଶ௦ 89 76
ܦଵ௦ 168 150
ܦଶ௦ 215 224
ܿଵ௦ 4 6
ܿଶ௦ 6 9
݂ଵ 0.45 0.52
݂ଶ 0.40 0.49
݂ଵ௦ 0.6 0.55
݂ଶ௦ 0.5 0.48
Downloaded by Australian Catholic University At 05:02 22 September 2017 (PT)
ܵ௪ 9,500 10,800
ܥ௪ 89,000 92,000
ܱ௪ 37 41
ߤଵ௪ 24 20
ߤଶ௪ 20 18
ଶ
σଵ௪ 9 4
ଶ
σଶ௪ 9 9
ߣଵ 2.4838
Example ߣଶ 2.3495
17772.156194 60 5.746719E-13 7.3031058E-7
1 ܶଵ 0.036042
ܶଶ 0.038871
ߣଵ 2.7854
Example ߣଶ 2.5104
66 2.44509E-13 5.9291894E-7
2 ܶଵ 0.0276 20815.336665
ܶଶ 0.032188
Table 6. Effects of "ߣ ” changes on the optimal results of Example #1
Figure 1: Change rate of the objective function vs. change rate of the agreed optimum stockpiles
for products