Professional Documents
Culture Documents
Chapter 4 - Alternative Service Levels and Sensitivity Analysis (Compatibility Mode)
Chapter 4 - Alternative Service Levels and Sensitivity Analysis (Compatibility Mode)
Chapter 4 - Alternative Service Levels and Sensitivity Analysis (Compatibility Mode)
The question was… how do they determine the Dark Plant = Existing
Guangzhou Location
location for these additional plants based solely on Light Plants = Potential Plant
Locations
Service Level?
Knowing what they did about the constant cost of building a plant the team
set out to focus the model on Service Level, which would require asking the
model to minimize the weighted average distance to all customers or
maximize the percentage of customers within a certain distance when
selecting the optimal two plant locations
CHEN’S COSMETICS – EUROPE CHEN’S COSMETICS – EUROPE
PROBLEM DEFINITION PROBLEM DEFINITION
• Chen’s Cosmetics does so well in the Chinese market that they find the opportunity
to expand the sale of their products to the European Market as well.
• The company will continue to produce all products from their three plants in China
but has teamed with successful 3PL in Europe to distribute the imported product The 3PL provides them with a list of 48 potential warehouse locations to
from key warehouse facilities across the country. select from. The lease cost would remain the same at all locations, therefore
the team was again looking to offer the best service level possible with the
three warehouse locations they were to select.
Theteam also determined that they would solve the scenario with both
service level objectives, previously discussed and then select the optimal
solution
2. How can Chen’s cosmetics solve its problems in China and Europe?
3. Which
objectives and constraints are needed to solve the problems of
Selects: Selects:
Paris, France Paris, France
Chen’s cosmetics?
Rome, Italy Belgrade, Serbia
Kremencug, Ukraine Voronezh, Russia
MATH FORMULATION FOR MAXIMIZING
NEW CONSTRAINTS FOR SERVICE
DEMAND WITHIN A GIVEN DISTANCE
• If you don’t specify any other constraints, the customers that
• To maximize the demand within a given distance, we change our are outside of the HighServiceDist will be assigned randomly
objective function to: (there is nothing to direct the optimization otherwise)
• The AvgServiceDist constraint can help:
We are The This is just an expression that says for every i,j In the end, we are just This is the same as our objective The AvgServiceDist is just a factor. This factor is then
maximizing objective combination, we test whether the distance is multiplying the demand when minimizing the total multiplied by the sum of the demand. The end result is a
now still sums up greater than HighServiceDist. If it is, we give it a by whether we made the weighted distance. This is simply single number that can be compared to the total weighted
over all 0. A 0 is bad b/c it says that if this combination assignment. If the the distance multiplied by the distance (except here we are using a single number
customers is used it adds nothing to our objective (it adds previous term is a 0 the demand for each assignment. (If instead of the average).
and facilities zero). If it is within the HighServiceDist, then we objective function gets no we divide by the total demand, we If you set the AvgServiceDist factor relatively tight, this
get a 1 and if this combination is used it helps credit, so it has incentive get the weighted average constraints will clean up the solution by making sure
the objective function. This expression is to find a 113from the distance.) customers are assigned to the closest open warehouse.
14
nothing more than a matrix in Excel HighServiceDist matrix
These
We read this just like the previous example. the This indicates
constraints
MaximumDist is just a factor that we input. If the distance that we have a
are going to
from i to j is greater than this factor (meaning it is further family of
control the
than we will allow), then we assign this term a 0. If it is less constraints. A
legitimate
than or equal to it, then it is assigned a 1. constraint for
values of Yi,j
every
When it is assigned a 0, this constraint means that Yi,j must combination
15 also be 0 (and thus not allowing customer j to be assigned of i 16
and j.
to facility i). If it is a 1, it means that there are no
restrictions on Yi,j because Yi,j can only be 0 or 1.
SECOND MODEL: FULL
FIRST MODEL: FORMULATION FORMULATION SHOWING THE
WITH MAX DISTANCE CONSTRAINT HIGHSERVICEDIST AS A
CONSTRAINT
17 18