Professional Documents
Culture Documents
Chapter 3
Chapter 3
Managers use network designmodels in two different situations. First, these models are used to
decide on locations where facilities will be established and the capacity to be assigned to each
facility. Managers must make this decision considering a time horizon over which locations and
capacities will not be altered (typically in years). Second, these models are used to assign current
demand to the available facilities and identify lanes along which product will be transported.
Managers must consider this decision at least on an annual basis as demand, prices, exchange
rates, and tariffs change. In both cases, the goal is to maximize the profit while satisfying
customer needs. The following information ideally is available in making the design decision:
• Location of supply sources and markets
• Location of potential facility sites
• Demand forecast by market
• Facility, labor, and material costs by site
• Transportation costs between each pair of sites
• Inventory costs by site and as a function of quantity
• Sale price of product in different regions
• Taxes and tariffs
• Desired response time and other service factors
The objective function minimizes the total cost (fixed+ variable) of setting up and operating the
network. The constraint in Equation 5.1 requires that the demand at each regional market be
satisfied. The constraint in Equation 5.2 states that no plant can supply more than its capacity.
(Clearly, the capacity is 0 if the plant is closed and Ki if it is open. The product of terms, KJii,
captures this effect.) The constraint in Equation 5.3 enforces that each plant is either open (yi =
1) or closed (Yi = 0). The solution identifies the plants that are to be kept open, their capacity,
and the allocation of regional demand to these plants.
Gravity models assume that both the markets and the supply sources can located as grid points
on a plane. All distances are calculated as the geometric distance between two points on the
plane. These models also assume that the transportation cost grows linearly with the quantity
shipped. We discuss a gravity model for locating a single facility that receives raw material from
supply sources and ships finished product to markets. The basic inputs to the model are as
follows:
Xn Yn: coordinate location of either a market or supply source n
Fn: cost of shipping one unit for one mile between the facility and either market or supply source
n
Dn: quantity to be shipped between facility and market or supply source n
If (x, y) is the location selected for the facility, the distance dn between the facility
at location (x, y) and the supply source or market n is given by
The optimal location is one that minimizes the total TC in Equation 5.5. The optimal solution for
SA is obtained using the Solver tool in Excel as shown in Figure 5-8. The first step is to enter the
problem data as shown in cells B5:G12. Next, we set the decision variables (x, y) corresponding
to the location of the new facility in cells B16 and B17, respectively. In cells G5:Gl2, we then
calculate the distance dn from the facility location (x,y) to each source or market using Equation
5.4. The total TC is then calculated in cell B19 using Equation 5.5.
The demand allocation problem can be solved using a demand allocation model.
The model requires the following inputs:
n = number of factory locations
m = number ofmarkets or demand points
Dj = annual demand from market j
Ki = capacity of factory i
Cij = cost of producing and shipping one unit from factory i to market j
(cost includes production, inventory, and transportation)
The goal is to allocate the demand from different markets to the various plants to minimize the
total cost of facilities, transportation, and inventory. Define the decision variables:
xij = quantity shipped from factory ito market j
The constraints in Equation 5.6 ensure that all market demand is satisfied and the constraints in
Equation 5.7 ensure that no factory produces more than its capacity.
The goal is to identify plant and warehouse locations as well as quantities shipped between
various points that minimize the total fixed and variable costs. Define the following decision
variables:
Yi = 1 if factory is located at site i, 0 otherwise
Ye = 1 if warehouse is located at site e, 0 otherwise
Xej = quantity shipped from warehouse e to market j
Xie = quantity shipped from factory at site ito warehouse e
xhi = quantity shipped from supplier h to factory at site i
The problem is formulated as the following intege~ program:
The NPV of different options should be compared when making supply chain decisions. A
negative NPV for an option indicates that the option will lose money for the supply chain. The
decision with the highest NPV provides a supply chain with the
highest financial return.
REPRESENTATIONS OF UNCERTAINTY
The manager at Trips Logistics considers both future demand and spot market prices to be
predictable. In reality, demand and prices are highly uncertain and are likely to fluctuate during
the life of any supply chain decision. For a global supply chain, exchange rates and inflation are
also likely to vary over time in differen_t locations. Supply chain managers must incorporate
these uncertainties when making network design decisions. Next we discuss some models that
can be used to represent uncertainty in factors such as demand, price, and exchange rate.
If uncertainty is ignored, a manager will always sign long-term contracts (because they are
typically cheaper) and avoid all flexible capacity (because it is more expensive). Such decisions,
however, can hurt the firm if future demand or prices are not as forecast at the time of the
decision.
A decision tree is a graphic device used to evaluate decisions under uncertainty. Decision trees
with DCFs can be used to evaluate supply chain design decisions given uncertainty in prices,
demand, exchange rates, and inflation. The first step in setting up a decision tree is to identify the
number of time periods into the future that will be considered when making the decision. The
decision maker should also identify the duration of a period-which could be a day, a month,
a quarter, or any other time period. The duration of a period should be the minimum period of
time over which factors affecting supply chain decisions may change by a significant amount.
"Significant" is hard to define, but in most cases it is appropriate to use the duration over which
an aggregate plan holds as a period. If planning is done monthly, we set the duration of a period
at a month. In the following discussion, Twill represent the number of time periods over which
the supply chain decision is to be evaluated.
The next step is to identify factors that will affect the value of the decision and are likely to
fluctuate over the next T periods. These factors include demand, price,exchange rate, and
inflation, among others. Having identified the key factors, the next step is to identify probability
distributions that define the fluctuation of each factor from one period to the next. If, for
instance, demand and price are identified as the two key factors that affect the decision, the
probability of moving from a given value of demand and price in one period to any other value
of demand and price in the next period must be defined.
The next step is to identify a periodic discount rate k to be applied to future cash flows. It is not
essential that the same discount rate apply to each period or even at every node in a period. The
discount rate should take into account the inherent risk associated with the investment. In
general, a higher discount rate should apply to investments with higher risk. The decision is now
evaluated using a decision tree, which contains the present and T future periods. Within each
period a node must be defined for every possible combination of factor values (say, demand and
price) that can be achieved. Arrows are drawn from origin nodes in Period ito end nodes in
Period i + 1. The probability on an arrow is referred to as the transition probability and is the
probability of transitioning from the origin node in Period i to the end node in Period i + 1. The
decision tree is evaluated starting from nodes in Period T and working back to Period 0. For each
node, the decision is optimized taking into account current and future values of various factors.
The analysis is based on Bellman's principle, which states that for any choice of strategy in a
given state, the optimal strategy in the next period is the one that is selected if the entire analysis
is assumed to begin in the next period. This principle allows the optimal strategy to be solved' in
a backward fashion starting at the last period. Expected future cash flows are discounted back
and included in the decision currently under consideration.