In: Operations Management
Question 1 options:
Below is a table of times for Taxis (A to H) to reach Customers
(1 to 8) who need a ride home after a night on the town. The goal
is to Minimize the time it takes for all of the Taxis to reach
their Customers. Only one Taxi will be sent to each Customer and
each Customer needs only one Taxi.
Taxi / Cust |
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
A |
15 |
6 |
19 |
15 |
17 |
15 |
8 |
17 |
B |
4 |
7 |
9 |
17 |
3 |
17 |
3 |
12 |
C |
5 |
17 |
18 |
3 |
15 |
5 |
13 |
11 |
D |
14 |
2 |
10 |
13 |
11 |
16 |
11 |
2 |
E |
19 |
17 |
18 |
11 |
8 |
11 |
13 |
16 |
F |
11 |
19 |
2 |
14 |
9 |
17 |
3 |
8 |
G |
16 |
10 |
4 |
7 |
2 |
10 |
19 |
3 |
H |
10 |
19 |
4 |
7 |
15 |
10 |
18 |
15 |
The optimal solution to this problem requires the following:
Taxi A picks up Customer
Taxi B picks up Customer
Taxi C picks up Customer
Taxi D picks up Customer
Taxi E picks up Customer
Taxi F picks up Customer
Taxi G picks up Customer
Taxi H picks up Customer
Minimum Cost =
Hint: Your cost should be between 33 and 39
Answer:
Taxi A picks up Customer 2
Taxi B picks up Customer 1
Taxi C picks up Customer 4
Taxi D picks up Customer 8
Taxi E picks up Customer 6
Taxi F picks up Customer 7
Taxi G picks up Customer 5
Taxi H picks up Customer 3
Minimum Cost = 35
Explanation:
It is an assignment problem which we can solve it using solver.
Excel Solver Solution & Parameters: