Long Range Intermediate Range: Manufacturing
Long Range Intermediate Range: Manufacturing
i=1
M
subject to
ij
x s
i
S
j=1
N
ij
x
i=1
M
=
j
D
Decision Method
Solve a separate transportation problem
for each of the 4 alternatives
Choose lowest cost alternative
Fixed Production +
Alternative Cost Trans. Cost Total
1. Exp. Atlanta 2,150,000 15,740,000 17,890,000
2. Exp. Tucson 2,300,000 15,650,000 17,950,000
3. New Tucson 2,650,000 15,250,000 17,900,000
4. New Fresno 2,750,000 14,650,000 17,400,000*
Optimal Solution
Produce at and Send to
150,000 Atlanta 40,000 Dallas
110,000 Philadelphia
140,000 Cleveland 120,000 Chicago
20,000 Philadelphia
170,000 Phoenix 80,000 Denver
30,000 Los Angeles
60,000 Dallas
120,000 Fresno 120,000 Los Angeles
Opening Multiple Facilities
Rama Manufacturing wants to open one or
more facilities to serve six markets
Five possible sites, Two plant sizes
Size Capacity Fixed cost Production cost
Small 150,000 1,500,000 20
Large 300,000 2,800,000 19
Ramas Decision
Determine:
1. Number of plants to open
2. Location of plants that are opened
3. Capacity of each plant that is opened
4. Number of units to ship from plants to
markets
Cost Data
Transportation Cost
Potential Markets
Sites Bos Chi Den LA Dal Phil
Atlanta 11 8 12 18 10 7
Cleveland 9 4 11 20 12 6
Hartford 3 12 19 27 16 5
Oakland 25 19 9 6 13 21
Phoenix 26 15 7 8 9 20
Exp. Dem
(000) 70 120 80 150 100 130
0/1 Integer Programming
Problem
y
1
= 1 if a 150,000 unit plant opened in Atlanta, 0 otherwise
y
2
= 1 if a 300,000 unit plant opened in Atlanta, 0 otherwise
y
3
= 1 if a 150,000 unit plant opened in Cleveland, 0
otherwise
x
ij
= number of units shipped from plant i to market j
i = 1, ..., 10 and j = 1, ..., 6 -- 60 variables
Formulation Of Fixed Charge
Problem
ij
x
i=1
10
=
j
D
ij
x
j=1
6
s
i
S
i
y
Min 1, 500, 000(
1
y +
3
y +... +
9
y ) + 2,800, 000(
2
y +
4
y +... +
10
y )
+
ij
c
j=1
6
ij
x
i=1
10
Demand constraints
Supply constraints
Optimal Solution
Produce at and Send to
150,000 Cleveland 120,000 Chicago
30,000 Dallas
300,000 Hartford 70,000 Boston
130,000 Philadelphia
300,000 Phoenix 80,000 Denver
150,000 Los Angeles
70,000 Dallas
Total cost = 23,690,000 (7,100,000 fixed + 16,590,000
variable)
Locating Public Services
Maximize customer service
Use p-center model
N distinct population centers
open up to p facilities (p based on budget)
M possible facility sites
d
ij
= distance (time or cost) for customers
at location j to be served at site i
minimize maximum distance
Decision Variables
y
i
= 1 if facility opened at site i, 0 otherwise
x
ij
= 1 if people at j assigned to facility i, 0 otherwise
w = maximum distance between any customer and the
serving (closest) facility
Formulation
minimize z = w
subject to
i
y
i=1
M
s p
ij
x =1 for every customer j = 1,...,N
i=1
M
ij
x
= N
i
y for every site i =1,..., M
j=1
N
ij
ij
d
x
s w for every customer j = 1,...,N
i=1
M
Complexity Of Problem
If M = 20 and N = 100
20 y
i
variables
20 x 100 = 2000 x
ij
variables
2020 0/1 variables
2
2020
possible solutions
Covering Problems
Locate facilities so everyone is within
specified distance of a facility
Emergency facilities - fire or ambulance
services
Build fewest facilities to cover everyone
Solved by solving a series of p-center
problems
Planar Location
Median (Steiner-Weber) problem
travel time proportional to distance
Center-of-gravity problem
travel time proportional to squared distance
Example
Locate facility to minimize distance to
regions in city
Customer Round Trips x y
Center i per Month Coord Coord
1 30 1 4
2 50 2 5
3 20 3 3
4 60 3 6
5 30 5 2
6 40 7 4
Customer Locations
0 1 2 3 5 6 7 4
x
y
Customer region center
Center of gravity point
o Euclidean median
1
2
3
5
6
7
4
1
2
3
5
6
4
o
Median Problem
Let d
i
(x,y) = distance from customer
location i to any location (x,y)
Let w
i
= number of trips from shop to
customer region i
Select x and y to minimize travel distance
Straight-line Distance Model
Minimize
i
w
i
d x, y ( )
i=1
6
Euclidean distance =
i
x x ( )
2
+
i
y y
( )
2
(
1 2
Minimize
i
w
i
x x ( )
2
+
i
y y
( )
2
i=1
6
| |
i
w | |
Minimize
i
w
i
x x ( )
2
+
i
y y
( )
2
(
i=1
6