Travel times

From Neighborhood
To Neighborhood A B C D E F G H I J K L
A 1 8 11 22 17 9 19 19 22 25 33 40
B 8 1 13 25 26 14 11 24 23 20 32 33
C 11 13 1 12 14 17 21 15 24 16 24 30
D 22 25 12 1 12 13 24 18 27 19 11 21
E 17 26 14 8 1 16 17 27 25 15 9 9
F 9 14 17 13 16 1 22 18 16 6 14 21
G 19 11 21 24 17 22 1 9 12 12 24 24
H 19 24 15 18 27 18 9 1 9 6 18 22
I 22 23 24 27 25 16 12 9 1 14 19 12
J 25 20 16 19 15 6 12 6 14 1 12 14
K 33 32 24 11 9 14 24 18 19 12 1 12
L 40 33 30 21 13 21 24 22 12 14 7 1

Optimal Decisions

From Neighborhood
A B C D E F G H I J K L
To Neighborhood 1 0 1 1 0 0 0 1 0 0 1 0
A 1 1 0 0 0 1 0 0 0 0 0 0 1
B 1 1 0 0 0 0 0 0 0 0 0 0 1
C 0 0 1 0 0 0 0 0 0 0 0 0 1
D 0 0 0 1 0 0 0 0 0 0 0 0 1
E 0 0 0 1 1 0 0 0 0 0 1 1 2
F 1 0 0 0 0 1 0 0 0 1 0 0 1
G 0 0 0 0 0 0 1 1 0 0 0 0 1
H 0 0 0 0 0 0 1 1 1 1 0 0 1
I 0 0 0 0 0 0 0 1 1 0 0 0 1
J 0 0 0 0 0 1 0 1 0 1 0 0 1
K 0 0 0 0 1 0 0 0 0 0 1 0 1
L 0 0 0 0 0 0 0 0 0 0 1 1 1
maximum acceptable delivery time:
10 minutes
You are in charge of selecting a set of locations
for a new pizza delivery service. You want your
service to cover 12 neighborhoods (labeled A - L),
and there is a possible location for you within
each of these neighborhoods. Your goal is to
select the minimum number of locations that
enable you to serve all neighborhoods in 10
minutes or less. The matrix to the left contains
the travel times between the neighborhoods.
Formulate an optimization model to determine a
set of locations that will serve all neighborhoods
in 10 minutes or less.

Next, try some what-if scenarios:

What would be the impact if you expanded the
acceptable delivery time to 15 minutes or less?
What about 7 minutes or less?

Total Number of
Locations
5
1
1
1
1
1
1
1
1
1
1
1
1